NB! The benchmark and results part of these pages have been moved to

http://www.sintef.no/projectweb/top

The old pages will soon be unavailable.

Best Known Solutions for Li & Lim's Pickup and Delivery Benchmark 1000-Customer Problems (2001)



Solutions are compared primarily on the criterion lowest number of vehicles utilised, and secondarily on shortest distance. A third criterion, waiting-time, may be considered as a further option for comparison.

Best Known Results for PDP 1000-cases
Case
Vehicles
Distance
Authors
Date
lc1_10_1 100
42488,66 SAM::OPT 23-apr-03
lc1_10_2 95
43870,19 RP
25-feb-05
lc1_10_3 82
42631,11 RP
25-feb-05
lc1_10_4 74
39443 RP 25-feb-05
lc1_10_5 100
42477,40 SAM::OPT 07-jun-03
lc1_10_6 101
42838,39 SAM::OPT 24-apr-03
lc1_10_7 100
42854,99 TS

lc1_10_8 98
42951,56 RP 25-feb-05
lc1_10_9 92
42391,98 RP 25-feb-05
lc1_1010 90
42435,16 RP
25-feb-05

lc2_10_1
30
16879,24 TS

lc2_10_2 31
18980,98 RP 25-feb-05
lc2_10_3 30
17772,49 RP 25-feb-05
lc2_10_4 29
18089,98 RP 25-feb-05
lc2_10_5 31
17137,53 RP 25-feb-05
lc2_10_6 31
17198,01 RP
25-feb-05
lc2_10_7 31
19117,67 RP
25-feb-05
lc2_10_8 30
17018,63 RP 25-feb-05
lc2_10_9 31
17565,95 RP
25-feb-05
lc2_1010 29
17425,55 RP 25-feb-05

lr1_10_1
100
56903,88 RP 25-feb-05
lr1_10_2 80
49652,10 RP 25-feb-05
lr1_10_3 54
42124,44 RP 25-feb-05
lr1_10_4 28
32133,36 RP 25-feb-05
lr1_10_5 61
59135,86 RP 25-feb-05
lr1_10_6 50
48637,63 RP 25-feb-05
lr1_10_7 37
38936,54 RP 25-feb-05
lr1_10_8 26
29452,32 RP 25-feb-05
lr1_10_9 50
52223,15 RP 25-feb-05
lr1_1010 40
46218,35
RP 25-feb-05

lr2_10_1
19
45422,58 RP 25-feb-05
lr2_10_2 15
47824,44 RP 25-feb-05
lr2_10_3 11
39894,32 RP
25-feb-05
lr2_10_4 8
28314,95 RP 25-feb-05
lr2_10_5 14
53209,98 RP 25-feb-05
lr2_10_6 12
43792,11 RP 25-feb-05
lr2_10_7 9
36728,2 RP 25-feb-05
lr2_10_8 7
26278,09 RP 25-feb-05
lr2_10_9 13
48447,49 RP 25-feb-05
lr2_1010 11
44155,66 RP 25-feb-05

lrc1_10_1
84
49315,30 BVH
27-jun-03
lrc1_10_2 73
45135,7 RP 25-feb-05
lrc1_10_3 55
35475,72 RP 25-feb-05
lrc1_10_4 40
27747,04 RP 25-feb-05
lrc1_10_5 76
49816,18 RP 25-feb-05
lrc1_10_6 69
44469,08 RP 25-feb-05
lrc1_10_7 64
41413,16 RP 25-feb-05
lrc1_10_8 60
40590,17 RP 25-feb-05
lrc1_10_9 57
39587,85 RP 25-feb-05
lrc1_1010 51
38274,02 SAM::OPT 11-may-03

lrc2_10_1
22
35073,7 RP 25-feb-05
lrc2_10_2 21
30932,74 RP 25-feb-05
lrc2_10_3 16
28403,51 RP 25-feb-05
lrc2_10_4 12
23083,2 RP 25-feb-05
lrc2_10_5 18
34713,96 RP 25-feb-05
lrc2_10_6 17
31485,26 RP 25-feb-05
lrc2_10_7 17
29639,63 RP 25-feb-05
lrc2_10_8 -
-
-
-
lrc2_10_9 -
-
-
-
lrc2_1010 12
29402,9 RP 25-feb-05








Legend:

BVH Bent, R. and Van Hentenryck. P. A Two-Stage Hybrid Algorithm for Pickup and Delivery Vehicle Routing Problems with Time Windows. In Principles and Practice of Constraint Programming (2003).
RP S. Ropke & D. Pisinger, An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows, Technical Report, Department of Computer  Science, University of Copenhagen, 2004.

SAM::OPT SINTEF Applied Mathematics - Department of Optimisation, Technical Report in progress - not yet published

TS
TetraSoft A/S: MapBooking Algoritm for Pickup and Delivery Solutions with Time Windows and Capacity restraints.