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 600-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 600-cases
Case
Vehicles
Distance
Authors
Date
lc1_6_1 60
14095,60 Li & Lim 2001
lc1_6_2 58
14379,50 BVH
27-jun-03
lc1_6_3 50
14683,43 RP 14-jul-03
lc1_6_4 47
13648,03 RP 14-jul-03
lc1_6_5 60
14086,30 Li & Lim 2001
lc1_6_6 60
14090,79 RP 14-jul-03
lc1_6_7 60
14083,76 SAM::OPT 13-jul-03
lc1_6_8 59
14554,27 SAM::OPT 13-jul-03
lc1_6_9 54
14706,12 RP 14-jul-03
lc1_610 53
14879,30 RP 14-jul-03

lc2_6_1
19
7977,98 SAM::OPT 14-jun-03
lc2_6_2 18
10277,23 RP 14-jul-03
lc2_6_3 17
8728,30 RP 14-jul-03
lc2_6_4 17
8041,97 RP 14-jul-03
lc2_6_5 19
8047,37 BVH
27-jun-03
lc2_6_6 19
8094,11 RP 14-jul-03
lc2_6_7 19
7998,18 RP 14-jul-03
lc2_6_8 18
7579,93 RP 14-jul-03
lc2_6_9 18
9501,00 RP 14-jul-03
lc2_610 17
8019,94 RP 14-jul-03

lr1_6_1
59
22838,30 BVH
27-jun-03
lr1_6_2 45
20246,18 RP 14-jul-03
lr1_6_3 37
18073,14 RP 14-jul-03
lr1_6_4 28
13269,71 RP 14-jul-03
lr1_6_5 38
22562,81 RP 25-feb-05
lr1_6_6 32
20641,02 RP 14-jul-03
lr1_6_7 25
17162,90 RP 14-jul-03
lr1_6_8 19
11957,59 RP 14-jul-03
lr1_6_9 32
21423,05 RP 14-jul-03
lr1_610 27
18723,13 RP 14-jul-03

lr2_6_1
11
21945,30 RP 14-jul-03
lr2_6_2 10
19666,59 RP 25-feb-05
lr2_6_3 8
15609,96 RP 14-jul-03
lr2_6_4 6
10819,45 RP 14-jul-03
lr2_6_5 9
19567,41 RP 14-jul-03
lr2_6_6 8
17262,96 RP 14-jul-03
lr2_6_7 6
15812,42 RP 14-jul-03
lr2_6_8 5
10950,90 RP 14-jul-03
lr2_6_9 8
18799,36 RP 14-jul-03
lr2_610 7
17034,63 RP 14-jul-03

lrc1_6_1
53
17924,88 RP 14-jul-03
lrc1_6_2 44
16302,54 RP 25-feb-05
lrc1_6_3 36
14060,31 RP 14-jul-03
lrc1_6_4 25
10950,52 RP 14-jul-03
lrc1_6_5 47
16742,55 RP 14-jul-03
lrc1_6_6 44
16894,37 RP 14-jul-03
lrc1_6_7 39
15394,87 RP 14-jul-03
lrc1_6_8 36
15154,79 RP 14-jul-03
lrc1_6_9 35
15134,24 RP 14-jul-03
lrc1_610 31
13925,51 RP 14-jul-03

lrc2_6_1
16
14817,72 RP 14-jul-03
lrc2_6_2 14
12758,77 RP 14-jul-03
lrc2_6_3 10
12812,67 RP 25-feb-05
lrc2_6_4 7
10574,87 RP 25-feb-05
lrc2_6_5 14
13009,52 RP 14-jul-03
lrc2_6_6 13
12642,70 SAM::OPT 04-jan-04
lrc2_6_7 11
12007,65 RP
14-jul-03
lrc2_6_8 10
12163,43 RP 14-jul-03
lrc2_6_9 9
13768,01 RP 14-jul-03
lrc2_610 8
12016,94 RP 14-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