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 400-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 400-cases
Case
Vehicles
Distance
Authors
Date
lc1_4_1 40
7152,06 SAM::OPT 16-jun-03
lc1_4_2 38
8012,43 RP
25-feb-05
lc1_4_3 33
8308,94 RP
25-feb-05
lc1_4_4 30
6451,68 Li & Lim 2001
lc1_4_5 40
7150,00 SAM::OPT 19-apr-03
lc1_4_6 40
7154,02 Li & Lim 2001
lc1_4_7 40
7149,43 SAM::OPT 15-mar-03
lc1_4_8 39
7111,16 Li & Lim 2001
lc1_4_9 36
7452,21 RP
08-jul-03
lc1_410 35
7387,13 RP
08-jul-03

lc2_4_1
12
4116,33 Li & Lim 2001
lc2_4_2 12
4144,29 SAM::OPT 15-may-03
lc2_4_3 12
4431,75 RP
08-jul-03
lc2_4_4 12
3743,95 Li & Lim 2001
lc2_4_5 12
4030,63 TS

lc2_4_6 12
3900,29 SAM::OPT 20-apr-03
lc2_4_7 12
3962,51 BVH
27-jun-03
lc2_4_8 12
3844,45 Li & Lim 2001
lc2_4_9 12
4188,93 RP
08-jul-03
lc2_410 12
3828,44 BVH
27-jun-03

lr1_4_1
40
10639,75 TS

lr1_4_2 31
10015,85 RP
25-feb-05
lr1_4_3 23
8840,46 RP 08-jul-03
lr1_4_4 16
6744,33 RP 08-jul-03
lr1_4_5 29
10599,54 RP 25-feb-05
lr1_4_6 25
9456,68 BVH
27-jun-03
lr1_4_7 19
8200,37 RP 25-feb-05
lr1_4_8 14
5946,44 RP 08-jul-03
lr1_4_9 24
9886,14 RP 25-feb-05
lr1_410 21
8016,62 RP 08-jul-03

lr2_4_1
8
9726,88 BVH
27-jun-03
lr2_4_2 7
9496,64 RP 08-jul-03
lr2_4_3 6
8116,53 RP 25-feb-05
lr2_4_4 4
6649,78 RP 08-jul-03
lr2_4_5 7
8574,84 RP 08-jul-03
lr2_4_6 6
7995,06 RP 08-jul-03
lr2_4_7 5
6928,61 RP 25-feb-05
lr2_4_8 4
5447,40 RP 25-feb-05
lr2_4_9 6
8043,20 RP 08-jul-03
lr2_410 5
7904,77 RP 25-feb-05

lrc1_4_1
36
9127,15 RP
25-feb-05
lrc1_4_2 31
8346,06 RP 08-jul-03
lrc1_4_3 25
7307,09 BVH
27-jun-03
lrc1_4_4 19
5838,58 RP 08-jul-03
lrc1_4_5 33
8773,75 RP 08-jul-03
lrc1_4_6 31
8177,90 RP 08-jul-03
lrc1_4_7 29
7992,08 RP 25-feb-05
lrc1_4_8 27
7613,43 RP 25-feb-05
lrc1_4_9 26
8013,48 RP 25-feb-05
lrc1_410 24
7065,73 RP 08-jul-03

lrc2_4_1
12
7471,01 RP 25-feb-05
lrc2_4_2 11
6303,36 RP 08-jul-03
lrc2_4_3 9
5438,20 RP 08-jul-03
lrc2_4_4 5
5322,43 RP 08-jul-03
lrc2_4_5 11
6120,13 BVH
27-jun-03
lrc2_4_6 9
6479,56 RP 25-feb-05
lrc2_4_7 8
6361,26 RP 25-feb-05
lrc2_4_8 7
5928,93 RP 08-jul-03
lrc2_4_9 7
5303,53 RP 08-jul-03
lrc2_410 6
5760,78 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).

Li&Lim A Metaheuristic for the Pickup and Delivery Problem with Time Windows, Haibing Li, Andrew Lim , National University of Singapore
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.