Adaptive memory programming for the vehicle routing problem with multiple trips

[1]  M. Balinski,et al.  On an Integer Program for a Delivery Problem , 1964 .

[2]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[3]  P. C. Yellow,et al.  A Computational Modification to the Savings Method of Vehicle Scheduling , 1970 .

[4]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[5]  David M. Ryan,et al.  An Integer Programming Approach to the Vehicle Scheduling Problem , 1976 .

[6]  Nicos Christofides,et al.  The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.

[7]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[8]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[9]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

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

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

[12]  Marshall L. Fisher,et al.  Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..

[13]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[14]  Michel Gendreau,et al.  Vehicle Routeing with Multiple Use of Vehicles , 1996 .

[15]  Alan Mercer,et al.  A tabu search algorithm for the multi-trip vehicle routing and scheduling problem , 1997, Eur. J. Oper. Res..

[16]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[17]  Alan Mercer,et al.  The multi-trip vehicle routing problem , 1998, J. Oper. Res. Soc..

[18]  Michel Gendreau,et al.  A tabu search heuristic for the heterogeneous fleet vehicle routing problem , 1999, Comput. Oper. Res..

[19]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[20]  Luca Maria Gambardella,et al.  Adaptive memory programming: A unified view of metaheuristics , 1998, Eur. J. Oper. Res..

[21]  Christos D. Tarantilis,et al.  BoneRoute: An Adaptive Memory-Based Method for Effective Fleet Management , 2002, Ann. Oper. Res..

[22]  Gilbert Laporte,et al.  A tabu search heuristic and adaptive memory procedure for political districting , 2003, Eur. J. Oper. Res..

[23]  Saïd Salhi,et al.  A multi-phase constructive heuristic for the vehicle routing problem with multiple trips , 2003, Discret. Appl. Math..

[24]  Hans Kellerer,et al.  Knapsack problems , 2004 .

[25]  Fred W. Glover,et al.  Adaptive memory search for Boolean optimization problems , 2004, Discret. Appl. Math..

[26]  Elise Miller-Hooks,et al.  A TABU search heuristic for the team orienteering problem , 2005, Comput. Oper. Res..

[27]  Samad Ahmadi,et al.  Greedy random adaptive memory programming search for the capacitated clustering problem , 2005, Eur. J. Oper. Res..

[28]  Christos D. Tarantilis,et al.  Solving the vehicle routing problem with adaptive memory programming methodology , 2005, Comput. Oper. Res..

[29]  G. Laporte,et al.  Discrete Optimization The multi-depot vehicle routing problem with inter-depot routes , 2007 .