Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads

Transportation Research Part E: Logistics and Transportation Review

Volumn 69, Issue , 2014, Pages 218-235

  Chen, Qingfeng ^a   Li, Kunpeng ^a   Liu, Zhixue ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Logistics; Pickup and delivery; Transport; Variable neighborhood search; Vehicle routing

Indexed keywords

HEURISTIC METHODS; OPTIMIZATION; PICKUPS; ROUTING ALGORITHMS;

DECISION VARIABLES; DELIVERY VEHICLE; MODEL AND ALGORITHMS; PICKUP AND DELIVERY; SEARCH METHOD; SPLIT-LOAD; TRANSPORT; VARIABLE NEIGHBORHOOD SEARCH; VEHICLE ROUTING PROBLEMS;

VEHICLE ROUTING;

ALGORITHM; CAR USE; COMPUTER SIMULATION; LOGISTICS; PLANNING SYSTEM; ROAD TRANSPORT; TRANSPORTATION PLANNING; TRANSPORTATION SYSTEM;

EID: 84904369466     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2014.06.010     Document Type: Article

References (46)

1. Al-Khayyal F., Hwang S.J. Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, Part I: Applications and model. Eur. J. Oper. Res. 2007, 176:106-130.
2. Andersson H., Christiansen M., Fagerholt K. The maritime pickup and delivery problem with time windows and split loads. INFOR 2011, 49(2):79-91.
3. Archetti C., Speranza M.G. Vehicle routing problems with split deliveries. Int. Trans. Oper. Res. 2012, 19:3-22.
4. Archetti, C., Speranza, M.G., 2008. The split delivery vehicle routing problem: a survey. In: Golden, B., Raghavan, S., Wasil, E. (Eds.), The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces Series, vol. 43. Springer, New York, USA, pp. 103-122.
5. Archetti C., Savelsbergh M., Speranza M.G. To split or not to split: that is the question. Transp. Res. Part E 2008, 44(1):114-123.
6. Bektas T. The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 2006, 34:209-219.
7. Bräysy O., Gendreau M. Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transp. Sci. 2005, 39(1):104-118.
8. Cheang B., Gao X., Lim A., Qin H., Zhu W. Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints. Eur. J. Oper. Res. 2012, 223:60-75.
9. Christiansen M. Decomposition of a combined inventory and time constrained ship routing problem. Transp. Sci. 1999, 33(1):3-16.
10. Christiansen M., Fagerholt K., Flatberg T., Haugen Ø., Kloster O., Lund E.H. Maritime inventory routing with multiple products: a case study from the cement industry. Eur. J. Oper. Res. 2011, 208:86-94.
11. Cordeau J.F. A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 2006, 54(3):573-586.
12. Derigs U., Li B., Vogel U. Local search-based metaheuristics for the split delivery vehicle routing problem. J. Oper. Res. Soc. 2010, 61:1356-1364.
13. Dror M., Trudeau P. Savings by split delivery routing. Transp. Sci. 1989, 23:141-145.
14. Engineer F.G., Furman K.C., Nemhauser G.L., Savelsbergh M.W.P., Song J.H. A branch-price-and-cut algorithm for single product maritime inventory routing. Oper. Res. 2012, 60(1):106-122.
15. Fleszar K., Osman I.H., Hindi K.S. A variable neighborhood search algorithm for the open vehicle routing problem. Eur. J. Oper. Res. 2009, 195:803-809.
16. Gulczynski D., Golden B., Wasil E. The split delivery vehicle routing problem with minimum delivery amounts. Transp. Res. Part E 2010, 46:612-626.
17. Gulczynski D., Golden B., Wasil E. The multi-depot split delivery vehicle routing problem: an integer programming-based heuristic, new test problems, and computational results. Comput. Ind. Eng. 2011, 61:794-804.
18. Hansen P., Mladenović N. Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 2001, 130:449-467.
19. Healy P., Moll R. A new extension of local search applied to the dial-a-ride problem. Eur. J. Oper. Res. 1995, 83:83-104.
20. Hemmelmayr V.C., Doerner K.F., Hartl R.F. A variable neighborhood search heuristic for periodic routing problems. Eur. J. Oper. Res. 2009, 195:791-802.
21. Hennig F., Nygreen B., Christiansen M., Fagerholt K., Furman K.C., Song J., Kocis G.R., Warrick P.H. Maritime crude oil transportation - a split pickup and split delivery problem. Eur. J. Oper. Res. 2012, 218:764-774.
22. Hennig F., Nygreen B., Lübbecke M.E. Nested column generation applied to the crude oil tanker routing and scheduling problem with split pickup and split delivery. Naval Res. Logist. 2012, 59:298-310.
23. Hernández-Pérez H., Salazar-Gonzalez J.J. A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discrete Appl. Math. 2004, 145:126-139.
24. Hernández-Pérez H., Salazar-Gonzalez J.J. Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. Transp. Sci. 2004, 38(2):245-255.
25. Hernández-Pérez H., Salazar-Gonzalez J.J. The one-commodity pickup-and-delivery traveling salesman problem: inequalities and algorithms. Networks 2007, 50(4):258-272.
26. Hernández-Pérez H., Rodríguez-Martín I., Salazar-González J.J. A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery travelling salesman problem. Comput. Oper. Res. 2009, 36:1639-1645.
27. Ke, L., Feng, Z., 2012. A two-phase metaheuristic for the cumulative capacitated vehicle routing problem. Comp. Oper. Res. doi:10.1016/j.cor.2012.08.020.
28. Korsvik J.E., Fagerholt K., Laporte G. A large neighbourhood search heuristic for ship routing and scheduling with split loads. Comput. Oper. Res. 2011, 38(2):474-483.
29. Kytöjoki J., Nuortio T., Bräysy O., Gendreau M. An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Comput. Oper. Res. 2007, 34(9):2743-2757.
30. Lin C.K.Y. A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources. Comput. Oper. Res. 2011, 38(11):1596-1609.
31. Martinovic G., Aleksi I., Baumgartner A. Single-commodity vehicle routing problem with pickup and delivery service. Math. Prob. Eng. 2008, 2008:1-17.
32. Miller C.E., Tucker A.W., Zemlin R.A. Integer programming formulations and traveling salesman problems. J. ACM 1960, 7:326-329.
33. Mladenović N., Hansen P. Variable neighborhood search. Comput. Oper. Res. 1997, 24(11):1097-1100.
34. Mladenović N., Urošević D., Hanafi S., Ilić A. A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. Eur. J. Oper. Res. 2012, 220:270-285.
35. Mosheiov G. The traveling salesman problem with pickup and delivery. Eur. J. Oper. Res. 1994, 79:299-310.
36. Nowak M., Ergun O., White C.C. Pickup and delivery with split loads. Transp. Sci. 2008, 42(1):32-43.
37. Pandelis D.G., Karamatsoukis C.C., Kyriakidis E.G. Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery. Eur. J. Oper. Res. 2013, 231:577-586.
38. Parragh S.N., Doerner K.F., Hartl R.F. A survey on pickup and delivery problem. Part II: Transportation between pickup and delivery locations. Journal für Betriebswirtschaft 2008, 58:81-177.
39. Popken D.A. Controlling order circuity in pickup and delivery problems. Transp. Res. Part E 2006, 42:431-443.
40. Ropke S., Pisinger D. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 2006, 40:455-472.
41. Siswanto N., Essam D., Sarker R. Solving the ship inventory routing and scheduling problem with undedicated compartments. Comput. Ind. Eng. 2011, 61:289-299.
42. Toth P., Vigo D. The Vehicle Routing Problem 2002, Society for Industrial & Applied Mathematics, SIAM, Philadelphia.
43. Wilck J.H., Cavalier T.M. A construction heuristic for the split delivery vehicle routing problem. Am. J. Oper. Res. 2012, 2:153-162.
44. Wilck J.H., Cavalier T.M. A genetic algorithm for the split delivery vehicle routing problem. Am. J. Oper. Res. 2012, 2:207-216.
45. Yu B., Yang Z.-Z., Yao B. An improved ant colony optimization for vehicle routing problem. Eur. J. Oper. Res. 2009, 196:171-176.
46. Zhao F., Li S., Sun J., Mei D. Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem. Comput. Ind. Eng. 2009, 56:1642-1648.