Skip to content
Draft
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
The table of contents is too big for display.
Diff view
Diff view
  •  
  •  
  •  
29 changes: 29 additions & 0 deletions PDPTW/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,29 @@
# PDPTW

This folder contains pickup and delivery problem with time windows (PDPTW) instances from two benchmark sets: Li & Lim (2003) and Sartori & Buriol (2020).
The original instances are modified to fit PyVRP's VRPLIB format.
The solution cost represents the total distance traveled.
All files were retrieved on 8 July 2026.

The instances are organised into two top-level folders, `li/` and `sartori/`, each with a subfolder per instance size.

## Li & Lim

The `li/` folder contains the Li & Lim (2003) instances with 100, 200, 400, 600, 800 and 1000 customers.
Downloaded from [SINTEF](https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/) and converted from the Solomon-style format.
Distances are Euclidean and follow PyVRP's `exact` convention: each edge distance is scaled by 1000 and rounded to the nearest integer.
The best-known solutions (BKS) are taken from the [SINTEF](https://www.sintef.no/projectweb/top/pdptw/) solution pages.
Two solutions did not have an explicit solution file: `lc1_4_4` and `lc2_4_4`.
We used multiple solvers to find the best-known solution for these two instances.

## Sartori & Buriol

The `sartori/` folder contains the Sartori & Buriol (2020) instances with 100 up to 5000 customers.
The instances are downloaded from the [Mendeley dataset](https://data.mendeley.com/datasets/wr2ct4r22f/2) and the solutions from the [companion GitHub repository](https://github.com/cssartori/pdptw-instances).
These instances provide an explicit integer distance matrix, so PyVRP's `none` rounding convention is used and distances are taken directly from the instance data.

### References

Li, H., & Lim, A. (2003). A metaheuristic for the pickup and delivery problem with time windows. International Journal on Artificial Intelligence Tools, 12(2), 173–186. https://doi.org/10.1142/S0218213003001186

Sartori, C. S., & Buriol, L. S. (2020). A study on the pickup and delivery problem with time windows: matheuristics and new instances. Computers & Operations Research, 124, 105065. https://doi.org/10.1016/j.cor.2020.105065
11 changes: 11 additions & 0 deletions PDPTW/li/100/lc101.sol
Original file line number Diff line number Diff line change
@@ -0,0 +1,11 @@
Route #1: 81 78 104 76 71 70 73 77 79 80
Route #2: 57 55 54 53 56 58 60 59
Route #3: 98 96 95 94 92 93 97 106 100 99
Route #4: 13 17 18 19 15 16 14 12
Route #5: 32 33 31 35 37 38 39 36 105 34
Route #6: 90 87 86 83 82 84 85 88 89 91
Route #7: 43 42 41 40 44 46 45 48 51 101 50 52 49 47
Route #8: 67 65 63 62 74 72 61 64 102 68 66 69
Route #9: 5 3 7 8 10 11 9 6 4 2 1 75
Route #10: 20 24 25 27 29 30 28 26 23 103 22 21
Cost 828937
335 changes: 335 additions & 0 deletions PDPTW/li/100/lc101.vrp
Original file line number Diff line number Diff line change
@@ -0,0 +1,335 @@
NAME: lc101
TYPE: PDPTW
COMMENT: Li & Lim PDPTW benchmark converted from SINTEF format
DIMENSION: 107
VEHICLES: 25
CAPACITY: 200
EDGE_WEIGHT_TYPE: EUC_2D
NODE_COORD_SECTION
0 40 50
2 45 68
3 45 70
4 42 66
5 42 68
6 42 65
7 40 69
8 40 66
9 38 68
10 38 70
11 35 66
12 35 69
13 25 85
14 22 75
15 22 85
16 20 80
17 20 85
18 18 75
19 15 75
20 15 80
21 30 50
22 30 52
23 28 52
24 28 55
25 25 50
26 25 52
27 25 55
28 23 52
29 23 55
30 20 50
31 20 55
32 10 35
33 10 40
34 8 40
35 8 45
36 5 35
37 5 45
38 2 40
39 0 40
40 0 45
41 35 30
42 35 32
43 33 32
44 33 35
45 32 30
46 30 30
47 30 32
48 30 35
49 28 30
50 28 35
51 26 32
52 25 30
53 25 35
54 44 5
55 42 10
56 42 15
57 40 5
58 40 15
59 38 5
60 38 15
61 35 5
62 50 30
63 50 35
64 50 40
65 48 30
66 48 40
67 47 35
68 47 40
69 45 30
70 45 35
71 95 30
72 95 35
73 53 30
74 92 30
75 53 35
76 45 65
77 90 35
78 88 30
79 88 35
80 87 30
81 85 25
82 85 35
83 75 55
84 72 55
85 70 58
86 68 60
87 66 55
88 65 55
89 65 60
90 63 58
91 60 55
92 60 60
93 67 85
94 65 85
95 65 82
96 62 80
97 60 80
98 60 85
99 58 75
100 55 80
101 55 85
102 25 30
103 48 30
104 28 55
105 88 35
106 5 45
107 60 85
TIME_WINDOW_SECTION
0 0 1236
2 912 967
3 825 870
4 65 146
5 727 782
6 15 67
7 621 702
8 170 225
9 255 324
10 534 605
11 357 410
12 448 505
13 652 721
14 30 92
15 567 620
16 384 429
17 475 528
18 99 148
19 179 254
20 278 345
21 10 73
22 914 965
23 812 883
24 732 777
25 65 144
26 169 224
27 622 701
28 261 316
29 546 593
30 358 405
31 449 504
32 200 237
33 31 100
34 87 158
35 751 816
36 283 344
37 665 716
38 383 434
39 479 522
40 567 624
41 264 321
42 166 235
43 68 149
44 16 80
45 359 412
46 541 600
47 448 509
48 1054 1127
49 632 693
50 1001 1066
51 815 880
52 725 786
53 912 969
54 286 347
55 186 257
56 95 158
57 385 436
58 35 87
59 471 534
60 651 740
61 562 629
62 531 610
63 262 317
64 171 218
65 632 693
66 76 129
67 826 875
68 12 77
69 734 777
70 916 969
71 387 456
72 293 360
73 450 505
74 478 551
75 353 412
76 997 1068
77 203 260
78 574 643
79 109 170
80 668 731
81 769 820
82 47 124
83 369 420
84 265 338
85 458 523
86 555 612
87 173 238
88 85 144
89 645 708
90 737 802
91 20 84
92 836 889
93 368 441
94 475 518
95 285 336
96 196 239
97 95 156
98 561 622
99 30 84
100 743 820
101 647 726
102 725 786
103 632 693
104 732 777
105 109 170
106 665 716
107 561 622
PICKUP_AND_DELIVERY_SECTION
0 0 0 1236 0 0 0
2 -10 912 967 90 12 0
3 -20 825 870 90 7 0
4 10 65 146 90 0 76
5 -10 727 782 90 10 0
6 10 15 67 90 0 8
7 20 621 702 90 0 3
8 -10 170 225 90 6 0
9 20 255 324 90 0 11
10 10 534 605 90 0 5
11 -20 357 410 90 9 0
12 10 448 505 90 0 2
13 -20 652 721 90 19 0
14 30 30 92 90 0 18
15 -40 567 620 90 17 0
16 -10 384 429 90 20 0
17 40 475 528 90 0 15
18 -30 99 148 90 14 0
19 20 179 254 90 0 13
20 10 278 345 90 0 16
21 10 10 73 90 0 25
22 -10 914 965 90 31 0
23 -20 812 883 90 29 0
24 10 732 777 0 0 104
25 -10 65 144 90 21 0
26 40 169 224 90 0 28
27 -10 622 701 90 30 0
28 -40 261 316 90 26 0
29 20 546 593 90 0 23
30 10 358 405 90 0 27
31 10 449 504 90 0 22
32 -30 200 237 90 33 0
33 30 31 100 90 0 32
34 40 87 158 90 0 38
35 -30 751 816 90 39 0
36 10 283 344 90 0 40
37 10 665 716 0 0 106
38 -40 383 434 90 34 0
39 30 479 522 90 0 35
40 -10 567 624 90 36 0
41 -20 264 321 90 43 0
42 -10 166 235 90 44 0
43 20 68 149 90 0 41
44 10 16 80 90 0 42
45 10 359 412 90 0 47
46 10 541 600 90 0 49
47 -10 448 509 90 45 0
48 -10 1054 1127 90 50 0
49 -10 632 693 90 46 0
50 10 1001 1066 90 0 48
51 10 815 880 90 0 53
52 10 725 786 0 0 102
53 -10 912 969 90 51 0
54 20 286 347 90 0 59
55 40 186 257 90 0 61
56 -40 95 158 90 58 0
57 30 385 436 90 0 60
58 40 35 87 90 0 56
59 -20 471 534 90 54 0
60 -30 651 740 90 57 0
61 -40 562 629 90 55 0
62 -10 531 610 90 68 0
63 20 262 317 90 0 69
64 50 171 218 90 0 75
65 10 632 693 0 0 103
66 10 76 129 90 0 73
67 10 826 875 90 0 70
68 10 12 77 90 0 62
69 -20 734 777 90 63 0
70 -10 916 969 90 67 0
71 -30 387 456 90 82 0
72 20 293 360 90 0 78
73 -10 450 505 90 66 0
74 -10 478 551 90 77 0
75 -50 353 412 90 64 0
76 -10 997 1068 90 4 0
77 10 203 260 90 0 74
78 -20 574 643 90 72 0
79 20 109 170 0 0 105
80 10 668 731 90 0 81
81 -10 769 820 90 80 0
82 30 47 124 90 0 71
83 20 369 420 90 0 86
84 -20 265 338 90 88 0
85 20 458 523 90 0 90
86 -20 555 612 90 83 0
87 10 173 238 90 0 92
88 20 85 144 90 0 84
89 -10 645 708 90 91 0
90 -20 737 802 90 85 0
91 10 20 84 90 0 89
92 -10 836 889 90 87 0
93 20 368 441 90 0 94
94 -20 475 518 90 93 0
95 -10 285 336 90 97 0
96 -20 196 239 90 99 0
97 10 95 156 90 0 95
98 30 561 622 0 0 107
99 20 30 84 90 0 96
100 -20 743 820 90 101 0
101 20 647 726 90 0 100
102 -10 725 786 90 52 0
103 -10 632 693 90 65 0
104 -10 732 777 90 24 0
105 -20 109 170 90 79 0
106 -10 665 716 90 37 0
107 -30 561 622 90 98 0
DEPOT_SECTION
1
-1
EOF
11 changes: 11 additions & 0 deletions PDPTW/li/100/lc102.sol
Original file line number Diff line number Diff line change
@@ -0,0 +1,11 @@
Route #1: 81 78 105 76 71 70 73 77 79 80
Route #2: 57 55 54 53 56 58 60 59
Route #3: 98 96 95 94 92 93 97 101 100 99
Route #4: 32 33 31 35 37 38 39 104 36 34
Route #5: 13 17 18 19 15 16 14 12
Route #6: 90 87 86 83 82 84 85 88 89 91
Route #7: 43 42 41 40 44 46 45 48 51 50 106 52 49 47
Route #8: 67 65 63 62 74 72 61 64 68 102 66 69
Route #9: 5 3 7 8 10 11 9 6 4 2 1 75
Route #10: 20 24 25 27 29 30 28 103 26 23 22 21
Cost 828937
Loading