Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms

Altinkemer, 1991, Parallel savings based heuristic for the delivery problem, Oper. Res., 39, 456, 10.1287/opre.39.3.456

Cao, 1997, Tabu search and ejection chains – application to a node weighted version of the cardinality-constrained TSP, Manage. Sci., 43, 908, 10.1287/mnsc.43.7.908

Chakrapani, 1993, Massively parallel Tabu search for the quadratic assignment problem, Ann. Oper. Res., 41, 327, 10.1007/BF02022999

N. Christofides, A. Mingozzi, P. Toth, in: N. Christofides, A. Mingozzi, P. Toth, C. Sandi (Eds.), The Vehicle Routing Problem. Combinatorial Optimisation, Wiley, Chichester, 1979, pp. 315–338 (Chapter 11)

Clarke, 1964, Scheduling of vehicles from a central depot to a number of delivery points, Oper. Res., 12, 568, 10.1287/opre.12.4.568

T. Crainic, M. Toulouse, M. Gendreau, Towards a taxonomy of parallel Tabu search algorithms, Technical Report CRT-933, Centre de Recherche sur les Transports, Université de Montréal, 1993

M. Desrochers, T. Verhoog, A matching based algorithm for the vehicle routing problem, Technical Report Cahier du GERAD G-89-04, Ecole de Haultes Etudes Commerciales de Montréal, 1989

Dorndorf, 1994, Fast clustering algorithms, ORSA J. Comput., 6, 141, 10.1287/ijoc.6.2.141

Fisher, 1994, Optimal solution of vehicle routing problems using minimum k-trees, Oper. Res., 42, 626, 10.1287/opre.42.4.626

Fisher, 1981, A generalized assignment heuristic for vehicle routing, Networks, 11, 109, 10.1002/net.3230110205

Gendreau, 1994, Tabu search heuristic for the vehicle routing problem, Manage. Sci., 40, 1276, 10.1287/mnsc.40.10.1276

Gillett, 1974, A heuristic algorithm for the vehicle dispatch problem, Oper. Res., 22, 340, 10.1287/opre.22.2.340

Glover, 1986, Future paths for integer programming and links to artificial intelligence, Comput. Oper. Res., 5, 533, 10.1016/0305-0548(86)90048-1

Glover, 1989, Tabu search – part I, ORSA J. Comput., 1, 190, 10.1287/ijoc.1.3.190

Glover, 1990, Tabu search – part II, ORSA J. Comput., 2, 4, 10.1287/ijoc.2.1.4

Glover, 1992, Ejection chains, reference structures and alternating path methods for traveling salesman problems, Discrete Appl. Math., 65, 223, 10.1016/0166-218X(94)00037-E

F. Glover, New ejection chain and alternating path methods for traveling salesman problems, Computer Science and Operations Research, 1992, pp. 449–509

F. Glover, Tabu search fundamentals and uses, Technical report, Graduate School of Business and Administration, University of Colorado at Boulder, 1995

Glover, 1995, Tabu thresholding: Improved search by nonmonotonic trajectories, ORSA J. Comput., 7, 426, 10.1287/ijoc.7.4.426

F. Glover, Multilevel Tabu search and embedded search neighborhoods for the traveling salesman problem, Technical Report, Graduate School of Business and Administration, University of Colorado at Boulder, 1996

F. Glover, M. Laguna, in: C. Reeves (Ed.), Tabu Search, Blackwell Scientific Publications, Oxford, 1993, pp. 71–140

Glover, 1997

Glover, 1999, Efficient facility layout planning, Int. J. Prod. Res., 37, 263, 10.1080/002075499191760

Hadjiconstantinou, 1996, A new exact algorithm for the vehicle routing problem based on q-path and k-shortest path relaxations, Ann. Oper. Res., 61, 21, 10.1007/BF02098280

F. Harche, P. Raghavan, A generalised exchange heuristic for the capacited vehicle routing problem, Technical report, Sterm School of Business, New York University, 1991

R. Hubscher, F. Glover, Ejection chain methods and Tabu search for clustering, Technical report, Graduate School of Business and Administration, University of Colorado at Boulder, 1992

Laguna, 1995, Tabu search for multilevel generalized assignment problems, Eur. J. Oper. Res., 82, 176, 10.1016/0377-2217(93)E0174-V

Laporte, 1995, Routing problems: A bibliography, Ann. Oper. Res., 61, 227, 10.1007/BF02098290

Mole, 1976, A sequential route-building algorithm employing a generalised savings criterion, Oper. Res. Q., 27, 503, 10.1057/jors.1976.95

Osman, 1993, Metastrategy simulated annealing and Tabu search algorithms for the vehicle routing problem, Ann. Oper. Res., 41, 421, 10.1007/BF02023004

C. Rego, Local search and neighborhood structures for vehicle routing problems: Sequential and parallel algorithms, Ph.D. thesis, PRiSM Laboratory, University of Versailles, 1996

Rego, 1998, Relaxed tours and path ejections for the traveling salesman problem, Eur. J. Oper. Res., 106, 522, 10.1016/S0377-2217(97)00288-9

Rego, 1998, A subpath ejection method for the vehicle routing problem, Manage. Sci., 44, 1447, 10.1287/mnsc.44.10.1447

Renaud, 1996, An improved petal heuristic for the vehicle routing problem, J. Oper. Res. Soc., 17, 329, 10.1057/jors.1996.29

Rochat, 1995, Probabilistic diversification and intensification in local search for vehicle routing, J. Heuristics, 1, 147, 10.1007/BF02430370

Stewart, 1984, A Lagrangian relaxation heuristic for vehicle routing, Eur. J. Oper. Res., 15, 84, 10.1016/0377-2217(84)90050-X

Taillard, 1993, Parallel iterative search methods for vehicle routing problems, Networks, 23, 661, 10.1002/net.3230230804

Xu, 1996, A network flow-based Tabu search heuristic for the vehicle routing problem, Transp. Sci., 30, 379, 10.1287/trsc.30.4.379