z-logo
Premium
SWARM INTELLIGENCE: APPLICATION OF THE ANT COLONY OPTIMIZATION ALGORITHM TO LOGISTICS‐ORIENTED VEHICLE ROUTING PROBLEMS
Author(s) -
Bell John E.,
Griffis Stanley E.
Publication year - 2010
Publication title -
journal of business logistics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.611
H-Index - 79
eISSN - 2158-1592
pISSN - 0735-3766
DOI - 10.1002/j.2158-1592.2010.tb00146.x
Subject(s) - ant colony optimization algorithms , tabu search , swarm intelligence , computer science , metaheuristic , simulated annealing , vehicle routing problem , swarm behaviour , ant colony , genetic algorithm , mathematical optimization , algorithm , operations research , routing (electronic design automation) , artificial intelligence , particle swarm optimization , machine learning , engineering , mathematics , computer network
This research evaluates a set of logistics‐oriented vehicle routing problems (VRP) taken from the logistics and supply chain literature under the widely used Clark‐Wright Savings algorithm and the newer metaheuristic method employing a type of swarm intelligence called Ant Colony Optimization (ACO). ACO simulates the decision‐making processes of colonies of ants as they forage for food and is related to other artificial intelligence techniques such as Tabu Search, Simulated Annealing and Genetic Algorithms. Experimentation shows that ACO is successful in finding solutions near the best‐known solutions for problems with up to 20 demand locations. In addition, testing for the affect of spatial patterns suggested by the logistics literature for facility locations appears to make a difference in the quality of the solutions for the two algorithms. Finally, ACO is shown to be superior to the savings algorithm found in software packages and as a result should be tested on even larger, more complex logistics‐oriented vehicle routing problems, representative of those encountered in larger industrial and retail settings.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here