The Linehaul-Feeder Vehicle Routing Problem with Virtual Depots and Time Windows
Table 1
Sixteen test examples.
Problem
Network type
Number of nodes
Small vehicle capacity
Demand coefficienta
Virtual depot candidatesb
A32
RS
32
100
2.0
4
A34
RM
34
100
2.0
4
A38
RM
38
100
2.0
4
A45
RM
45
100
2.0
4
A46
RM
46
100
2.0
4
A61
RM
61
100
1.4
4
A60
RS
60
100
1.9
4
A64
RS
64
100
1.8
4
A65
RM
65
100
2.0
4
A69
RM
69
100
2.0
4
A80
RS
80
100
2.0
4
C51
RS
51
160
2.0
4
C81
RS
81
60
2.0
4
C161
RS
161
60
2.0
4
F45
CM
45
2010
1.6
4
F135
CM
135
2210
1.7
4
Resource: modified from http://neo.lcc.uma.es/radi-aeb/WebVRP/.
aDemand coefficient represents a multiplier to the original demand.
bNumber of virtual depot candidates are set to four, one in each quadrant.
