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 条
[1]  
Aldaihani M., Dessouky M.M., Hybrid scheduling methods for paratransit operations, Comput Ind Eng, 45, pp. 75-96, (2003)
[2]  
Alfa A.S., Scheduling of vehicles for transportation of elderly, Transport Plan Tech, 11, pp. 203-212, (1986)
[3]  
Ambrosini M., Caruso T., Foresti S., Righini G., A GRASP for the Pickup and Delivery Problem With Rear Loading, (2004)
[4]  
Anily S., Bramel J., Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries, Naval Res Logist, 46, pp. 654-670, (1999)
[5]  
Archetti C., Mansini R., Speranza M.G., Complexity and reducibility of the skip delivery problem, Transport Sci, 39, pp. 182-187, (2005)
[6]  
Archetti C., Speranza M.G., Vehicle routing in the 1-skip collection problem, J Oper Res Soc, 55, pp. 717-727, (2004)
[7]  
Ascheuer N., Escudero L.F., Grotschel M., Stoer M., A cutting plane approach to the sequential ordering problem (with applications to job scheduling in manufacturing), SIAM J Optim, 3, pp. 25-42, (1993)
[8]  
Ascheuer N., Krumke S.O., Rambau J., Online dial-a-ride problems: Minimizing the completion time, STACS 2000: 17th Annual Symposium on Theoretical Aspects of Computer Science, pp. 639-650, (2000)
[9]  
Assad A.A., Modeling and implementation issues in vehicle routing, Vehicle Routing: Methods and Studies, 16, pp. 7-45, (1988)
[10]  
Attanasio A., Cordeau J.F., Ghiani G., Laporte G., Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem, Parallel Comput, 30, pp. 377-387, (2004)
12345678910