The double traveling salesman problem with multiple stacks: A variable neighborhood search approach

Computers and Operations Research

Volumn 36, Issue 11, 2009, Pages 2983-2993

  Felipe, Ángel ^a   Ortuño, M Teresa ^a   Tirado, Gregorio ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

LIFO loading; Traveling salesman problem; Variable neighborhood search

Indexed keywords

LOCATION; OPTIMIZATION; PICKUPS; PROBLEM SOLVING; VEHICLE ROUTING;

MULTIPLE STACKS; NEIGHBORHOOD STRUCTURE; TOTAL LENGTH; VARIABLE NEIGHBORHOOD SEARCH; VEHICLE ROUTING PROBLEMS;

TRAVELING SALESMAN PROBLEM;

EID: 64549097583     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.01.015     Document Type: Article

References (24)

1. Bianchessi N., and Righini G. Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Computers & Operations Research 34 2 (2007) 578-594
2. Carrabs F, Cerulli R, Cordeau J-F. An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with lifo loading. INFORMS Journal on Computing 2007;19:618-32.
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. Cassani L. Righini G. Heuristic algorithms for the TSP with rear-loading. In: 35th Annual Conference of the Italian Operational Research Society, AIRO XXXV, Lecce, Italy; 2004.
5. Clarke G., and Wright J. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12 (1964) 568-581
6. Cordeau J-F, Iori M, Laporte G, Salazar-González J. A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks, to appear.
7. Cordeau J-F, Laporte G, Potvin J-Y, Savelsvergh MW. Transportation on demand. In: Barnhart C, Laporte G, editors. Handbooks in operations research and management science, vol. 14. Amsterdam: Elsevier; 2006. [Transportation].
8. Desaulniers G., Desrosiers J., Erdmann A., Solomon M.M., and Soumis F. VRP with pickup and delivery. In: Toth P., and Vigo D. (Eds). The vehicle routing problem (2002), SIAM, Philadelphia, PA 225-242 [chapter 9]
9. Doerner D.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
10. Dumitrescu I, Ropke S, Cordeau J-F, Laporte G. The traveling salesman problem with pickups and deliveries: polyhedral results and branch-and-cut algorithm. Mathematical Programming, Series A, 2008, Forthcoming. ISSN 1436-4646, doi:10.1007/s10107-008-0234-9.
11. Gendreau M., Iori M., Laporte G., and Martello S. A heuristic algorithm for a routing and container loading problem. Transportation Science 40 (2006) 342-350
12. 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
13. Hansen P., and Mladenović N. Variable neighbourhood search: principles and applications. European Journal of Operational Research 130 (2001) 449-467
14. Hansen P., and Mladenović N. Developments of variable neighbourhood search. In: Ribero C., and Hansen P. (Eds). Essays and surveys in metaheuristics (2001), Kluwer Academic Publishers, Dordrecht 415-440
15. Hansen P., and Mladenović N. Variable neighbourhood search. In: Pardalos P., and Resende M. (Eds). Handbook of applied optimization (2002), Oxford University Press, New York 221-234
16. Hansen P., and Mladenović N. Variable neighbourhood search. In: Glover F., and Kochenberger G.A. (Eds). Handbook of metaheuristics (2003), Kluwer Academic Publishers, Dordrecht [chapter 6]
17. Hernández-Pérez H., and Salazar-González J.J. Heuristics for the one-commodity pick-up and delivery traveling salesman problem. Transportation Science 38 (2004) 245-255
18. Hernández-Pérez H., and Salazar-González J.J. The one-commodity pickup-and-delivery traveling salesman problem: inequalities and algorithms. Networks 50 4 (2007) 258-272
19. 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
20. Mladenović, N. A variable neighbourhood algorithm, a new metaheuristic for combinatorial optimization. Abstracts of papers presented at Optimization Days. Montréal; 1995. p. 112.
21. Mladenović N., and Hansen P. Variable neighbourhood search. Computers & Operations Research 24 (1997) 1097-1100
22. Petersen HL, Madsen OBG. The double travelling salesman problem with multiple stacks-formulation and heuristic solution approaches. European Journal of Operational Research, in press, doi:10.1016/j.ejor.2008.08.009 (ISSN 0377-2217).
23. 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-CP9 8 (1998), Springer, Berlin
24. Xu H., Chen Z., Rajagopal S., and Arunapuram S. Solving a practical pickup and delivery problem. Transportation Science 37 (2003) 347-364