Abstract
In this paper we describe a Parallel Tabu Search algorithm for the vehicle routing problem under capacity and distance restrictions. In the neighborhood search, the algorithm uses compound moves generated by an ejection chain process. Parallel processing is used to explore the solution space more extensively and different parallel techniques are used to accelerate the search process. Tests were carried out on a network of SUNSparc workstations and computational results for a set of benchmark problems prove the efficiency of the algorithm proposed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Bodin, B. Golden, A. Assad, and M. Ball, Routing and scheduling of vehicles and crews: the state of the art, Computers and Operations Research, 10(1983)63.
N. Christofides, The Traveling Salesman Problem in: A Guide Tour of Combinatorial Optimisation ed. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys (Wiley, Chichester, 1985) p. 431.
N. Christofides, E. Hadjiconstantinou, and A. Mingozzi, A new exact algorithm for the vehicle routing problem based on q-path and k-shortest path relaxations, Working paper, The Management School, Imperial College, London, (1993).
N. Christofides, A. Mingozzi, and P. Toth, The Vehicle Routing Problem in: Combinatorial Optimisation, ed. N. Christofides, A. Mingozzi, P. Toth and C. Sandi,(Wiley, Chichester, 1979) p. 315.
G. Clark and J. W. Wright, Scheduling of vehicles from a central depot to a number of delivery points, Operations Research, 12 (1964) 568.
M. Dam and M. Zachariasen, Tabu Search on the Geometric Traveling Salesman Problem, M. S. Thesis, Department of Computer Science, University of Copenhagen, (1994).
U. Dorndorf and E. Pesch, Fast clustering algorithms, ORS A Journal on Computing, 6(1994) 141.
M. L. Fisher, Optimal solution of vehicle routing problems using minimum k-trees, Operations Research, 42 (1994) 626.
M. Gendreau, A. Hertz, and G. Laporte, Tabu search heuristic for the vehicle routing problem, Management Science, 40 (1994) 1276.
F. Glover, Future paths for integer programming and links to artificial intelligence, Computers and Operations Research, 5 (1986) 533.
F. Glover, Multilevel tabu search and embedded search neighborhoods for the traveling salesman problem, Working paper, University of Colorado at Boulder,Graduate School of Business and Administration (1991).
F. Glover, New ejection chain and alternating path methods for traveling salesman problems, Computer Science and Operations Research, (1992)449.
F. Glover and D. de Werra, Tabu Search, Annals of Operations Research, (Baltzer Science Publishers, 1993) 41.
F. Glover and E. Pesch, TSP Ejection chains. Working paper, University of Colorado at Boulder,Graduate School of Business and Administration (1995).
R. Hubscher and F. Glover, Ejection chain methods and tabu search for clustering, Working paper, Graduate School of Business and Administration, University of Colorado at Boulder (1992).
M. Laguna, J. P. Kelly, J. L. Gonzalez-Valarde, and F Glover, Tabu search for multilevel generalized assignment problems, Working paper, Graduate School of Business and Administration, University of Colorado at Boulder (1991).
I. H. Osman, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem in: Annals of Operations Research, (Baltzer Science Publishers, 1993)41 p. 421.
V. M. Pureza and P. M. França, Vehicle routing problems via tabu search metaheuristic, Working paper CRT-747, Centre de Recherche sur les Transports, Université de Montréal (1991).
C. R. Reeves, Modem Heuristic Techniques for Combinatorial Optimisation, (Blackwell, Oxford, 1993).
C. Rego and C. Roucairol, An efficient implementation of ejection chain procedures for the vehicle routing problem, Working paper, 44, Laboratoire PRiSM, Université de Versailles, (1994).
E. Taillard, Parallel iterative search methods for vehicle routing problems, Networks, 23 (1993) 661.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Rego, C., Roucairol, C. (1996). A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem. In: Osman, I.H., Kelly, J.P. (eds) Meta-Heuristics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1361-8_40
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1361-8_40
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8587-8
Online ISBN: 978-1-4613-1361-8
eBook Packages: Springer Book Archive