Local Search for Vehicle Routing and Scheduling Problems

Local search and local search-based metaheuristics are currently the only available methods for obtaining good solutions to large vehicle routing and scheduling problems. In this paper we provide a...

[1]  P. Miliotis,et al.  An algorithm for the planar three-index assignment problem , 1994 .

[2]  Tore Grünert,et al.  A Note on Single Alternating Cycle Neighborhoods for the TSP , 2005, J. Heuristics.

[3]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[4]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[5]  John E. Beasley,et al.  Route first--Cluster second methods for vehicle routing , 1983 .

[6]  Fred Glover.  New Ejection Chain and Alternating Path Methods for Traveling Salesman Problems , 1992, Computer Science and Operations Research.

[7]  Dushyant Sharma,et al.  Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem , 2001, Math. Program..

[8]  Robert A. Russell,et al.  A multiphase approach to the period routing problem , 1991, Networks.

[9]  Jeffrey L. Rummel,et al.  A Subpath Ejection Method for the Vehicle Routing Problem , 1998 .

[10]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[11]  Fred W. Glover,et al.  Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move , 1996, J. Heuristics.

[12]  Silvano Martello,et al.  Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .

[13]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[14]  Michel Gendreau,et al.  A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows , 1998, Oper. Res..

[15]  E. Lawler,et al.  Well-solved special cases , 1985 .

[16]  James B. Orlin,et al.  Creating Very Large Scale Neighborhoods out of Smaller Ones by Compounding Moves: A Study on the Vehicle Routing Problem , 2002 .

[17]  Manuel Laguna,et al.  Tabu Search , 1997 .

[18]  E. Balas,et al.  New classes of efficiently solvable generalized Traveling Salesman Problems , 1999, Ann. Oper. Res..

[19]  Chris Walshaw,et al.  A Multilevel Approach to the Travelling Salesman Problem , 2002, Oper. Res..

[20]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[21]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..

[22]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

[23]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[24]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[25]  Paolo Toth,et al.  Branch-And-Bound Algorithms for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[26]  Gerhard J. Woeginger,et al.  A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem , 2000, Math. Program..

[27]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[28]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[29]  Robert A. Russell,et al.  Hybrid Heuristics for the Vehicle Routing Problem with Time Windows , 1995, Transp. Sci..

[30]  Paolo Toth,et al.  An Overview of Vehicle Routing Problems , 2002, The Vehicle Routing Problem.

[31]  Paul M. Thompson,et al.  Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems , 1993, Oper. Res..

[32]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[33]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[34]  G. Dueck,et al.  Record Breaking Optimization Results Using the Ruin and Recreate Principle , 2000 .

[35]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[36]  Roberto Cordone,et al.  A Heuristic for the Vehicle Routing Problem with Time Windows , 2001, J. Heuristics.

[37]  Jacques Desrosiers,et al.  A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems , 1998 .

[38]  Peter I. Cowling,et al.  Effective Local and Guided Variable Neighbourhood Search Methods for the Asymmetric Travelling Salesman Problem , 2001, EvoWorkshops.

[39]  Stefan Irnich,et al.  Shortest Path Problems with Resource Constraints , 2005 .