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 (65 vol.)
  2. Düsseldorf Hbf (90 vol.)
  3. Frankfurt Hbf (95 vol.)
  4. Hannover Hbf (90 vol.)
  5. Aachen Hbf (40 vol.)
  6. Stuttgart Hbf (95 vol.)
  7. Hamburg Hbf (50 vol.)
  8. München Hbf (25 vol.)
  9. Bremen Hbf (35 vol.)
  10. Leipzig Hbf (60 vol.)
  11. Nürnberg Hbf (50 vol.)
  12. Karlsruhe Hbf (100 vol.)
  13. Köln Hbf (65 vol.)
  14. Mannheim Hbf (35 vol.)
  15. Kiel Hbf (70 vol.)
  16. Mainz Hbf (70 vol.)
  17. Würzburg Hbf (25 vol.)
  18. Saarbrücken Hbf (100 vol.)
  19. Osnabrück Hbf (55 vol.)
  20. Freiburg Hbf (75 vol.)
Result
OVERALL | #TOURS: 5 | COST: 7044.334 km | LOAD: 1290 vol. | VCAP: 300 vol.
Tour 1
COST: 1610.199 km
LOAD: 280 vol.

  1. München Hbf | 25 vol.
  2. Stuttgart Hbf | 95 vol.
  3. Karlsruhe Hbf | 100 vol.
  4. Mannheim Hbf | 35 vol.
  5. Würzburg Hbf | 25 vol.

Tour 2
COST: 1113.837 km
LOAD: 300 vol.

  1. Hannover Hbf | 90 vol.
  2. Osnabrück Hbf | 55 vol.
  3. Bremen Hbf | 35 vol.
  4. Hamburg Hbf | 50 vol.
  5. Kiel Hbf | 70 vol.

Tour 3
COST: 1240.678 km
LOAD: 290 vol.

  1. Kassel-Wilhelmshöhe | 65 vol.
  2. Frankfurt Hbf | 95 vol.
  3. Mainz Hbf | 70 vol.
  4. Leipzig Hbf | 60 vol.

Tour 4
COST: 1914.917 km
LOAD: 265 vol.

  1. Nürnberg Hbf | 50 vol.
  2. Freiburg Hbf | 75 vol.
  3. Saarbrücken Hbf | 100 vol.
  4. Aachen Hbf | 40 vol.

Tour 5
COST: 1164.703 km
LOAD: 155 vol.

  1. Köln Hbf | 65 vol.
  2. Düsseldorf Hbf | 90 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: 1290 vol. | Vehicle capacity: 300 vol.
Loads: [65, 0, 90, 95, 90, 40, 95, 0, 50, 25, 35, 60, 0, 50, 100, 0, 65, 35, 70, 70, 25, 100, 55, 75]

ITERATION
Generation: #1
Best cost: 8206.878 | Path: [1, 0, 10, 22, 4, 8, 1, 11, 13, 20, 3, 19, 1, 18, 2, 16, 5, 17, 1, 14, 6, 9, 23, 1, 21, 1]
Best cost: 7513.454 | Path: [1, 2, 16, 5, 21, 1, 11, 3, 19, 17, 20, 1, 22, 10, 4, 8, 18, 1, 0, 14, 6, 9, 1, 13, 23, 1]
Best cost: 7455.940 | Path: [1, 14, 17, 19, 3, 1, 11, 0, 4, 10, 8, 1, 18, 22, 2, 16, 1, 5, 21, 23, 20, 13, 1, 6, 9, 1]
Best cost: 7332.722 | Path: [1, 18, 8, 4, 22, 10, 1, 11, 0, 19, 3, 1, 20, 6, 14, 17, 5, 1, 13, 9, 23, 21, 1, 2, 16, 1]
Best cost: 7316.991 | Path: [1, 18, 8, 10, 4, 22, 1, 11, 20, 3, 19, 17, 1, 13, 9, 6, 14, 1, 0, 2, 16, 5, 1, 23, 21, 1]
Best cost: 7180.941 | Path: [1, 23, 14, 17, 19, 1, 11, 13, 20, 3, 0, 1, 4, 22, 10, 8, 18, 1, 16, 2, 5, 21, 1, 9, 6, 1]
Generation: #3
Best cost: 7123.880 | Path: [1, 6, 14, 17, 19, 1, 11, 13, 20, 3, 0, 1, 8, 18, 10, 22, 4, 1, 9, 23, 21, 5, 1, 2, 16, 1]
Generation: #5
Best cost: 7096.696 | Path: [1, 9, 6, 14, 17, 20, 1, 8, 18, 10, 22, 4, 1, 11, 0, 3, 19, 1, 13, 23, 21, 5, 1, 16, 2, 1]

OPTIMIZING each tour...
Current: [[1, 9, 6, 14, 17, 20, 1], [1, 8, 18, 10, 22, 4, 1], [1, 11, 0, 3, 19, 1], [1, 13, 23, 21, 5, 1], [1, 16, 2, 1]]
[2] Cost: 1136.947 to 1113.837 | Optimized: [1, 4, 22, 10, 8, 18, 1]
[3] Cost: 1269.930 to 1240.678 | Optimized: [1, 0, 3, 19, 11, 1]

ACO RESULTS
[1/280 vol./1610.199 km] Berlin Hbf -> München Hbf -> Stuttgart Hbf -> Karlsruhe Hbf -> Mannheim Hbf -> Würzburg Hbf --> Berlin Hbf
[2/300 vol./1113.837 km] Berlin Hbf -> Hannover Hbf -> Osnabrück Hbf -> Bremen Hbf -> Hamburg Hbf -> Kiel Hbf --> Berlin Hbf
[3/290 vol./1240.678 km] Berlin Hbf -> Kassel-Wilhelmshöhe -> Frankfurt Hbf -> Mainz Hbf -> Leipzig Hbf --> Berlin Hbf
[4/265 vol./1914.917 km] Berlin Hbf -> Nürnberg Hbf -> Freiburg Hbf -> Saarbrücken Hbf -> Aachen Hbf --> Berlin Hbf
[5/155 vol./1164.703 km] Berlin Hbf -> Köln Hbf -> Düsseldorf Hbf --> Berlin Hbf
OPTIMIZATION RESULT: 5 tours | 7044.334 km.