Results 31 to 40 of about 7,400,710 (384)

On Solving the Knapsack Problem with Conflicts

Mathematics
A variant of the well-known Knapsack Problem is studied in this paper. In the classic problem, a set of items is given, with each item characterized by a weight and a profit.
Roberto Montemanni, Derek H. Smith
doaj   +1 more source

A Multi-Heuristic Approach for Solving the Pre-Marshalling Problem

, 2014
Minimizing the number of reshuffling operations at maritime container terminals incorporates the Pre-Marshalling Problem (PMP) as an important problem.
Jovanovic, Raka, Tuba, Milan, Voss, Stefan   +2 more
core   +1 more source

A Compact Model for the Clustered Orienteering Problem

Logistics
Background: The Clustered Orienteering Problem is an optimization problem faced in last-mile logistics. The aim is, given an available time window, to visit vertices and to collect as much profit as possible in the given time.
Roberto Montemanni, Derek H. Smith
doaj   +1 more source

A case study of Consistent Vehicle Routing Problem with Time Windows

, 2020
We develop a heuristic for the Consistent Vehicle Routing Problem with Time Windows (ConVRPTW), which is motivated by a real-world application at a food company's distribution center.
Lespay, Hernán, Suchan, Karol
core   +1 more source

Solitary coherent structures in viscoelastic shear flow: computation and mechanism [PDF]

, 2000
Starting from stationary bifurcations in Couette-Dean flow, we compute nontrivial stationary solutions in inertialess viscoelastic circular Couette flow.
A. Groisman, A. Groisman, A. Groisman, A. N. Brooks, B. M. Baumert, C. J. S. Petrie, E. S. G. Shaqfeh, G. S. Beavers, H. Giesekus, H. Rubin, J. M. Marchal, K. Arun Kumar, M. M. Denn, Michael D. Graham, R. B. Bird, R. G. Larson, R. G. Larson, R. H. Thomas, R. Seydel, S. K. Datta, Y. L. Joo, Y. Maday, Y. Saad, Y. Saad, Z.-S. Sun   +24 more
core   +2 more sources

Multi-objective optimization and heuristic based solutions for evacuation modeling

Transportation Research Interdisciplinary Perspectives, 2023
This paper presents efficient approaches to evacuation modeling through solving the underlying transit network design problem. Given the road network of an area, our goal here is to compute a set of routes to evacuate all residents (i.e., evacuees ...
Mohimenul Kabir, Jaiaid Mobin, Muhammad Ali Nayeem, Muhammad Ahsanul Habib, M. Sohel Rahman   +4 more
doaj   +1 more source

An evolutionary algorithm for online, resource constrained, multi-vehicle sensing mission planning

, 2018
Mobile robotic platforms are an indispensable tool for various scientific and industrial applications. Robots are used to undertake missions whose execution is constrained by various factors, such as the allocated time or their remaining energy. Existing
Lane, David M., Tsiogkas, Nikolaos
core   +1 more source

Personnel shift assignment: Existence conditions and network models [PDF]

, 1993
The personnel scheduling problem is known to be a five-stage process in which the final stage involves the assignment of shifts to the days worked in the schedule.
Balakrishnan, Bodin, Czeiler, Heller, Heller, Panton, Tien   +6 more
core   +3 more sources

On Solving the Minimum Spanning Tree Problem with Conflicting Edge Pairs

Algorithms
The Minimum Spanning Tree with Conflicting Edge Pairs is a generalization that adds conflict constraints to a classical optimization problem on graphs used to model several real-world applications.
Roberto Montemanni, Derek H. Smith
doaj   +1 more source

An Optimization Heuristic Based on Non-Dominated Sorting and Tabu Search for the Fixed Spectrum Frequency Assignment Problem

IEEE Access, 2018
Frequency assignment for minimum interference is a fundamental problem in telecommunications networks. Combinatorial optimization heuristics are among the successful techniques employed to solve this problem.
Umair F. Siddiqi, Sadiq M. Sait
doaj   +1 more source