Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems

Thompson, Paul M.; Psaraftis, Harilaos N.

doi:10.1287/opre.41.5.935

Cited by 232 publications

(106 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For the class of partitioning problems, Thompson et al [41,42] defined the concept of a cyclic exchange neighborhood, which is the transfer of single elements between several subsets in a cyclic manner; for example, a 2-exchange move can be seen as a cyclic exchange of length two. Thompson et al showed that for any current solution to a partitioning problem a new, edge-weighted graph can be constructed, where the set of nodes is split into subsets according to a partition induced by the current solution of the partitioning problem.…”

Section: Incorporating Exact Algorithms In Metaheuristicsmentioning

confidence: 99%

Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification

Puchinger

Raidl

2005

Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach

211

115

View full text Add to dashboard Cite

Abstract. In this survey we discuss different state-of-the-art approaches of combining exact algorithms and metaheuristics to solve combinatorial optimization problems. Some of these hybrids mainly aim at providing optimal solutions in shorter time, while others primarily focus on getting better heuristic solutions. The two main categories in which we divide the approaches are collaborative versus integrative combinations. We further classify the different techniques in a hierarchical way. Altogether, the surveyed work on combinations of exact algorithms and metaheuristics documents the usefulness and strong potential of this research direction.

show abstract

Section: Incorporating Exact Algorithms In Metaheuristicsmentioning

confidence: 99%

Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification

Puchinger

Raidl

2005

Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach

211

115

View full text Add to dashboard Cite

show abstract

“…The procedure stops at a local minimum when no further improvements are identified. In the multi-route case, procedures that exploit the multi-route structure of the VRP are developed to exchange arcs (Thompson & Psaraftis, 1993;Van Breedam 1994). …”

Section: Improvement Heuristicsmentioning

confidence: 99%

Heuristics for Solving Problem of Evacuating Non-Ambulatory People in a Short-Notice Disaster

Pico¹,

Tan²

2012

View full text Add to dashboard Cite

Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instruction, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to ABSTRACT (maximum 200 words)As Humanitarian Assistance and Disaster Relief (HADR) operations gain importance, a number of problems become evident. The time-sensitive problem of evacuating non-ambulatory people from a disaster area proves to be a challenging combinatorial optimization problem. The scope of the problem is defined by drawing analogies to similar vehicle routing problems that have been previously addressed. Based on the basic Max-Min Ant System (MMAS) algorithm modeled after the behavior of ants seeking food, potential solution approaches to this problem are enhanced to improve quality and efficiency by hybridizing features such as a best solution list, elite ants, ranked contribution system, and heuristic procedures during route construction. Using a Nearly-Orthogonal Latin Hypercubes (NOLH) experimental design, the algorithm parameters are tuned for best empirical performance for a range of test scenarios. SUBJECT TERMS HEURISTICS FOR SOLVING PROBLEM OF EVACUATING NON-AMBULATORY PEOPLE IN A SHORT-NOTICE DISASTER

show abstract

“…applied to the vehicle routing problems in [16,17]. The idea of defining VLSN as the composition of several independent moves emerged in [18].…”

Section: Related Workmentioning

confidence: 99%

Constraint-based Very Large-Scale Neighborhood search

2011

View full text Add to dashboard Cite

Very Large-Scale Neighborhood (VLSN) search is the idea of using neighborhoods of exponential size to find high-quality solutions to complex optimization problems efficiently. However, so far, VLSN algorithms are essentially described and implemented in terms of low-level implementation concepts, preventing code reuse and extensibility which are trademarks of constraint-programming systems. This paper aims at remedying this limitation and proposes a constraint-based VLSN (CBVLSN) framework to describe VLSNs declaratively and compositionally. Its main innovations are the concepts of cycle-consistent MoveGraphs and compositional moves which make it possible to specify an application in terms of constraints and objectives and to derive a dedicated VLSN algorithm automatically. The constraint-based VLSN framework has been prototyped in COMET and its efficiency is shown to be comparable to dedicated implementations.

show abstract

Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems

Cited by 232 publications

References 23 publications

Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification

Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification

Heuristics for Solving Problem of Evacuating Non-Ambulatory People in a Short-Notice Disaster

Constraint-based Very Large-Scale Neighborhood search

Contact Info

Product

Resources

About