A parallel tabu search heuristic for the vehicle routing problem with time windows

Transportation Research Part C: Emerging Technologies

Volumn 5, Issue 2, 1997, Pages 109-122

  Badeau, Philippe ^a   Guertin, François ^b   Gendreau, Michel ^b   Potvin, Jean Yves ^b   Taillard, Eric ^c  

^a UNIVERSITÉ CLERMONT AUVERGNE   (France)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; COMPUTER WORKSTATIONS; DISTRIBUTED COMPUTER SYSTEMS;

VEHICLE ROUTING PROBLEM;

TRANSPORTATION;

INTELLIGENT TRANSPORTATION SYSTEMS;

EID: 0031284456     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0968-090X(97)00005-3     Document Type: Article

References (40)

1. Baker, E. K. and Schaffer, J. R. (1988) Solution improvement heuristics for the vehicle routing and scheduling problem with time window constraints. American Journal of Mathematical and Management Sciences 6, 261-300.
2. Blanton, J. L. and Wainwright, R. L. (1993) Multiple vehicle routing with time and capacity constraints using genetic algorithms. In Proceedings of the Fifth International Conference on Genetic Algorithms, ed. S. Forrest, pp. 452-459. Morgan Kaufmann, San Mateo, CA, U.S.A.
3. Chakrapani, J. and Skorin-Kapov, J. (1993) Massively parallel tabu search for the quadratic assignment problem. Annals of Operations Research 41, 327-341.
4. Chiang, W. C. and Russell, R. A. (1993) Hybrid heuristics for the vehicle routing problem with time windows. Working paper, Department of Quantitative Methods, University of Tulsa, Tulsa, OK, U.S.A. (Forthcoming in Annals of Operations Research 63.)
5. Crainic, T. G., Toulouse, M. and Gendreau, M. (1993a) An appraisal of asynchronous parallelization approaches for tabu search algorithms. Technical report CRT-935. Centre de recherche sur les transports, Université de Montréal, Montréal, Canada. (Forthcoming in Annals of Operations Research.)
6. Crainic, T. G., Toulouse, M. and Gendreau, M. (1993b) Towards a taxonomy of parallel tabu search algorithms. Technical report CRT-933, Centre de recherche sur les transports, Université de Montreal, Montréal, Canada.
7. Crainic, T. G., Toulouse, M. and Gendreau, M. (1995) Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements. OR Spektrum 17, 113-123.
8. Desrochers, M., Desrosiers, J. and Solomon, M. M. (1992) A new optimization algorithm for the vehicle routing problem with time windows. Operations Research 40, 342-354.
9. Desrochers, M., Lenstra, J. K., Savelsbergh, M. W. P. and Soumis, F. (1988) Vehicle routing with time windows: optimization and approximation. In Vehicle Routing: Methods and Studies, eds B. L. Golden and A. A. Assad, pp. 64-84. North-Holland, Amsterdam.
10. Desrosiers, J., Dumas, Y., Solomon, M. M. and Soumis, F. (1992) Time constrained routing and scheduling. Technical Report G-92-42. Groupe d'études et de recherche en analyse des décisions, École des Hautes Études Commerciales, Montréal, Canada. (Forthcoming in Handbooks in Operations Research and Management Science. North-Holland, Amsterdam.)
11. Garcia, B. L., Potvin, J. Y. and Rousseau, J. M. (1994) A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints. Computers & Operations Research 21, 1025-1033.
12. Gendreau, M., Hertz, A. and Laporte, G. (1992) New insertion and postoptimization procedures for the traveling salesman problem. Operations Research 40, 1086-1094.
13. Gendreau, M., Hertz, A., Laporte, G. and Stan, M. (1995) A generalized insertion heuristic for the traveling salesman problem with time windows. Technical report CRT-95-07. Centre de recherche sur les transports, Université de Montréal, Montréal, Canada.
14. Glover, F. (1986) Future paths for integer programming and links to artificial intelligence. Computers & Operations Research 5, 533-549.
15. Glover, F. (1989) Tabu search - Part I. ORSA Journal on Computing 1, 190-206.
16. Glover F., (1990) Tabu Search - Part II. ORSA Journal on Computing 2, 4-32.
17. Holland, J. H. (1975) Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor.
18. Kolen, A., Rinnooy Kan, A. H. G. and Trienekens, H. (1987) Vehicle routing with time windows. Operations Research 35, 266-273.
19. Kontoravdis, G. and Bard, J. (1995) A GRASP for the vehicle routing problem with time windows. ORSA Journal on Computing 7, 10-23.
20. Lin, S. (1965) Computer solution of the traveling salesman problem. Bell System Technical Journal 44, 2245-2269.
21. Malek, M., Guruswamy, M., Pandya, M. and Owens, H. (1989) Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem. Annals of Operations Research 21, 59-84.
22. Or, I. (1976) Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. Ph.D. Dissertation, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL.
23. Potvin, J. Y. and Bengio, S. (1996) The vehicle routing problem with time windows, Part II: Genetic search. INFORMS Journal on Computing 8, 165-172.
24. Potvin, J. Y. and Rousseau, J. M. (1993) A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research 66, 331-340.
25. Potvin, J. Y. and Rousseau, J. M. (1995) An exchange heuristic for routing problems with time windows. Journal of the Operational Research Society 46, 1433-1446.
26. Potvin, J. Y., Kervahut, T., Garcia, B. L. and Rousseau, J. M. (1996) The vehicle routing problem with time windows, Part I: Tabu search. INFORMS Journal on Computing 8, 158-164.
27. Rego, C. and Roucairol, C. (1995) A parallel tabu search algorithm using ejection chains for the VRP. In Proceedings of the Metaheuristics International Conference, Breckenridge, CO. July, pp. 253-259.
28. Rochat, Y. and Taillard, E. (1995) Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1, 147-167.
29. Russell, R. A. (1995) Hybrid heuristics for the vehicle routing problem with time windows. Transportation Science 29, 156-166.
30. Solomon, M. M. (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35, 254-265.
31. Solomon, M. M. and Desrosiers, J. (1988) Time window constrained routing and scheduling problems. Transportation Science 22, 1-13.
32. Solomon, M. M., Baker, E. K. and Schaffer, J. R. (1988) Vehicle routing and scheduling problems with time window constraints: Efficient implementations of solution improvement procedures. In Vehicle Routing: Methods and Studies, eds B. L. Golden and A. A. Assad, pp. 85-105. North-Holland, Amsterdam.
33. Taillard, E. (1990) Some efficient heuristic methods for the flowshop scheduling problem. European Journal of Operational Research 47, 65-79.
34. Taillard, E. (1993a) Robust tabu search for the quadratic assignment problem. Parallel Computing 17, 443-455.
35. Taillard, E. (1993b) Parallel iterative search methods for vehicle routing problems. Networks 23, 661-673.
36. Taillard, E. (1994) Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing 6, 108-117.
37. Taillard, E., Badeau, P., Gendreau, M., Guertin, F. and Potvin, J. Y. (1995) A new neighborhood structure for the vehicle routing problem with time windows. Technical report CRT-95-66. Centre de recherche sur les transports, Université de Montréal, Montréal, Canada.
38. Thangiah, S. R. (1993) Vehicle routing with time windows using genetic algorithms. Technical Report SRU-CpSc-TR-93-23, Computer Science Department, Slippery Rock University, Slippery Rock, PA.
39. Thangiah, S. R., Osman, I. H. and Sun, T. (1994) Hybrid genetic algorithms, simulated annealing and tabu search methods for vehicle routing problems with time windows. Technical Report UKC/OR94/4. Institute of Mathematics & Statistics, University of Kent, Canterbury, U.K.
40. Thompson, P. and Psaraftis, H. (1993) Cyclic transfer algorithms for multi-vehicle routing and scheduling problems. Operations Research 41, 935-946.