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: 22 customers
- Kassel-Wilhelmshöhe (25 vol.)
- Düsseldorf Hbf (85 vol.)
- Frankfurt Hbf (30 vol.)
- Hannover Hbf (20 vol.)
- Aachen Hbf (85 vol.)
- Stuttgart Hbf (85 vol.)
- Dresden Hbf (50 vol.)
- Hamburg Hbf (100 vol.)
- München Hbf (20 vol.)
- Bremen Hbf (50 vol.)
- Leipzig Hbf (65 vol.)
- Dortmund Hbf (35 vol.)
- Nürnberg Hbf (75 vol.)
- Karlsruhe Hbf (80 vol.)
- Ulm Hbf (90 vol.)
- Köln Hbf (95 vol.)
- Mannheim Hbf (55 vol.)
- Kiel Hbf (60 vol.)
- Mainz Hbf (30 vol.)
- Würzburg Hbf (85 vol.)
- Saarbrücken Hbf (25 vol.)
- Osnabrück Hbf (55 vol.)
Tour 1
COST: 1308.428 km
LOAD: 300 vol.
- Dortmund Hbf | 35 vol.
- Düsseldorf Hbf | 85 vol.
- Köln Hbf | 95 vol.
- Aachen Hbf | 85 vol.
Tour 2
COST: 1312.378 km
LOAD: 300 vol.
- Kassel-Wilhelmshöhe | 25 vol.
- Würzburg Hbf | 85 vol.
- Nürnberg Hbf | 75 vol.
- Leipzig Hbf | 65 vol.
- Dresden Hbf | 50 vol.
Tour 3
COST: 1113.837 km
LOAD: 285 vol.
- Hannover Hbf | 20 vol.
- Osnabrück Hbf | 55 vol.
- Bremen Hbf | 50 vol.
- Hamburg Hbf | 100 vol.
- Kiel Hbf | 60 vol.
Tour 4
COST: 1768.229 km
LOAD: 300 vol.
- München Hbf | 20 vol.
- Ulm Hbf | 90 vol.
- Stuttgart Hbf | 85 vol.
- Karlsruhe Hbf | 80 vol.
- Saarbrücken Hbf | 25 vol.
Tour 5
COST: 1290.503 km
LOAD: 115 vol.
- Mannheim Hbf | 55 vol.
- Mainz Hbf | 30 vol.
- Frankfurt Hbf | 30 vol.
LOAD: 300 vol.
- Dortmund Hbf | 35 vol.
- Düsseldorf Hbf | 85 vol.
- Köln Hbf | 95 vol.
- Aachen Hbf | 85 vol.
LOAD: 300 vol.
- Kassel-Wilhelmshöhe | 25 vol.
- Würzburg Hbf | 85 vol.
- Nürnberg Hbf | 75 vol.
- Leipzig Hbf | 65 vol.
- Dresden Hbf | 50 vol.
LOAD: 285 vol.
- Hannover Hbf | 20 vol.
- Osnabrück Hbf | 55 vol.
- Bremen Hbf | 50 vol.
- Hamburg Hbf | 100 vol.
- Kiel Hbf | 60 vol.
LOAD: 300 vol.
- München Hbf | 20 vol.
- Ulm Hbf | 90 vol.
- Stuttgart Hbf | 85 vol.
- Karlsruhe Hbf | 80 vol.
- Saarbrücken Hbf | 25 vol.
LOAD: 115 vol.
- Mannheim Hbf | 55 vol.
- Mainz Hbf | 30 vol.
- Frankfurt Hbf | 30 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: 1300 vol. | Vehicle capacity: 300 vol. Loads: [25, 0, 85, 30, 20, 85, 85, 50, 100, 20, 50, 65, 35, 75, 80, 90, 95, 55, 60, 30, 85, 25, 55, 0] ITERATION Generation: #1 Best cost: 8268.476 | Path: [1, 0, 22, 10, 4, 8, 12, 1, 7, 11, 13, 20, 9, 1, 18, 2, 16, 19, 3, 1, 5, 14, 17, 21, 1, 6, 15, 1] Best cost: 7045.700 | Path: [1, 2, 16, 5, 12, 1, 7, 11, 13, 20, 0, 1, 8, 18, 10, 22, 4, 1, 3, 19, 17, 14, 6, 9, 1, 21, 15, 1] Best cost: 7042.421 | Path: [1, 4, 22, 10, 8, 18, 1, 11, 7, 13, 20, 0, 1, 12, 2, 16, 5, 1, 3, 19, 17, 14, 6, 9, 1, 15, 21, 1] Best cost: 6977.332 | Path: [1, 7, 11, 13, 20, 0, 1, 8, 18, 10, 4, 22, 1, 9, 15, 6, 14, 21, 1, 12, 2, 16, 5, 1, 19, 3, 17, 1] Best cost: 6871.137 | Path: [1, 18, 8, 10, 22, 4, 1, 11, 7, 13, 20, 0, 1, 9, 15, 6, 14, 21, 1, 2, 16, 5, 12, 1, 19, 3, 17, 1] Generation: #2 Best cost: 6849.453 | Path: [1, 12, 2, 16, 5, 1, 11, 7, 13, 20, 0, 1, 8, 18, 10, 22, 4, 1, 9, 15, 6, 14, 21, 1, 3, 19, 17, 1] Best cost: 6847.613 | Path: [1, 12, 2, 16, 5, 1, 11, 7, 13, 20, 0, 1, 8, 18, 10, 22, 4, 1, 9, 15, 6, 14, 21, 1, 17, 19, 3, 1] Best cost: 6828.578 | Path: [1, 5, 16, 2, 12, 1, 11, 7, 13, 20, 0, 1, 4, 22, 10, 8, 18, 1, 9, 15, 6, 14, 21, 1, 3, 19, 17, 1] OPTIMIZING each tour... Current: [[1, 5, 16, 2, 12, 1], [1, 11, 7, 13, 20, 0, 1], [1, 4, 22, 10, 8, 18, 1], [1, 9, 15, 6, 14, 21, 1], [1, 3, 19, 17, 1]] [1] Cost: 1310.663 to 1308.428 | Optimized: [1, 12, 2, 16, 5, 1] [2] Cost: 1343.506 to 1312.378 | Optimized: [1, 0, 20, 13, 11, 7, 1] [5] Cost: 1292.343 to 1290.503 | Optimized: [1, 17, 19, 3, 1] ACO RESULTS [1/300 vol./1308.428 km] Berlin Hbf -> Dortmund Hbf -> Düsseldorf Hbf -> Köln Hbf -> Aachen Hbf --> Berlin Hbf [2/300 vol./1312.378 km] Berlin Hbf -> Kassel-Wilhelmshöhe -> Würzburg Hbf -> Nürnberg Hbf -> Leipzig Hbf -> Dresden Hbf --> Berlin Hbf [3/285 vol./1113.837 km] Berlin Hbf -> Hannover Hbf -> Osnabrück Hbf -> Bremen Hbf -> Hamburg Hbf -> Kiel Hbf --> Berlin Hbf [4/300 vol./1768.229 km] Berlin Hbf -> München Hbf -> Ulm Hbf -> Stuttgart Hbf -> Karlsruhe Hbf -> Saarbrücken Hbf --> Berlin Hbf [5/115 vol./1290.503 km] Berlin Hbf -> Mannheim Hbf -> Mainz Hbf -> Frankfurt Hbf --> Berlin Hbf OPTIMIZATION RESULT: 5 tours | 6793.375 km.