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: Kassel-Wilhelmshöhe
VCAP: 400 vol.
ACTIVE: 19 customers
  1. Berlin Hbf (25 vol.)
  2. Düsseldorf Hbf (100 vol.)
  3. Frankfurt Hbf (100 vol.)
  4. Hannover Hbf (85 vol.)
  5. Aachen Hbf (20 vol.)
  6. Stuttgart Hbf (60 vol.)
  7. Dresden Hbf (75 vol.)
  8. Hamburg Hbf (65 vol.)
  9. München Hbf (50 vol.)
  10. Leipzig Hbf (95 vol.)
  11. Dortmund Hbf (80 vol.)
  12. Karlsruhe Hbf (100 vol.)
  13. Ulm Hbf (20 vol.)
  14. Mannheim Hbf (70 vol.)
  15. Kiel Hbf (95 vol.)
  16. Mainz Hbf (50 vol.)
  17. Saarbrücken Hbf (80 vol.)
  18. Osnabrück Hbf (100 vol.)
  19. Freiburg Hbf (40 vol.)
Result
OVERALL | #TOURS: 4 | COST: 4326.671 km | LOAD: 1310 vol. | VCAP: 400 vol.
Tour 1
COST: 1523.121 km
LOAD: 390 vol.

  1. Stuttgart Hbf | 60 vol.
  2. Ulm Hbf | 20 vol.
  3. München Hbf | 50 vol.
  4. Freiburg Hbf | 40 vol.
  5. Karlsruhe Hbf | 100 vol.
  6. Mannheim Hbf | 70 vol.
  7. Mainz Hbf | 50 vol.

Tour 2
COST: 952.76 km
LOAD: 380 vol.

  1. Frankfurt Hbf | 100 vol.
  2. Saarbrücken Hbf | 80 vol.
  3. Aachen Hbf | 20 vol.
  4. Düsseldorf Hbf | 100 vol.
  5. Dortmund Hbf | 80 vol.

Tour 3
COST: 1356.365 km
LOAD: 355 vol.

  1. Hamburg Hbf | 65 vol.
  2. Kiel Hbf | 95 vol.
  3. Berlin Hbf | 25 vol.
  4. Dresden Hbf | 75 vol.
  5. Leipzig Hbf | 95 vol.

Tour 4
COST: 494.425 km
LOAD: 185 vol.

  1. Osnabrück Hbf | 100 vol.
  2. Hannover Hbf | 85 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: [0] Kassel-Wilhelmshöhe | Number of cities: 24 | Total loads: 1310 vol. | Vehicle capacity: 400 vol.
Loads: [0, 25, 100, 100, 85, 20, 60, 75, 65, 50, 0, 95, 80, 0, 100, 20, 0, 70, 95, 50, 0, 80, 100, 40]

ITERATION
Generation: #1
Best cost: 5215.857 | Path: [0, 1, 11, 7, 4, 22, 5, 0, 3, 19, 17, 14, 6, 15, 0, 12, 2, 21, 23, 9, 0, 8, 18, 0]
Best cost: 4980.382 | Path: [0, 3, 19, 17, 14, 6, 15, 0, 12, 2, 5, 21, 23, 9, 1, 0, 4, 22, 8, 18, 0, 11, 7, 0]
Best cost: 4907.035 | Path: [0, 15, 6, 14, 17, 3, 19, 0, 12, 2, 5, 22, 4, 0, 21, 23, 9, 7, 11, 1, 0, 8, 18, 0]
Best cost: 4891.858 | Path: [0, 15, 6, 14, 17, 19, 3, 0, 12, 2, 5, 21, 23, 9, 1, 0, 22, 4, 8, 18, 0, 11, 7, 0]
Best cost: 4857.790 | Path: [0, 9, 15, 6, 14, 17, 3, 0, 12, 2, 5, 22, 4, 0, 19, 21, 23, 7, 11, 1, 0, 8, 18, 0]
Best cost: 4717.921 | Path: [0, 23, 17, 14, 6, 15, 9, 19, 0, 12, 2, 5, 21, 3, 0, 22, 4, 8, 18, 1, 0, 11, 7, 0]
Best cost: 4677.338 | Path: [0, 23, 14, 6, 15, 9, 17, 19, 0, 3, 21, 5, 2, 12, 0, 4, 22, 8, 18, 1, 0, 11, 7, 0]
Generation: #2
Best cost: 4597.692 | Path: [0, 17, 14, 6, 15, 9, 23, 19, 0, 12, 2, 5, 21, 3, 0, 22, 4, 8, 18, 1, 0, 11, 7, 0]
Generation: #3
Best cost: 4413.192 | Path: [0, 17, 14, 6, 15, 9, 23, 19, 0, 3, 21, 5, 2, 12, 0, 11, 7, 1, 8, 18, 0, 4, 22, 0]

OPTIMIZING each tour...
Current: [[0, 17, 14, 6, 15, 9, 23, 19, 0], [0, 3, 21, 5, 2, 12, 0], [0, 11, 7, 1, 8, 18, 0], [0, 4, 22, 0]]
[1] Cost: 1571.763 to 1523.121 | Optimized: [0, 6, 15, 9, 23, 14, 17, 19, 0]
[3] Cost: 1390.933 to 1356.365 | Optimized: [0, 8, 18, 1, 7, 11, 0]
[4] Cost:  497.736 to  494.425 | Optimized: [0, 22, 4, 0]

ACO RESULTS
[1/390 vol./1523.121 km] Kassel-Wilhelmshöhe -> Stuttgart Hbf -> Ulm Hbf -> München Hbf -> Freiburg Hbf -> Karlsruhe Hbf -> Mannheim Hbf -> Mainz Hbf --> Kassel-Wilhelmshöhe
[2/380 vol./ 952.760 km] Kassel-Wilhelmshöhe -> Frankfurt Hbf -> Saarbrücken Hbf -> Aachen Hbf -> Düsseldorf Hbf -> Dortmund Hbf --> Kassel-Wilhelmshöhe
[3/355 vol./1356.365 km] Kassel-Wilhelmshöhe -> Hamburg Hbf -> Kiel Hbf -> Berlin Hbf -> Dresden Hbf -> Leipzig Hbf --> Kassel-Wilhelmshöhe
[4/185 vol./ 494.425 km] Kassel-Wilhelmshöhe -> Osnabrück Hbf -> Hannover Hbf --> Kassel-Wilhelmshöhe
OPTIMIZATION RESULT: 4 tours | 4326.671 km.