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 条
[41]  
Cordeau J.F., Laporte G., The dial-a-ride problem (DARP): Variants modeling issues and algorithms, 4OR, 1, pp. 89-101, (2003)
[42]  
Cordeau J.F., Laporte G., A tabu search heuristic for the static multi-vehicle dial-a-ride problem, Transport Res B-Meth, 37, pp. 579-594, (2003)
[43]  
Cordeau J.F., Laporte G., The dial-a-ride problem: Models and algorithms, Ann Oper Res, 152, pp. 29-46, (2007)
[44]  
Cordeau J.F., Laporte G., Potvin J.Y., Savelsbergh M.W.P., Transportation on demand, Handbooks in Operations Research and Management Science, (2004)
[45]  
Cordeau J.F., Laporte G., Ropke S., Recent models and algorithms for one-to-one pickup and delivery problems, The Vehicle Routing Problem: Latest Advances and New Challenges, (2007)
[46]  
Coslovich L., Pesenti R., Ukovich W., Minimizing fleet operating costs for a container transportation company, Eur J Oper Res, 171, pp. 776-786, (2006)
[47]  
Coslovich L., Pesenti R., Ukovich W., A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem, Eur J Oper Res, 175, pp. 1605-1615, (2006)
[48]  
Creput J.C., Koukam A., Kozlak J., Lukasik J., An evolutionary approach to pickup and delivery problem with time windows, Computational Science - ICCS 2004: 4th International Conference, pp. 1102-1108, (2004)
[49]  
Cullen F., Jarvis J., Ratliff D., Set partitioning based heuristics for interactive routing, Networks, 11, pp. 125-143, (1981)
[50]  
Currie R.H., Salhi S., Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows, J Oper Res Soc, 54, pp. 390-400, (2003)
12345678910