The double travelling salesman problem with multiple stacks - Formulation and heuristic solution approaches

European Journal of Operational Research

Volumn 198, Issue 1, 2009, Pages 139-147

  Petersen, Hanne L ^a   Madsen, Oli B G ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Metaheuristics; Packing; Routing; TSP variants

Indexed keywords

CONTROL THEORY; HEURISTIC METHODS;

COMPUTATIONAL RESULTS; HEURISTIC SOLUTIONS; LARGE NEIGHBOURHOOD; LOCAL SEARCH METAHEURISTICS; LOWER BOUNDS; META-HEURISTIC APPROACHES; METAHEURISTICS; NEIGHBOURHOOD; ROUTING; SHORTEST ROUTES; TRAVELLING SALESMAN PROBLEMS; TSP VARIANTS;

TRAVELING SALESMAN PROBLEM;

EID: 62549093551     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.08.009     Document Type: Article

References (23)

1. Applegate D., Bixby R., Chvátal V., and Cook W. Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Mathematical Programming 97 1-2 (2003) 91-153
2. F. Carrabs, R. Cerulli, J.-F. Cordeau, An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with LIFO or FIFO loading. INFOR, December 2006 (Publication CIRRELT-2007-12).
3. Carrabs F., Cordeau J.-F., and Laporte G. Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS Journal on Computing 19 (2007) 618-632
4. Clarke G., and Wright J. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12 (1964) 568-581
5. J.-F. Cordeau, M. Iori, G. Laporte, J. Salazar-González, A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks (to appear).
6. Cordeau J.-F., Laporte G., Potvin J.-Y., and Savelsbergh M.W. Transportation on demand. In: Barnhart C., and Laporte G. (Eds). Transportation. Handbooks in Operations Research and Management Science vol. 14 (2006), Elsevier, Amsterdam 429-466 (Chapter 7)
7. G. Desaulniers, J. Desrosiers, A. Erdmann, M.M. Solomon, F. Soumis, VRP with pickup and delivery, in: P. Toth, D. Vigo, The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, vol. 9, 2002, pp. 225-242 (Chapter 9).
8. Doerner K.F., Fuellerer G., Hartl R.F., Gronalt M., and Iori M. Metaheuristics for the vehicle routing problem with loading constraints. Networks 49 4 (2007) 294-307
9. A. Felipe, M. Ortuño, G. Tirado, Neighborhood structures to solve the double TSP with multiple stacks using local search, in: Proceedings of FLINS 2008.
10. Gendreau M., Iori M., Laporte G., and Martello S. A tabu search algorithm for a routing and container loading problem. Transportation Science 40 3 (2006) 342-350
11. Gendreau M., Iori M., Laporte G., and Martello S. A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51 1 (2008) 4-18
12. M. Gendreau, G. Laporte, J.-Y. Potvin, Metaheuristics for the capacitated VRP, in: P. Toth, D. Vigo, The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, vol. 9, 2002 (Chapter 6).
13. Iori M., Salazar-González J., and Vigo D. An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transportation Science 41 2 (2007) 253-264
14. Jünger M., Reinelt G., and Grinaldi G. The traveling salesman problem. Network Models. Handbooks in Operations Research and Management Science vol. 7 (1995), Elsevier Science (Chapter 4)
15. Kalantari B., Hill A., and Arora S. An algorithm for the traveling salesman problem with pickup and delivery customers. European Journal of Operational Research 22 3 (1985) 377-386
16. Lourenço H.R., Martin O.C., and Stützle T. Iterated local search. In: Glover F., and Kochenberger G. (Eds). Handbook of Metaheuristics (2003), Kluwer Acedemic Publishers 321-353 (Chapter 11)
17. Mladenović N., and Hansen P. Variable neighborhood search. Computers and Operations Research 24 11 (1997) 1097-1100
18. S. Parragh, K. Doerner, R. Hartl, A survey on pickup and delivery models, Parts I & II, Faculty of Business, Economics and Statistics, Department of Business Administration, University of Vienna, 2006.
19. H.L. Petersen, Heuristic solution approaches to the double TSP with multiple stacks. Technical Report 2006-2, Centre for Traffic and Transport, Technical University of Denmark, 2006.
20. Røpke S., and Pisinger D. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science 40 4 (2006) 455-472
21. Savelsbergh M., and Sol M. The general pickup and delivery problem. Transportation Science 29 1 (1995) 17-29
22. Shaw P. Using constraint programming and local search methods to solve vehicle routing problems. In: Maher M., and Puget J.-F. (Eds). Principle and Practice of Constraint Programming vol. CP98 (1998), Springer-Verlag
23. P. Toth, D. Vigo, VRP with backhauls, in: P. Toth, D. Vigo, The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, vol. 9, 2002, pp. 195-224 (Chapter 8).