Research Article

Vehicle Routing Problem for Multiple Product Types, Compartments, and Trips with Soft Time Windows

Table 16

The quantity of product moved from node to node and delivered at node for fifteen customers.

Product 1Product 2
Moved from to Delivered at Moved from to Delivered at

Vehicle 1, trip 1
–5 70 10 90 20
 5–12 60 20 70 50
 12-11 40 40 20 20
Vehicle 1, trip 2
-1 40 20 150 80
 1–10 20 20 70 70
Vehicle 2, trip 1
–13 290 100 200 10
 13-14 190 20 190 50
 14-15 170 40 140 30
 15–7 130 30 110 40
 7-6 100 30 70 40
 6–8 70 60 30 10
 8-9 10 10 20 20
Vehicle 2, trip 2
–3 170 30 160 70
 3-2 140 100 90 60
 2–4 40 40 30 30