Heuristics for the traveling salesman problem with pickup and delivery

Computers and Operations Research

Volumn 26, Issue 7, 1999, Pages 699-714

  Gendreau, Michel ^a   Laporte, Gilbert ^a   Vigo, Daniele ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Heuristics; Pickup and Delivery; Tabu search; Traveling Salesman Problem

Indexed keywords

GAME THEORY; HEURISTIC METHODS; PROBLEM SOLVING;

TABU SEARCH;

TRAVELING SALESMAN PROBLEM;

ALGORITHM; METHODOLOGY;

EID: 0033166618     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(98)00085-9     Document Type: Article

References (10)

1. Anily S, Mosheiov G. The traveling salesman problem with delivery and backhauls. Operations Research Letters 1994;16:11-8.
2. Balas E, Toth P. Branch and bound methods. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB, editors. The Traveling Salesman Problem. Chichester: Wiley, 1985:361-402.
3. Christofides N. Worst-case Analysis of a New Heuristic for the Traveling Salesman Problem. Report 388, GSIA, Carnegie-Mellon University, 1976.
4. Gendreau M, Hertz A, Laporte G. The travelling salesman problem with backhauls. Computers & Operations Research 1996;23:501-8.
5. Glover F. Tabu search - Part I. ORSA Journal on Computing 1989;1:190-206.
6. Glover F. Tabu search - Part II. ORSA Journal on Computing 1990;2:4-32.
7. Glover F, Laguna M. Tabu Search. Norwell, MA: Kluwer, 1997.
8. Halse K. Modeling and Solving Complex Vehicle Routing Problems. PhD Thesis, no. 60, IMSOR, The Technical University of Denmark, 1992.
9. Mosheiov G. The travelling salesman problem with pick-up and delivery. European Journal of Operational Research 1994;79:299-310.
10. Rosenkrantz DJ, Stearns RE, Lewis II PM. An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing 1997;6:563-81.