Solving the Traveling-Salesman Problem with Time Windows Using Tabu Search

References

• Baker, E.K. (1983) An exact algorithm for the time constrained traveling salesman problem. Operations Research, 31(5), 938–945.
   Web of Science ®Google Scholar
• Barnes, J.W. and Chambers, J. (1995) Solving the job shop scheduling problem using tabu search. IIE Transactions, to appear.
   Web of Science ®Google Scholar
• Battiti, R. and G. Tecchiolli (1994) The reactive tabu search. ORSA Journal on Computing, 6(2), 126–140.
   Google Scholar
• Bodin, L., Golden, B., Assad, A. and Ball, M. (1983) Routing and scheduling of vehicles and crews; the state of the art. Computers and Operations Research, 10(2), 63–211.
   Web of Science ®Google Scholar
• Carlton, W.B. and J.W. Barnes (1995) A note on hashing functions and tabu search algorithms. European Journal of Operations Research, to appear.
   Web of Science ®Google Scholar
• Christofides, N., Mignozzi, A. and Toth, P. (1981) Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Mathematical Programming, 20, 244–282.
   Web of Science ®Google Scholar
• Desrochers, M., Desrosiers, J. and Solomon, M. (1992) A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40(2), 342–353.
   Web of Science ®Google Scholar
• Desrosiers, J., Dumas, Y. and Soumis, F. (1986) A dynamic programming solution of the large-scale single vehicle dial-a-ride problem with time windows. American Journal of Mathematical and Management Sciences, 16, 301–325.
   Google Scholar
• Desrosiers, J., Dumas, Y., Solomon, M. and Soumis, F. (1995) Time constrained routing and scheduling, handbooks on operational research and management science. Networks and Distribution, North-Holland, Amsterdam, to appear.
   Google Scholar
• Dumas, Y., Desrosiers, J. and Soumis, F. (1991) The pickup and delivery problem with time windows. European Journal of Operational Research, 54, 7–22.
   Web of Science ®Google Scholar
• Dumas, Y., Desrosiers, J., Gelinas, E. and Solomon, M. (1993) An optimal algorithm for the traveling salesman problem with time windows. Les Cahiers du GERAD, Report G-91-51, Montreal, Canada.
   Google Scholar
• Glover, F. (1977) Heuristics for integer programming using surrogate constraints. Decision Sciences, 8(1), 156–166.
   Google Scholar
• Glover, F. and Laguna, M. (1993) in Tabu Search: Modern Heuristic Techniques for Combinatorial Problems, Reeves, C. (ed.), Blackwell Scientific Publishing, pp. 70–141.
   Google Scholar
• Horowitz, E., Sahni, S. and Anderson-Freed, S. (1993) Fundamentals of Data Structures in C, W.H. Freeman and Company, New York.
   Google Scholar
• Langevin, A., Desrochers, M. and Soumis, F. (1990) A two-commodity flow formulation for the traveling salesman and makespan problems with time windows. Cahiers du GÉRAD G-90-44, École des H.E.C., Montreal Canada.
   Google Scholar
• Laporte, G. (1992) The vehicle routing problem: an overview of exact and approximate algorithms. European Journal of Operations Research, 59, 345–358.
   Web of Science ®Google Scholar
• Or, I. (1976) Travelling salesman-type combinatorial problems and their relation to the logistics of blood banking. Ph.D. Dissertation, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL.
   Google Scholar
• Malek, M., Guruswamy, M. and Pandya, M. (1989) Serial and parallel simulated annealing and tabu search for the traveling salesman problem. Annals of Operations Research, 21, 59–84.
   Google Scholar
• Savelsbergh, M.W.P. (1985) Local search in routing problems with time windows. Annals of Operations Research, 14, 285–305.
   Google Scholar
• Savelsbergh, M.W.P. (1990) An efficient implementation of local search algorithms for the constrained routing problem. European Journal of Operational Research, 47, 75–85.
   Web of Science ®Google Scholar
• Savelsbergh, M.W.P. (1992a) Computer Aided Routing, CWI Tract 75, CWI, Amsterdam.
   Google Scholar
• Savelsbergh, M.W.P. (1992b) The vehicle routing problem with time windows: minimizing route duration. ORSA Journal on Computing, 4(2), 146–154.
   Google Scholar
• Solomon, M. and Desrosiers, J. (1988) Survey paper: time window constrained routing and scheduling problems. Transportation Science, 22(1), 1–13.
   Web of Science ®Google Scholar
• Van der Bruggen, L.J.J., Lenstra, J.K. and Schuur, P.C. (1993) Variable-depth search for the single vehicle pickup and delivery problem with time windows. Transportation Science, 27(3), 298–311.
   Web of Science ®Google Scholar
• Van Laarhoven, P.J.M., Aarts, E.H. and Lenstra, J.K. (1992) Job shop scheduling by simulated annealing. Operations Research, 40(1), 113–125.
   Web of Science ®Google Scholar
• Woodruff, D. and Zemel, E. (1993) Hashing vectors for tabu search. Annals of Operations Research, 41, 123–137.
   Google Scholar