4 Computational experiments
Based on the data of the example in reference [5], as-
sume that a single logistics center (3.2 km, 14.1 km) and 20
customers are located in a square area with side length of
20 km, each customer’s demand and supply of goods vol-
ume are less than 2 tons (inclusive), there are 10 vehicles in
the logistics center, and the vehicle capacity is 8 tons, the
maximum distance allowed for any vehicle is 50 km, aver-
age speed of the vehicle t = 20 km/hour. Reference [5]
set the punishment weight on the delivery distance, the wait
loss for the vehicle that arrived early, and late loss as fol-
lows: 0.1:0.3:0.6. Here, the author made assumptions as this
proportion: !1 = 1 yuan/km, !2 = 3 yuan/hour, !3 = 6
yuan/hour, the fixed cost of each vehicle c = 20 yuan, the
standard time of the cargo loading and unloading is t′ = 1
ton/hour. Location coordinates, each customer’s demand and
supply of goods, and the time windows of the 20 customer’s
are in Table 1. Request to reasonably arrange the delivery
routes to make the total mileage the shortest, pursuant to the
above conditions.