Faculty of Business, Economics and Statistics

Department of Business Administration

Chair of Production and Operations Management
(Lehrstuhl für Produktion und Logistik)

Dial-a-ride problem instances and results

DARP

Variable neighborhood search for the dial-a-ride problem
Sophie N. Parragh, Karl F. Doerner, Richard F. Hartl
Computers & Operations Research (2010) Vol. 37, pages 1129-1138

Instances

http://neumann.hec.ca/chairedistributique/data/darp/tabu/

Solutions

solutions.zip
pr01 pr02 pr03 pr04 pr05 pr06 pr07 pr08 pr09 pr10
pr11 pr12 pr13 pr14 pr15 pr16 pr17 pr18 pr19 pr20

Correction

to Table 7

 
 

Hybrid large neighborhood search for the dial-a-ride problem
Sophie N. Parragh, Verena Schmid
Computers & Operations Research (2013) Vol. 40, pages 490-497

Solutions

pr01 pr02 pr03 pr04 pr05 pr06 pr07 pr08 pr09 pr10
pr11 pr12 pr13 pr14 pr15 pr16 pr17 pr18 pr19 pr20

 

MO-DARP

A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
Sophie N. Parragh, Karl F. Doerner, Richard F. Hartl, Xavier Gandibleux
Networks (2009) Vol. 54, pages 227-242

Instances http://neumann.hec.ca/chairedistributique/data/darp/branch-and-cut/

Reference Sets

refsets.zip
 

HDARP

Introducing heterogeneous users and vehicles into models and algorithms
for the dial-a-ride problem

Sophie N. Parragh
Transportation Research Part C: Emerging Technologies (2011) Vol. 19, pages 912-930

Instances
datasetU.zip (homogeneous users and vehicles)
datasetE.zip (heterogeneous users; homogeneous vehicles)
datasetI.zip (heterogeneous users and vehicles)
Solutions
Optimal/best solutions 2-index branch-and-cut algorithm
Minimize routing Penalize waiting
BCroutingSolutionsU.zip BCwaitingSolutionsU.zip
BCroutingSolutionsE.zip BCwaitingSolutionsE.zip
BCroutingSolutionsI.zip BCwaitingSolutionsI.zip
 
Best solutions VNS
Minimize routing Penalize waiting
VNSroutingSolutionsU.zip VNSwaitingSolutionsU.zip
VNSroutingSolutionsE.zip VNSwaitingSolutionsE.zip
VNSroutingSolutionsI.zip VNSwaitingSolutionsI.zip
 

DARPSRP

The dial-a-ride problem with split requests and profits
Sophie N. Parragh, Jorge Pinho de Sousa, Bernardo Almada-Lobo
Transportation Science (Online First 20 June, 2014)

Instances
1st line: nVehicles nRequests maxDuration maxLoad maxRideTime
remaining lines: nodeName xCoord yCoord serviceTime nPersons TWa TWb profit
the first corresponds to the depot
the subsequent nRequests lines to the pickup locations
the following nRequests lines to the delivery locations
line i and line nRequests+i make up a pickup and delivery pair
the last line gives again the depot
 
SC.zip (2 clusters)
SD.zip (4 clusters)
SE.zip (random)
 
  Last update: August 22, 2014