A survey on pickup and delivery problems: Part II: Transportation between pickup and delivery locations

被引：93
作者：
Parragh S.N. [1 ]
Doerner K.F. [1 ]
Hartl R.F. [1 ]
机构：
[1] Institut für Betriebswirtschaftslehre, Universität Wien, 1210 Wien
来源：
Journal für Betriebswirtschaft | 2008年 / 58卷 / 2期
基金：
奥地利科学基金会;
关键词：
Dial-a-ride problem; Pick up and delivery problem; Pickup and delivery vehicle routing; Survey; Transportation;
D O I：
10.1007/s11301-008-0036-4
中图分类号：
学科分类号：
摘要：
This paper is the second part of a comprehensive survey on routing problems involving pickups and deliveries. Basically, two problem classes can be distinguished. The first part dealt with the transportation of goods from the depot to linehaul customers and from backhaul customers to the depot. The second part now considers all those problems where goods are transported between pickup and delivery locations, denoted as Vehicle Routing Problems with Pickups and Deliveries (VRPPD). These are the Pickup and Delivery Vehicle Routing Problem (PDVRP - unpaired pickup and delivery points), the classical Pickup and Delivery Problem (PDP - paired pickup and delivery points), and the Dial-A-Ride Problem (DARP - passenger transportation between paired pickup and delivery points and user inconvenience taken into consideration). Single as well as multi vehicle mathematical problem formulations for all three VRPPD types are given, and the respective exact, heuristic, and metaheuristic solution methods are discussed. © Wirtschaftsuniversität Wien, Austria 2008.
引用
收藏
页码：81 / 117
页数：36
相关论文
共 217 条
[31]  
Christiansen M., Nygreen B., A method for solving ship routing problems with inventory constraints, Ann Oper Res, 81, pp. 357-387, (1998)
[32]  
Christiansen M., Nygreen B., Modeling path flows for a combined ship routing and inventory management problem, Ann Oper Res, 82, pp. 391-412, (1998)
[33]  
Christiansen M., Nygreen B., Robust inventory ship routing by column generation, Column Generation, pp. 197-224, (2005)
[34]  
Christofides N., Worst-case Analysis of a New Heuristic for the Travelling Salesman Problem, (1975)
[35]  
Coja-Oghlan A., Krumke S.O., Nierhoff T., A hard dial-a-ride problem that is easy on average, J Sched, 8, pp. 197-210, (2005)
[36]  
Colorni A., Dorigo M., Maffioli F., Maniezzo V., Righini G., Trubian M., Heuristics from nature for hard combinatorial optimization problems, Int Trans Oper Res, 3, pp. 1-21, (1996)
[37]  
Colorni A., Righini G., Modeling and optimizing dynamic dial-a-ride problems, Int Trans Oper Res, 8, pp. 155-166, (2001)
[38]  
Cordeau J.F., A branch-and-cut algorithm for the dial-a-ride problem, Oper Res, 54, pp. 573-586, (2006)
[39]  
Cordeau J.F., Desaulniers G., Desrosiers J., Solomon M.M., Soumis F., VRP with time windows, The Vehicle Routing Problem, 9, pp. 175-193, (2002)
[40]  
Cordeau J.F., Iori M., Laporte G., Salazar-Gonzalez J.J., A Branch-and-cut Algorithm for the Pickup and Delivery Traveling Salesman Problem With LIFO Loading, (2006)
12345678910