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 800-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 800-cases
Case
Vehicles
Distance
Authors
Date
lc1_8_1 80
25184,38 SAM::OPT 16-jun-03
lc1_8_2 78
26056,20 BVH
27-jun-03
lc1_8_3 65
25918,45 RP 22-aug-03
lc1_8_4 60
22970,88 RP 22-aug-03
lc1_8_5 80
25211,22 SAM::OPT 12-jul-03
lc1_8_6 80
25164,25 SAM::OPT 12-jul-03
lc1_8_7 80
25158,38 SAM::OPT 13-jul-03
lc1_8_8 78
25348,45 RP 22-aug-03
lc1_8_9 73
25541,94 RP 22-aug-03
lc1_810 71
25712,12 RP 22-aug-03

lc2_8_1
24
11687,06 SAM::OPT 19-may-03
lc2_8_2 24
14358,92 RP 22-aug-03
lc2_8_3 24
13198,29 RP 22-aug-03
lc2_8_4 23
13376,82 RP 22-aug-03
lc2_8_5 25
12298,90 BVH
27-jun-03
lc2_8_6 24
12702,87 RP 22-aug-03
lc2_8_7 25
11855,86 RP 22-aug-03
lc2_8_8 24
11482,88 RP 22-aug-03
lc2_8_9 24
11629,61 RP 22-aug-03
lc2_810 24
11578,58 RP 22-aug-03

lr1_8_1
80
39315,92 RP 22-aug-03
lr1_8_2 59
34370,37 RP 22-aug-03
lr1_8_3 44
29718,09 RP 22-aug-03
lr1_8_4 25
21197,65 RP 22-aug-03
lr1_8_5 50
39046,06 RP 22-aug-03
lr1_8_6 42
33659,50 RP 22-aug-03
lr1_8_7 32
27294,19 RP 22-aug-03
lr1_8_8 21
19570,21 RP 22-aug-03
lr1_8_9 42
36126,69 RP 22-aug-03
lr1_810 32
30200,86 RP 22-aug-03

lr2_8_1
15
33816,90 RP 22-aug-03
lr2_8_2 12
32575,97 RP 22-aug-03
lr2_8_3 10
25310,53 RP 22-aug-03
lr2_8_4 7
19506,42 RP 25-feb-05
lr2_8_5 12
32634,29 RP 22-aug-03
lr2_8_6 10
27870,80 RP 22-aug-03
lr2_8_7 8
25077,85 RP 25-feb-05
lr2_8_8 5
19256,79 RP 22-aug-03
lr2_8_9 10
30791,77 RP 22-aug-03
lr2_810 9
28265,24 RP 22-aug-03

lrc1_8_1
67
32268,95 RP 25-feb-05
lrc1_8_2 56
28843,10 BVH
27-jun-03
lrc1_8_3 49
24933,90 BVH
27-jun-03
lrc1_8_4 35
18241,91 RP 22-aug-03
lrc1_8_5 60
32578,04 SAM::OPT 01-jun-03
lrc1_8_6 56
29971,97 SAM::OPT 01-jun-03
lrc1_8_7 53
29948,45 SAM::OPT 13-mai-03
lrc1_8_8 48
27433,79 SAM::OPT 06-aug-03
lrc1_8_9 47
24930,70 RP 22-aug-03
lrc1_810 42
24271,52 RP 22-aug-03

lrc2_8_1
20
23289,40 RP
22-aug-03
lrc2_8_2 18
21786,62 RP 22-aug-03
lrc2_8_3 16
16586,31 RP 22-aug-03
lrc2_8_4 12
14122,05 RP 25-feb-05
lrc2_8_5 18
20292,92 RP 22-aug-03
lrc2_8_6 16
21088,57 RP 22-aug-03
lrc2_8_7 15
19695,96 RP 22-aug-03
lrc2_8_8 13
19009,33 RP 22-aug-03
lrc2_8_9 12
19003,68 RP 22-aug-03
lrc2_810 10
19766,78 RP 22-aug-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).
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