scispace - formally typeset
Search or ask a question
Journal Article•DOI•

A simple and effective evolutionary algorithm for the vehicle routing problem

Christian Prins1•
University of Technology of Troyes1
01 Oct 2004-Computers & Operations Research (Pergamon)-Vol. 31, Iss: 12, pp 1985-2002
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.
About: This article is published in Computers & Operations Research.The article was published on 2004-10-01. It has received 974 citations till now. The article focuses on the topics: Vehicle routing problem & Arc routing.
Citations
More filters
Journal Article•DOI•
A general heuristic for vehicle routing problems

[...]

David Pisinger1, Stefan Ropke1•
University of Copenhagen1
01 Aug 2007-Computers & Operations Research
TL;DR: A unified heuristic which is able to solve five different variants of the vehicle routing problem and shown promising results for a large class of vehicle routing problems with backhauls as demonstrated in Ropke and Pisinger.

1,282 citations

Cites methods from "A simple and effective evolutionary..."

  • ...[55], P—evolutionary algorithm by Prins [56], TK—bone route heuristic by Tarantilis and Kiranoudis [57], MB—AGES heuristic by Mester and Bräysy [8] (two configurations of this heuristic is included in the table), BB—hybrid genetic algorithm by Berger and Barkaoui [58], RDH—ants system algorithm by Reimann et al....

    [...]

Journal Article•DOI•
Fifty Years of Vehicle Routing

[...]

Gilbert Laporte1•
HEC Montréal1
01 Nov 2009-Transportation Science
TL;DR: In this article, the authors provide a brief account of the development in the field of exact algorithms and heuristics for the VRP and present a metaheuristic for the problem.
Abstract: The Vehicle Routing Problem (VRP) was introduced 50 years ago by Dantzig and Ramser under the title “The Truck Dispatching Problem.” The study of the VRP has given rise to major developments in the fields of exact algorithms and heuristics. In particular, highly sophisticated exact mathematical programming decomposition algorithms and powerful metaheuristics for the VRP have been put forward in recent years. The purpose of this article is to provide a brief account of this development.

785 citations

Fifty Years of Vehicle Routing

[...]

Gilbert Laporte1•
HEC Montréal1
01 Aug 2009
TL;DR: The Vehicle Routing Problem was introduced 50 years ago by Dantzig and Ramser under the title “The Truck Dispatching Problem” and has given rise to major developments in the fields of exact algorithms and heuristics.
Abstract: The Vehicle Routing Problem (VRP) was introduced 50 years ago by Dantzig and Ramser under the title “The Truck Dispatching Problem.” The study of the VRP has given rise to major developments in the fields of exact algorithms and heuristics. In particular, highly sophisticated exact mathematical programming decomposition algorithms and powerful metaheuristics for the VRP have been put forward in recent years. The purpose of this article is to provide a brief account of this development.

762 citations

Cites background or methods from "A simple and effective evolutionary..."

  • ...• Solution recombination (used in genetic search, Prins, 2004) Solution representation: j j+1 VRP solution Equivalent TSP solution Remove route delimiters i j Parent # 1 Parent # 2 i j Offspring # 1 Scan Parent # 2 from j + 1 For offspring # 2 reverse the role of the two parents • Guided evolution…...

    [...]

  • ...The first, by Rao and Zionts (1968) does not seem to have been numerically tested....

    [...]

  • ...For a review of exact algorithms for the asymmetric VRP, see Toth and Vigo (2002b). There exists a rich scientific literature on the VRP....

    [...]

Journal Article•DOI•
A survey of recent research on location-routing problems

[...]

Caroline Prodhon1, Christian Prins1•
University of Technology of Troyes1
01 Oct 2014-European Journal of Operational Research
TL;DR: This paper analyzes the recent literature on the standard LRP and new extensions such as several distribution echelons, multiple objectives or uncertain data and results of state-of-the-art metaheuristics are compared on standard sets of instances for the classical LRP, the two-echelon L RP and the truck and trailer problem.

545 citations

Journal Article•DOI•
A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems

[...]

Thibaut Vidal1, Teodor Gabriel Crainic2, Michel Gendreau3, Nadia Lahrichi3, Walter Rei2 •
Université de Montréal1, Université du Québec2, École Polytechnique de Montréal3
01 May 2012-Operations Research
TL;DR: The metaheuristic combines the exploration breadth of population-based evolutionary search, the aggressive-improvement capabilities of neighborhood-based metaheuristics, and advanced population-diversity management schemes and proves extremely competitive for the capacitated VRP.
Abstract: We propose an algorithmic framework that successfully addresses three vehicle routing problems: the multidepot VRP, the periodic VRP, and the multidepot periodic VRP with capacitated vehicles and constrained route duration. The metaheuristic combines the exploration breadth of population-based evolutionary search, the aggressive-improvement capabilities of neighborhood-based metaheuristics, and advanced population-diversity management schemes. Extensive computational experiments show that the method performs impressively in terms of computational efficiency and solution quality, identifying either the best known solutions, including the optimal ones, or new best solutions for all currently available benchmark instances for the three problem classes. The proposed method also proves extremely competitive for the capacitated VRP.

545 citations

Cites background or methods from "A simple and effective evolutionary..."

  • ...tive space as in Prins (2004). Let F be the fitness function, defined as the cost, and ãF a fitness spacing parameter....

    [...]

  • ...The first successful utilization of a giant tour representation within a genetic algorithm was reported by Prins (2004), who also introduced an efficient algorithm to optimally extract the routes from the tour....

    [...]

  • ...The ‹ discarded individuals are thus either clones (Prins 2004) or bad with respect to cost and contribution to diversity as measured by their biased fitness....

    [...]

References
More filters
Book•
Introduction to Algorithms

[...]

Thomas H. Cormen1, Charles E. Leiserson1, Ronald L. Rivest1•
Massachusetts Institute of Technology1
01 Jan 1990
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Abstract: From the Publisher: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition,this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects. In its new edition,Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity,and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage. As in the classic first edition,this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further,the algorithms are presented in pseudocode to make the book easily accessible to students from all programming language backgrounds. Each chapter presents an algorithm,a design technique,an application area,or a related topic. The chapters are not dependent on one another,so the instructor can organize his or her use of the book in the way that best suits the course's needs. Additionally,the new edition offers a 25% increase over the first edition in the number of problems,giving the book 155 problems and over 900 exercises thatreinforcethe concepts the students are learning.

21,651 citations

Journal Article•DOI•
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points

[...]

G. Clarke, J. W. Wright1•
University of Manchester1
01 Aug 1964-Operations Research
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

Monograph•DOI•
The vehicle routing problem

[...]

Paolo Toth, Daniele Vigo
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

"A simple and effective evolutionary..." refers methods in this paper

  • ...We use our own implementations for these heuristics described for instance in [ 2 ]....

    [...]

  • ...Schmitt [7] designed a GA which proved better than the Clarke and Wright heuristic on the Christofides instances [ 2 ], but worse than some constructive heuristics combined with improvement procedures....

    [...]

  • ...Several constructive heuristics are reviewed in [ 2 ][5], they include classics from Clarke and Wright, Mole and Jameson, and Gillett and Miller....

    [...]

  • ...The GA is implemented in Delphi on a 500 MHz PC under Windows 95 and already tested on the 14 instances of Christofides et al. [ 2 ] (see http://mscmga.ms.ic.ac.uk/jeb/orlib for instance)....

    [...]

Book•
New Ideas In Optimization

[...]

David Corne1, Marco Dorigo, Fred Glover2, Dipankar Dasgupta3, Pablo Moscato4, Riccardo Poli5, Kenneth V. Price •
University of Reading1, University of Colorado Boulder2, University of Memphis3, Karlsruhe Institute of Technology4, University of Birmingham5
01 Oct 1999
TL;DR: The techniques treated in this text represent research as elucidated by the leaders in the field and are applied to real problems, such as hilllclimbing, simulated annealing, and tabu search.
Abstract: Optimization is a pivotal aspect of software design. The techniques treated in this text represent research as elucidated by the leaders in the field. The optimization methods are applied to real problems, such as hilllclimbing, simulated annealing, and tabu search.

1,461 citations

Alleles, loci and the traveling salesman problem

[...]

David E. Goldberg
01 Jan 1985

1,224 citations

Related Papers (5)
The vehicle routing problem

[...]

01 Jan 2001
Paolo Toth, Daniele Vigo
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points

[...]

01 Aug 1964-Operations Research
G. Clarke, J. W. Wright
The Truck Dispatching Problem

[...]

01 Oct 1959-Management Science
George B. Dantzig, J. H. Ramser
A tabu search heuristic for the vehicle routing problem

[...]

01 Oct 1994-Management Science
Michel Gendreau, Alain Hertz, Gilbert Laporte
Algorithms for the vehicle routing and scheduling problems with time window constraints

[...]

01 Apr 1987-Operations Research
Marius M. Solomon