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 200-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 200-cases
Case
Vehicles
Distance
Authors
Date
lc1_2_1 20
2704,57
Li & Lim
2001
lc1_2_2 19
2764,56 Li & Lim 2001
lc1_2_3 17
3128,61 RP
08-jul-03
lc1_2_4 17
2693,41 BVH
27-jun-03
lc1_2_5 20
2702,05 Li & Lim 2001
lc1_2_6 20
2701,04 Li & Lim 2001
lc1_2_7 20
2701,04 Li & Lim 2001
lc1_2_8 20
2689,83 Li & Lim 2001
lc1_2_9 18
2724,24 Li & Lim 2001
lc1_210 17
2943,49 RP
25-feb-05

lc2_2_1
6
1931,44 Li & Lim 2001
lc2_2_2 6
1881,40 Li & Lim 2001
lc2_2_3 6
1844,33 SAM::OPT
15-may-03
lc2_2_4 6
1767,12 Li & Lim 2001
lc2_2_5 6
1891,21 Li & Lim 2001
lc2_2_6 6
1857,78 SAM::OPT 14-jun-03
lc2_2_7 6
1850,13 SAM::OPT 11-may-03
lc2_2_8 6
1824,34 Li & Lim 2001
lc2_2_9 6
1854,21 SAM::OPT 19-feb-03
lc2_210 6
1817,45 Li & Lim 2001

lr1_2_1
20
4819,12 Li & Lim 2001
lr1_2_2 17
4621,21 RP 08-jul-03
lr1_2_3 15
3612,64 TS

lr1_2_4 10
3037,38 RP 08-jul-03
lr1_2_5 16
4760,18 BVH 27-jun-03
lr1_2_6 14
4175,16 BVH 27-jun-03
lr1_2_7 12
3550,61 RP 08-jul-03
lr1_2_8 9
2784,53 RP 25-feb-05
lr1_2_9 14
4354,66 RP 25-feb-05
lr1_210 11
3714,16 RP 08-jul-03

lr2_2_1
5
4073,10 SAM::OPT 14-mar-03
lr2_2_2 4
3796,00 SAM::OPT 14-feb-03
lr2_2_3 4
3098,36 RP 08-jul-03
lr2_2_4 3
2486,14 RP 08-jul-03
lr2_2_5 4
3438,39 SAM::OPT 19-feb-03
lr2_2_6 4
3201,54 Li & Lim 2001
lr2_2_7 3
3135,05 RP 25-feb-05
lr2_2_8 2
2555,40 RP 08-jul-03
lr2_2_9 3
3930,49 RP 25-feb-05
lr2_210 3
3323,37 SAM::OPT 24-aug-03

lrc1_2_1
19
3606,06 SAM::OPT 17-jun-03
lrc1_2_2 15
3673,19 BVH 27-jun-03
lrc1_2_3 13
3161,75 BVH 27-jun-03
lrc1_2_4 10
2631,82 RP 08-jul-03
lrc1_2_5 16
3715,81 BVH 27-jun-03
lrc1_2_6 17
3368,66 SAM::OPT 13-mar-03
lrc1_2_7 14
3668,39 RP 25-feb-05
lrc1_2_8 13
3174,55 RP 25-feb-05
lrc1_2_9 13
3226,72 RP 25-feb-05
lrc1_210 12
2951,29 RP 08-jul-03

lrc2_2_1
6
3605,40 RP
08-jul-03
lrc2_2_2 5
3327,18 RP 25-feb-05
lrc2_2_3 4
2938,28 RP 08-jul-03
lrc2_2_4 3
2887,97 RP 08-jul-03
lrc2_2_5 5
2776,93 BVH 27-jun-03
lrc2_2_6 5
2707,96 SAM::OPT 14-feb-03
lrc2_2_7 4
3050,03 BVH
27-jun-03
lrc2_2_8 4
2399,95 RP 08-jul-03
lrc2_2_9 4
2208,49 RP 08-jul-03
lrc2_210 3
2550,56 RP 08-jul-03








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.