Classical and modern heuristics for the vehicle routing problem
01 Sep 2000-International Transactions in Operational Research (No longer published by Elsevier)-Vol. 7, Iss: 4, pp 285-300
TL;DR: This article is a survey of heuristics for the Vehicle Routing Problem which contains well-known schemes such as, the savings method, the sweep algorithm and various two-phase approaches and tabu search heuristic which have proved to be the most successful metaheuristic approach.
About: This article is published in International Transactions in Operational Research.The article was published on 2000-09-01. It has received 666 citations till now. The article focuses on the topics: Tabu search & Guided Local Search.
Citations
More filters
Book•
01 Jan 2006
TL;DR: Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.
Abstract: Constraint programming is a powerful paradigm for solving combinatorial search problems that draws on a wide range of techniques from artificial intelligence, computer science, databases, programming languages, and operations research. Constraint programming is currently applied with success to many domains, such as scheduling, planning, vehicle routing, configuration, networks, and bioinformatics.
The aim of this handbook is to capture the full breadth and depth of the constraint programming field and to be encyclopedic in its scope and coverage. While there are several excellent books on constraint programming, such books necessarily focus on the main notions and techniques and cannot cover also extensions, applications, and languages. The handbook gives a reasonably complete coverage of all these lines of work, based on constraint programming, so that a reader can have a rather precise idea of the whole field and its potential. Of course each line of work is dealt with in a survey-like style, where some details may be neglected in favor of coverage. However, the extensive bibliography of each chapter will help the interested readers to find suitable sources for the missing details. Each chapter of the handbook is intended to be a self-contained survey of a topic, and is written by one or more authors who are leading researchers in the area.
The intended audience of the handbook is researchers, graduate students, higher-year undergraduates and practitioners who wish to learn about the state-of-the-art in constraint programming. No prior knowledge about the field is necessary to be able to read the chapters and gather useful knowledge. Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.
The handbook is organized in two parts. The first part covers the basic foundations of constraint programming, including the history, the notion of constraint propagation, basic search methods, global constraints, tractability and computational complexity, and important issues in modeling a problem as a constraint problem. The second part covers constraint languages and solver, several useful extensions to the basic framework (such as interval constraints, structured domains, and distributed CSPs), and successful application areas for constraint programming.
- Covers the whole field of constraint programming
- Survey-style chapters
- Five chapters on applications
Table of Contents
Foreword (Ugo Montanari)
Part I : Foundations
Chapter 1. Introduction (Francesca Rossi, Peter van Beek, Toby Walsh)
Chapter 2. Constraint Satisfaction: An Emerging Paradigm (Eugene C. Freuder, Alan K. Mackworth)
Chapter 3. Constraint Propagation (Christian Bessiere)
Chapter 4. Backtracking Search Algorithms (Peter van Beek)
Chapter 5. Local Search Methods (Holger H. Hoos, Edward Tsang)
Chapter 6. Global Constraints (Willem-Jan van Hoeve, Irit Katriel)
Chapter 7. Tractable Structures for CSPs (Rina Dechter)
Chapter 8. The Complexity of Constraint Languages
(David Cohen, Peter Jeavons)
Chapter 9. Soft Constraints (Pedro Meseguer, Francesca Rossi, Thomas Schiex)
Chapter 10. Symmetry in Constraint Programming
(Ian P. Gent, Karen E. Petrie, Jean-Francois Puget)
Chapter 11. Modelling (Barbara M. Smith)
Part II : Extensions, Languages, and Applications
Chapter 12. Constraint Logic Programming (Kim Marriott, Peter J. Stuckey, Mark Wallace)
Chapter 13. Constraints in Procedural and Concurrent Languages (Thom Fruehwirth, Laurent Michel, Christian Schulte)
Chapter 14. Finite Domain Constraint Programming Systems (Christian Schulte, Mats Carlsson)
Chapter 15. Operations Research Methods in Constraint Programming (John Hooker)
Chapter 16. Continuous and Interval Constraints(Frederic Benhamou, Laurent Granvilliers)
Chapter 17. Constraints over Structured Domains
(Carmen Gervet)
Chapter 18. Randomness and Structure (Carla Gomes, Toby Walsh)
Chapter 19. Temporal CSPs (Manolis Koubarakis)
Chapter 20. Distributed Constraint Programming
(Boi Faltings)
Chapter 21. Uncertainty and Change (Kenneth N. Brown, Ian Miguel)
Chapter 22. Constraint-Based Scheduling and Planning
(Philippe Baptiste, Philippe Laborie, Claude Le Pape, Wim Nuijten)
Chapter 23. Vehicle Routing (Philip Kilby, Paul Shaw)
Chapter 24. Configuration (Ulrich Junker)
Chapter 25. Constraint Applications in Networks
(Helmut Simonis)
Chapter 26. Bioinformatics and Constraints (Rolf Backofen, David Gilbert)
1,527 citations
TL;DR: A GA without trip delimiters, hybridized with a local search procedure is proposed, which outperforms most published TS heuristics on the 14 classical Christofides instances and becomes the best solution method for the 20 large-scale instances generated by Golden et al.
974 citations
Cites methods from "Classical and modern heuristics for..."
...Several constructive heuristics are reviewed in [2][5], they include classics from Clarke and Wright, Mole and Jameson, and Gillett and Miller....
[...]
TL;DR: This paper proposes a classification scheme and looks at a number of problem variants in location-routing: a relatively new branch of locational analysis that takes into account vehicle routing aspects.
907 citations
TL;DR: The purpose is to review the most up-to-date state-of-the-art of GVRP, discuss how the traditional VRP variants can interact with G VRP and offer an insight into the next wave of research into GVRp.
Abstract: Green Logistics has emerged as the new agenda item in supply chain management. The traditional objective of distribution management has been upgraded to minimizing system-wide costs related to economic and environmental issues. Reflecting the environmental sensitivity of vehicle routing problems (VRP), an extensive literature review of Green Vehicle Routing Problems (GVRP) is presented. We provide a classification of GVRP that categorizes GVRP into Green-VRP, Pollution Routing Problem, VRP in Reverse Logistics, and suggest research gaps between its state and richer models describing the complexity in real-world cases. The purpose is to review the most up-to-date state-of-the-art of GVRP, discuss how the traditional VRP variants can interact with GVRP and offer an insight into the next wave of research into GVRP. It is hoped that OR/MS researchers together with logistics practitioners can be inspired and cooperate to contribute to a sustainable industry.
741 citations
TL;DR: This paper defines VRP's domain in its entirety, accomplishes an all-encompassing taxonomy for the VRP literature, and delineates all ofVRP's facets in a parsimonious and discriminating manner.
685 citations
Cites background from "Classical and modern heuristics for..."
...Toth and Vigo (1999) x x x x x x x x x x x Bent and van Hentenryck (2001) x x x x x x x x x x x x x Laporte et al. (1999) x x x x x x x x x x Rego and Roucairol (1995) x x x x x x x x x x x x x x x x Ichoua et al. (2000) x x x x x x x x x x x x Savelsbergh and Sol (1998) x x x x x x x x x x x x x x…...
[...]
References
More filters
Book•
[...]
TL;DR: This book explores the meta-heuristics approach called tabu search, which is dramatically changing the authors' ability to solve a host of problems that stretch over the realms of resource planning, telecommunications, VLSI design, financial analysis, scheduling, spaceplanning, energy distribution, molecular engineering, logistics, pattern classification, flexible manufacturing, waste management,mineral exploration, biomedical analysis, environmental conservation and scores of other problems.
Abstract: From the Publisher:
This book explores the meta-heuristics approach called tabu search, which is dramatically changing our ability to solve a hostof problems that stretch over the realms of resource planning,telecommunications, VLSI design, financial analysis, scheduling, spaceplanning, energy distribution, molecular engineering, logistics,pattern classification, flexible manufacturing, waste management,mineral exploration, biomedical analysis, environmental conservationand scores of other problems. The major ideas of tabu search arepresented with examples that show their relevance to multipleapplications. Numerous illustrations and diagrams are used to clarifyprinciples that deserve emphasis, and that have not always been wellunderstood or applied. The book's goal is to provide ''hands-on' knowledge and insight alike, rather than to focus exclusively eitheron computational recipes or on abstract themes. This book is designedto be useful and accessible to researchers and practitioners inmanagement science, industrial engineering, economics, and computerscience. It can appropriately be used as a textbook in a masterscourse or in a doctoral seminar. Because of its emphasis on presentingideas through illustrations and diagrams, and on identifyingassociated practical applications, it can also be used as asupplementary text in upper division undergraduate courses.
Finally, there are many more applications of tabu search than canpossibly be covered in a single book, and new ones are emerging everyday. The book's goal is to provide a grounding in the essential ideasof tabu search that will allow readers to create successfulapplications of their own. Along with the essentialideas,understanding of advanced issues is provided, enabling researchers togo beyond today's developments and create the methods of tomorrow.
6,373 citations
TL;DR: This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem based on a general approach to heuristics that is believed to have wide applicability in combinatorial optimization problems.
Abstract: This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem. The procedure is based on a general approach to heuristics that is believed to have wide applicability in combinatorial optimization problems. The procedure produces optimum solutions for all problems tested, "classical" problems appearing in the literature, as well as randomly generated test problems, up to 110 cities. Run times grow approximately as n2; in absolute terms, a typical 100-city problem requires less than 25 seconds for one case GE635, and about three minutes to obtain the optimum with above 95 per cent confidence.
3,761 citations
TL;DR: An iterative procedure is developed that enables the rapid selection of an optimum or near-optimum route and has been programmed for a digital computer but is also suitable for hand computation.
Abstract: The optimum routing of a fleet of trucks of varying capacities from a central depot to a number of delivery points may require a selection from a very large number of possible routes, if the number of delivery points is also large. This paper, after considering certain theoretical aspects of the problem, develops an iterative procedure that enables the rapid selection of an optimum or near-optimum route. It has been programmed for a digital computer but is also suitable for hand computation.
3,724 citations
01 Jan 2001
TL;DR: In this paper, the authors present a comprehensive overview of the most important techniques proposed for the solution of hard combinatorial problems in the area of vehicle routing problems, focusing on a specific family of problems.
Abstract: The Vehicle Routing Problem covers both exact and heuristic methods developed for the VRP and some of its main variants, emphasizing the practical issues common to VRP. The book is composed of three parts containing contributions from well-known experts. The first part covers basic VRP, known more commonly as capacitated VRP. The second part covers three main variants of VRP with time windows, backhauls, and pickup and delivery. The third part covers issues arising in real-world VRP applications and includes both case studies and references to software packages. The book will be of interest to both researchers and graduate-level students in the communities of operations research and matematical sciences. It focuses on a specific family of problems while offering a complete overview of the effective use of the most important techniques proposed for the solution of hard combinatorial problems. Practitioners will find this book particularly usef
3,395 citations
Book•
01 Jan 1993TL;DR: In this paper, the Lagrangian relaxation and dual ascent tree search were used to solve the graph bisection problem and the graph partition problem, and the traveling salesman problem scheduling problems.
Abstract: Part 1 Introduction: combinatorial problems local and global optima heuristics. Part 2 Simulated annealing: the basic method enhancements and modifications applications conclusions. Part 3 Tabu search: the tabu framework broader aspects of intensification and diversification tabu search applications connections and conclusions. Part 4 Genetic algorithms: basic concepts a simple example extensions and modifications applications conclusions. Part 5 Artificial neural networks: neural networks combinatorial optimization problems the graph bisection problem the graph partition problem the travelling salesman problem scheduling problems deformable templates inequality constraints, the Knapsack problem summary. Part 6 Lagrangian relaxation: overview basic methodology Lagrangian heuristics and problem reduction determination of Lagrange multipliers dual ascent tree search applications conclusions. Part 7 Evaluation of heuristic performance: analytical methods empirical testing statistical inference conclusions.
2,571 citations