Solving CVRP with ACO
Minimizing Travel Cost for Complex Delivery Problems
This scenario involves the Capacitated Vehicle Routing Problem,
solved using the meta-heuristics algorithm Ant Colony Optimization. Basically, VRP is a network consisting of a number of nodes
(sometimes called cities) and arcs connecting one to all others along with the corresponding costs.
Mostly, the aim is to minimize the cost in visiting each customer once and only once. The term
"capacitated" is added due to some capacity constraints on the vehicles (vcap).
Enter the problem. Some company wants to deliver loads to a number of customers. In this case, we
have 24 nodes based on the location of Germany's train stations (don't ask why). The delivery
always starts from and ends at the depot, visiting a list of customers in other cities. And then
a number of questions arise:
- How do we minimize the travel cost in terms of distance?
- How many trucks are required?
- Which cities are visited by the truck #1, #2. etc.?
- depot: [0..23], def = 0
- vcap: [200..400], def = 400
There is a way to set all the demands, but I don't think you are ready for that. 😉
VCAP: 300 vol.
ACTIVE: 21 customers
- Kassel-Wilhelmshöhe (50 vol.)
- Düsseldorf Hbf (50 vol.)
- Frankfurt Hbf (65 vol.)
- Hannover Hbf (90 vol.)
- Aachen Hbf (75 vol.)
- Stuttgart Hbf (65 vol.)
- Dresden Hbf (80 vol.)
- Hamburg Hbf (45 vol.)
- München Hbf (50 vol.)
- Bremen Hbf (45 vol.)
- Leipzig Hbf (55 vol.)
- Dortmund Hbf (50 vol.)
- Karlsruhe Hbf (30 vol.)
- Ulm Hbf (60 vol.)
- Köln Hbf (80 vol.)
- Mannheim Hbf (55 vol.)
- Kiel Hbf (100 vol.)
- Mainz Hbf (65 vol.)
- Würzburg Hbf (40 vol.)
- Saarbrücken Hbf (40 vol.)
- Osnabrück Hbf (70 vol.)
Tour 1
COST: 1622.09 km
LOAD: 295 vol.
- Mannheim Hbf | 55 vol.
- Karlsruhe Hbf | 30 vol.
- Saarbrücken Hbf | 40 vol.
- Mainz Hbf | 65 vol.
- Frankfurt Hbf | 65 vol.
- Würzburg Hbf | 40 vol.
Tour 2
COST: 1047.518 km
LOAD: 275 vol.
- Dresden Hbf | 80 vol.
- Leipzig Hbf | 55 vol.
- Kassel-Wilhelmshöhe | 50 vol.
- Hannover Hbf | 90 vol.
Tour 3
COST: 1107.833 km
LOAD: 260 vol.
- Osnabrück Hbf | 70 vol.
- Bremen Hbf | 45 vol.
- Hamburg Hbf | 45 vol.
- Kiel Hbf | 100 vol.
Tour 4
COST: 1308.428 km
LOAD: 255 vol.
- Dortmund Hbf | 50 vol.
- Düsseldorf Hbf | 50 vol.
- Köln Hbf | 80 vol.
- Aachen Hbf | 75 vol.
Tour 5
COST: 1447.27 km
LOAD: 175 vol.
- München Hbf | 50 vol.
- Ulm Hbf | 60 vol.
- Stuttgart Hbf | 65 vol.
LOAD: 295 vol.
- Mannheim Hbf | 55 vol.
- Karlsruhe Hbf | 30 vol.
- Saarbrücken Hbf | 40 vol.
- Mainz Hbf | 65 vol.
- Frankfurt Hbf | 65 vol.
- Würzburg Hbf | 40 vol.
LOAD: 275 vol.
- Dresden Hbf | 80 vol.
- Leipzig Hbf | 55 vol.
- Kassel-Wilhelmshöhe | 50 vol.
- Hannover Hbf | 90 vol.
LOAD: 260 vol.
- Osnabrück Hbf | 70 vol.
- Bremen Hbf | 45 vol.
- Hamburg Hbf | 45 vol.
- Kiel Hbf | 100 vol.
LOAD: 255 vol.
- Dortmund Hbf | 50 vol.
- Düsseldorf Hbf | 50 vol.
- Köln Hbf | 80 vol.
- Aachen Hbf | 75 vol.
LOAD: 175 vol.
- München Hbf | 50 vol.
- Ulm Hbf | 60 vol.
- Stuttgart Hbf | 65 vol.
#generations: 10 for global, 5 for local
#ants: 5 times #active_customers
ACO
Rel. importance of pheromones α = 1.0
Rel. importance of visibility β = 10.0
Trail persistance ρ = 0.5
Pheromone intensity Q = 10
See this wikipedia page to learn more.
NETWORK Depo: [1] Berlin Hbf | Number of cities: 24 | Total loads: 1260 vol. | Vehicle capacity: 300 vol. Loads: [50, 0, 50, 65, 90, 75, 65, 80, 45, 50, 45, 55, 50, 0, 30, 60, 80, 55, 100, 65, 40, 40, 70, 0] ITERATION Generation: #1 Best cost: 7959.379 | Path: [1, 0, 4, 10, 22, 8, 1, 7, 11, 3, 19, 14, 1, 18, 12, 2, 16, 1, 20, 15, 6, 17, 21, 1, 9, 5, 1] Best cost: 7081.190 | Path: [1, 3, 19, 17, 14, 6, 1, 11, 7, 4, 10, 1, 8, 18, 22, 12, 1, 0, 2, 16, 5, 21, 1, 20, 15, 9, 1] Best cost: 7025.906 | Path: [1, 12, 2, 16, 5, 21, 1, 7, 11, 0, 4, 1, 8, 18, 10, 22, 20, 1, 9, 15, 6, 14, 17, 1, 3, 19, 1] Best cost: 6979.787 | Path: [1, 20, 3, 19, 17, 14, 21, 1, 7, 11, 4, 10, 1, 8, 18, 22, 12, 1, 0, 16, 2, 5, 1, 15, 6, 9, 1] Best cost: 6861.959 | Path: [1, 3, 19, 17, 14, 6, 1, 7, 11, 4, 10, 1, 18, 8, 22, 0, 1, 12, 2, 16, 5, 21, 1, 20, 15, 9, 1] Best cost: 6771.203 | Path: [1, 17, 3, 19, 21, 14, 20, 1, 11, 7, 0, 4, 1, 8, 18, 10, 22, 1, 16, 2, 5, 12, 1, 9, 15, 6, 1] Best cost: 6699.334 | Path: [1, 20, 3, 19, 17, 14, 21, 1, 7, 11, 4, 0, 1, 8, 18, 10, 22, 1, 12, 2, 16, 5, 1, 9, 15, 6, 1] OPTIMIZING each tour... Current: [[1, 20, 3, 19, 17, 14, 21, 1], [1, 7, 11, 4, 0, 1], [1, 8, 18, 10, 22, 1], [1, 12, 2, 16, 5, 1], [1, 9, 15, 6, 1]] [1] Cost: 1662.659 to 1622.090 | Optimized: [1, 17, 14, 21, 19, 3, 20, 1] [2] Cost: 1148.489 to 1047.518 | Optimized: [1, 7, 11, 0, 4, 1] [3] Cost: 1132.488 to 1107.833 | Optimized: [1, 22, 10, 8, 18, 1] ACO RESULTS [1/295 vol./1622.090 km] Berlin Hbf -> Mannheim Hbf -> Karlsruhe Hbf -> Saarbrücken Hbf -> Mainz Hbf -> Frankfurt Hbf -> Würzburg Hbf --> Berlin Hbf [2/275 vol./1047.518 km] Berlin Hbf -> Dresden Hbf -> Leipzig Hbf -> Kassel-Wilhelmshöhe -> Hannover Hbf --> Berlin Hbf [3/260 vol./1107.833 km] Berlin Hbf -> Osnabrück Hbf -> Bremen Hbf -> Hamburg Hbf -> Kiel Hbf --> Berlin Hbf [4/255 vol./1308.428 km] Berlin Hbf -> Dortmund Hbf -> Düsseldorf Hbf -> Köln Hbf -> Aachen Hbf --> Berlin Hbf [5/175 vol./1447.270 km] Berlin Hbf -> München Hbf -> Ulm Hbf -> Stuttgart Hbf --> Berlin Hbf OPTIMIZATION RESULT: 5 tours | 6533.139 km.