New neighborhood structures for the Double Traveling Salesman Problem with Multiple Stacks

Top - Tập 17 Số 1 - Trang 190-213 - 2009
Ángel Felipe1, M. Ortuño2, Gregorio Tirado2
1Complutense University of Madrid.
2Department of Statistics and Operations Research, Complutense University of Madrid, Madrid, Spain

Tóm tắt

Từ khóa


Tài liệu tham khảo

Carrabs F, Cordeau J-F, Laporte G (2007) Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS J Comput 19:618–632

Cassani L, Righini G (2004) Heuristic algorithms for the tsp with rear-loading. In: 35th annual conference of the Italian Operational Research Society, AIRO XXXV, Lecce, Italy

Clarke G, Wright J (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581

Cordeau J-F, Laporte G, Potvin J-Y, Savelsvergh MW (2006) Transportation on demand. In: Barnhart C, Laporte G (eds) Transportation. Handbooks in operations research and management science, vol 14. Elsevier, Amsterdam

Cordeau J-F, Iori M, Laporte G, Salazar-González J (2009) A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks (to appear)

Desaulniers G, Desrosiers J, Erdmann A, Solomon MM, Soumis F (2002) VRP with pickup and delivery. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM, Philadelphia, pp 225–242. Chap 9

Doerner DF, Fuellerer G, Hartl RF, Gronalt M, Iori M (2007) Metaheuristics for the vehicle routing problem with loading constraints. Networks 49(4):294–307

Glover F, Laguna M (1997) Tabu search. Kluwer, Norwell

Gendreau M, Iori M, Laporte G, Martello S (2006) A heuristic algorithm for a routing and container loading problem. Transp Sci 40:342–350

Gendreau M, Iori M, Laporte G, Martello S (2008) A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51(1):4–18

Hansen P, Mladenović N (2001) Variable neighbourhood search: principles and applications. Eur J Oper Res 130:449–467

Kirkpatrick S, Gelatt C, Vecchi M (1983) Optimization by simulated annealing. Science 220:671–680

Iori M, Salazar-González J, Vigo D (2007) An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transp Sci 41(2):253–264

Lourenço HR, Martin OC, Stützle T (2003) Iterated local search. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer Academic, Norwell, pp 321–353. Chap 11

Mladenović N (1995) A variable neighbourhood algorithm, a new metaheuristic for combinatorial optimization. Abstracts of papers presented at optimization days 112, Montréal

Mladenović N, Hansen P (1997) Variable neighbourhood search. Comput Oper Res 24:1097–1100

Petersen HL, Madsen OBG (2009) The double travelling salesman problem with multiple stacks—formulation and heuristic solution approaches. Eur J Oper Res (in press). doi: 10.1016/j.ejor.2008.08.009 . ISSN 0377-2217

Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: Maher M, Puget J-F (eds) Principle and practice of constraint programming—CP9 8. Springer, Berlin