The multiple vehicle pickup and delivery problem with LIFO constraints

European Journal of Operational Research

Volumn 243, Issue 3, 2015, Pages 752-762

  Benavent, Enrique ^a   Landete, Mercedes ^b   Mota, Enrique ^a   Tirado, Gregorio ^c  

^a UNIVERSITY OF VALENCIA   (Spain)

^b MIGUEL HERNÁNDEZ UNIVERSITY   (Spain)

^c UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

Branch and cut; LIFO constraints; Mixed integer programming; Pickup and delivery; Vehicle routing

Indexed keywords

BENCHMARKING; HEURISTIC METHODS; PICKUPS; TABU SEARCH; UNLOADING; VEHICLE ROUTING; VEHICLES;

BRANCH AND CUT; BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL STUDIES; LIFO CONSTRAINTS; LOADING AND UNLOADING OPERATIONS; MIXED INTEGER PROGRAMMING; PICKUP AND DELIVERY; PICKUP AND DELIVERY PROBLEMS;

INTEGER PROGRAMMING;

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

References (25)

1. Battarra M., Erdogan G., Laporte G., and Vigo D. The traveling salesman problem with pickups, deliveries, and handling costs Transportation Science 44 2010 383 399
2. Benavent, Mota, Landete and Tirado PDPLT benchmark. (2014). Available online at http://www.mat.ucm.es/∼gregoriotd/PDPLT.htm. Accessed 10.11.14.
3. Berbeglia G., Cordeau J.F., Gribkovskaia I., and Laporte G. Static pickup and delivery problems: A classification scheme and survey TOP 15 1 2007 1 31
4. Carrabs F., Cerulli R., and Cordeau J.F. An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with lifo or fifo loading INFOR 45 2007 223 238
5. Cheang B., Gao X., Lim A., Qin H., and Zhu W. Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints European Journal of Operational Research 223 2012 60 75
6. Cherkesly M., Desaulniers G., and Laporte G. Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and last-in-first-out loading Transportation Science 2014
7. Clark G., and Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 4 1964 568 581
8. Cordeau J.F., Iori M., Laporte G., and Salazar J.J. A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with lifo loading Networks 55 2010 46 59
9. Cordeau J.F., Laporte G., and Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows Journal of the Operational Research Society 52 2001 928 936
10. Erdogan G., Battarra M., Laporte G., and Vigo D. Metaheuristics for the traveling salesman problem with pickups deliveries and handling costs Computers and Operations Research 39 2012 1074 1086
11. Gao X., Lim A., Qin H., and Zhu W. Multiple pickup and delivery tsp with lifo and distance constraints: A vns approach Lecture Notes in Computer Science 6704 2011 193 202
12. Glover F. Tabu search - Part I INFORMS Journal on Computing 1 3 1989 190 206
13. Golden B.L., Raghavan S., and Wasil E.A. The vehicle routing problem: Latest advances and new challenges 2008 Springer New York
14. IBM-ILOG. (2011). CPLEX 12.4. User's Manual.
15. Kara, I. (2008). Two indexed polynomial size formulation for vehicle routing problems. Working Paper.
16. Kara I., Laporte G., and Bektas T. A note on the lifted miller-tucker-zemlin subtour elimination constraints for the capacitated vehicle routing problem European Journal of Operational Research 158 2004 793 795
17. Korsvik J.E., Fagerholt K., and Laporte G. A tabu search heuristic for ship routing and scheduling Journal of the Operational Research Society 61 2010 594 603
18. Li H., and Lim A. A metaheuristic for the pickup and delivery problem with time windows International Journal on Artificial Intelligence Tools 12 2 2003 173 186
19. Li & Lim benchmark. (2013). Available online at http://www.sintef.no/Projectweb/ TOP/PDPTW/Li-Lim-benchmark/. Accessed 10.04.14.
20. Miller C.E., Tucker A.W., and Zemlin R.A. Integer programming formulation of travelling salesman problems Journal of the Association for Computer Machinery 7 1960 326 329
21. Parragh S., Doerner K.F., and Hartl R.F. A survey on pickup and delivery problems, Part I: Transportation between customers and depot Journal für Betriebswirtschaft 58 2008 21 51
22. Parragh S., Doerner K.F., and Hartl R.F. A survey on pickup and delivery problems, Part II: Transportation between pickup and delivery locations Journal für Betriebswirtschaft 58 2008 81 117
23. Solomon M.M. Algorithms for the vehicle routing and scheduling problems with time window constrains Operations Research 35 1987 254 264
24. Tirado G., Hvattum L.M., Fagerholt K., and Cordeau J.F. Heuristics for dynamic and stochastic routing in industrial shipping Computers and Operations Research 40 2013 253 263
25. Toth P., and Vigo D. The vehicle routing problem SIAM 2002