Solving CVRP with ACO

Minimizing Travel Cost for Complex Delivery Problems

Start With The Story

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.?
Such questions are addressed by employing the ants.

How to use this page?
Two parameters can be adjusted:
  • depot: [0..23], def = 0
  • vcap: [200..400], def = 400
Calling this page without parameter will get the defaults. Otherwise, just try something like this

There is a way to set all the demands, but I don't think you are ready for that. 😉
Map
DEPOT: Berlin Hbf
VCAP: 300 vol.
ACTIVE: 20 customers
  1. Kassel-Wilhelmshöhe (45 vol.)
  2. Frankfurt Hbf (100 vol.)
  3. Hannover Hbf (100 vol.)
  4. Stuttgart Hbf (60 vol.)
  5. Hamburg Hbf (100 vol.)
  6. München Hbf (35 vol.)
  7. Bremen Hbf (100 vol.)
  8. Leipzig Hbf (40 vol.)
  9. Dortmund Hbf (20 vol.)
  10. Nürnberg Hbf (25 vol.)
  11. Karlsruhe Hbf (80 vol.)
  12. Ulm Hbf (25 vol.)
  13. Köln Hbf (60 vol.)
  14. Mannheim Hbf (50 vol.)
  15. Kiel Hbf (35 vol.)
  16. Mainz Hbf (20 vol.)
  17. Würzburg Hbf (35 vol.)
  18. Saarbrücken Hbf (45 vol.)
  19. Osnabrück Hbf (50 vol.)
  20. Freiburg Hbf (50 vol.)
Result
OVERALL | #TOURS: 4 | COST: 5837.454 km | LOAD: 1075 vol. | VCAP: 300 vol.
Tour 1
COST: 1409.247 km
LOAD: 285 vol.

  1. Frankfurt Hbf | 100 vol.
  2. Mainz Hbf | 20 vol.
  3. Mannheim Hbf | 50 vol.
  4. Karlsruhe Hbf | 80 vol.
  5. Würzburg Hbf | 35 vol.

Tour 2
COST: 2111.896 km
LOAD: 300 vol.

  1. Leipzig Hbf | 40 vol.
  2. Nürnberg Hbf | 25 vol.
  3. München Hbf | 35 vol.
  4. Ulm Hbf | 25 vol.
  5. Stuttgart Hbf | 60 vol.
  6. Freiburg Hbf | 50 vol.
  7. Saarbrücken Hbf | 45 vol.
  8. Dortmund Hbf | 20 vol.

Tour 3
COST: 1107.833 km
LOAD: 285 vol.

  1. Osnabrück Hbf | 50 vol.
  2. Bremen Hbf | 100 vol.
  3. Hamburg Hbf | 100 vol.
  4. Kiel Hbf | 35 vol.

Tour 4
COST: 1208.478 km
LOAD: 205 vol.

  1. Kassel-Wilhelmshöhe | 45 vol.
  2. Köln Hbf | 60 vol.
  3. Hannover Hbf | 100 vol.

ANTS
#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.

What kind of cost?
Directed driving distance, obtained through Google API. The visualization does not display that since the idea is VRP. Adding such feature is very easy, but not a priority for this case.
Can we use any address?
Yes, absolutely. What we need is the geo-coordinates of the addresses, and the distance matrix, which is not a problem. See my oldie master thesis here, implemented using PHP/MySQL for a delivery case in Darmstadt city, Germany.
Travel time as the cost?
Just replace the distance matrix with a duration matrix, then it is done. Please keep in mind, this feature is not intended for realtime use. But regarding the idea, not an issue.
Up to how many nodes?
There is no definitive answer for that. However, if a large number of nodes involved, a good strategy is required. Actually, for this one, a suitable technique is already implemented instead of a "plain" ACO. 

NETWORK
Depo: [1] Berlin Hbf | Number of cities: 24 | Total loads: 1075 vol. | Vehicle capacity: 300 vol.
Loads: [45, 0, 0, 100, 100, 0, 60, 0, 100, 35, 100, 40, 20, 25, 80, 25, 60, 50, 35, 20, 35, 45, 50, 50]

ITERATION
Generation: #1
Best cost: 6667.295 | Path: [1, 0, 12, 16, 19, 3, 17, 1, 11, 13, 20, 6, 15, 14, 9, 1, 4, 8, 18, 22, 1, 10, 21, 23, 1]
Best cost: 6608.337 | Path: [1, 4, 10, 8, 1, 11, 0, 12, 22, 16, 19, 17, 1, 18, 20, 13, 9, 15, 6, 14, 1, 3, 21, 23, 1]
Best cost: 6320.739 | Path: [1, 8, 18, 10, 22, 1, 11, 13, 20, 3, 19, 17, 15, 1, 4, 0, 12, 16, 21, 1, 9, 6, 14, 23, 1]
Best cost: 6306.140 | Path: [1, 18, 8, 10, 22, 1, 11, 0, 4, 12, 16, 19, 1, 20, 3, 17, 14, 15, 1, 13, 9, 6, 23, 21, 1]
Best cost: 6211.507 | Path: [1, 8, 18, 10, 22, 1, 11, 0, 20, 3, 19, 17, 1, 4, 12, 16, 21, 6, 1, 13, 9, 15, 14, 23, 1]
Best cost: 6174.405 | Path: [1, 11, 0, 20, 13, 9, 15, 6, 19, 1, 8, 18, 10, 22, 1, 4, 12, 16, 3, 1, 17, 14, 23, 21, 1]
Best cost: 6143.461 | Path: [1, 18, 8, 10, 22, 1, 11, 4, 0, 3, 1, 20, 19, 17, 14, 6, 15, 13, 1, 12, 16, 21, 23, 9, 1]
Best cost: 5985.431 | Path: [1, 20, 3, 19, 17, 14, 1, 11, 13, 9, 15, 6, 23, 21, 12, 1, 8, 18, 10, 22, 1, 4, 0, 16, 1]

OPTIMIZING each tour...
Current: [[1, 20, 3, 19, 17, 14, 1], [1, 11, 13, 9, 15, 6, 23, 21, 12, 1], [1, 8, 18, 10, 22, 1], [1, 4, 0, 16, 1]]
[1] Cost: 1465.825 to 1409.247 | Optimized: [1, 3, 19, 17, 14, 20, 1]
[3] Cost: 1132.488 to 1107.833 | Optimized: [1, 22, 10, 8, 18, 1]
[4] Cost: 1275.222 to 1208.478 | Optimized: [1, 0, 16, 4, 1]

ACO RESULTS
[1/285 vol./1409.247 km] Berlin Hbf -> Frankfurt Hbf -> Mainz Hbf -> Mannheim Hbf -> Karlsruhe Hbf -> Würzburg Hbf --> Berlin Hbf
[2/300 vol./2111.896 km] Berlin Hbf -> Leipzig Hbf -> Nürnberg Hbf -> München Hbf -> Ulm Hbf -> Stuttgart Hbf -> Freiburg Hbf -> Saarbrücken Hbf -> Dortmund Hbf --> Berlin Hbf
[3/285 vol./1107.833 km] Berlin Hbf -> Osnabrück Hbf -> Bremen Hbf -> Hamburg Hbf -> Kiel Hbf --> Berlin Hbf
[4/205 vol./1208.478 km] Berlin Hbf -> Kassel-Wilhelmshöhe -> Köln Hbf -> Hannover Hbf --> Berlin Hbf
OPTIMIZATION RESULT: 4 tours | 5837.454 km.