SWARM INTELLIGENCE: APPLICATION OF THE ANT COLONY OPTIMIZATION ALGORITHM TO LOGISTICS-ORIENTED VEHICLE ROUTING PROBLEMS

Journal of Business Logistics

Volumn 31, Issue 2, 2010, Pages 157-175

  Bell, John E ^a   Griffis, Stanley E ^b  

^a UNIVERSITY OF TENNESSEE   (United States)

^b MICHIGAN STATE UNIVERSITY   (United States)

Author keywords

Ant colony optimization; Heuristics; Logistics; Optimization; Swarm behavior; Vehicle routing

Indexed keywords

EID: 84055166047     PISSN: 07353766     EISSN: 21581592     Source Type: Journal    
DOI: 10.1002/j.2158-1592.2010.tb00146.x     Document Type: Article

References (37)

1. Abdinnour-Helm, Sue (2001), “Using Simulated Annealing to Solve the P-hub Median Problem,” International Journal of Physical Distribution and Logistics Management, Vol. 31, No. 3, pp. 203–220.
2. Agarwal, Yogesh K. (1985), “A Set Partitioning Approach to the Vehicle Routing Problem,” Unpublished Ph.D. Dissertation, Case-Western Reserve University.
3. Albritton, M. David and Patrick R. McMullen (2007), “Optimal Product Design Using a Colony of Virtual Ants,” European Journal of Operational Research, Vol. 176, No. 1. pp. 498–520.
4. th ed., New York: Pearson Prentice Hall, pp. 225–249.
5. Ballou, Ronald H. (1990), “A Continued Comparison of Several Popular Algorithms for Vehicle Routing and Scheduling,” Journal of Business Logistics, Vol. 11, No. 1, pp. 111–126.
6. Ballou, Ronald H. and Yogesh K. Agarwal (1988), “A Performance Comparison of Several Popular Algorithms for Vehicle Routing and Scheduling,” Journal of Business Logistics, Vol. 9, No. 1, pp. 51–65.
7. Bauer, Andreas, Bernd Bullnheimer, Richard F. Hartl, and Christine Strauss (1999), “An Ant Colony Optimization Approach for the Single Machine Tool Tardiness Problem,” Proceedings of the 1999 Congress on Evolutionary Computation, pp. 1445–1450.
8. Bautista, Joquin and Jordi Pereira (2007), “Ant Algorithms for a Time and Space Constrained Assembly Line Balancing Problem,” European Journal of Operations Research, Vol. 177, No. 3, pp. 2016–2034.
9. Bean, Nigel and Andre Costa (2005), “An Analytic Modeling Approach for Network Routing Algorithms that Use ‘Ant-like’ Mobile Agents,” Computer Networks, Vol. 45, No. 2, pp. 243–266.
10. Bell, John E. and Patrick R. McMullen (2004), “An Ant Colony Optimization Approach to the Vehicle Routing Problem,” Advanced Engineering Informatics, Vol. 18, No. 1, pp. 41–48.
11. Berry, L. M., Bruce A. Murtagh, Graham B. McMahon, Stephen J. Sugden, and Luke D. Welling (1998), “Genetic Algorithms in the Design of Complex Distribution Networks,” International Journal of Physical Distribution and Logistics Management, Vol. 28, No. 5, pp. 377–381.
12. Bland, John A. (1999), “Space Planning by Ant Colony Optimization,” International Journal of Computer Applications in Technology, Vol. 12, No. 6, pp. 320–328.
13. Bonabeau, Eric and Christopher Meyer (2001), “Swarm Intelligence: A Whole New Way to Think about Business,” Harvard Business Review, Vol. 79, No. 5, pp. 106–114.
14. Bullnheimer, Bernd, Richard F. Hartl, and Christine Strauss (1998), “Applying the Ant System to the Vehicle Routing Problem,” in Stefan Voss, S. Martello, Ibrahim H. Osman, and C. Roucairol (eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Boston, MA: Kluwer, pp. 109–120.
15. Bullnheimer, Bernd, Richard F. Hartl, and Christine Strauss (1999), “An Improved Ant System Algorithm for the Vehicle Routing Problem,” Annals of Operations Research, Vol. 89, pp. 319–328.
16. Christofides, Nicos and Samuel Eilon (1969), “An Algorithm for the Vehicle Dispatching Problem,” Operational Research Quarterly, Vol. 20, No. 3, pp. 309–318.
17. Christofides, Nicos, Aristide Mingozzi, and Paulo Toth (1979), “The Vehicle Routing Problem,” in Nicos Christofides, Aristide Mingozzi, Paulo Toth, and C. Sandi (eds), Combinatorial Optimization, Chichester: John Wiley and Sons, pp. 315–338.
18. Clark, G. and J. W. Wright (1964), “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points,” Operations Research, Vol. 12, pp. 568–581.
19. Doerner, Karl F., Richard F. Hartl, Siegfried Benkner, and Maria Lucka (2006), “Parallel Cooperative Savings Based Ant Colony Optimization—Multiple Search and Decomposition Approaches,” Parallel Processing Letters, Vol. 16, No. 3, pp. 351–369.
20. Donati, Alberto, Norman Casagrande, Andrea Rizzoli, and Luca Maria Gambardella (2008), “Time Dependent Vehicle Routing Problem with a Multi Ant Colony,” European Journal of Operational Research, Vol. 185, No. 3, pp. 1174–1191.
21. Dorigo, Marco (1992), Optimization, Learning and Natural Algorithms (In Italian) Unpublished Doctoral Dissertation, Politecnico di Milano, Dipartimento di Elettronica, Italy.
22. Dorigo, Marco, Gianni Di Caro, and Luca Maria Gambardella (1999), “Ant Algorithms for Discrete Optimization,” Artificial Life, Vol. 5, pp. 137–172.
23. Dorigo, Marco and Luca Maria Gambardella (1997), “Ant Colonies for the Traveling Salesman Problem,” BioSystem, Vol. 43, No. 1, pp. 73–81.
24. Gendreau, Michael, Alain Hertz, and Gilbert Laporte (1994), “A Tabu Search Heuristic for the Vehicle Routing Problem,” Management Science, Vol. 40, pp. 1276–1290.
25. Golden, Bruce L., Edward A. Wasil, James P. Kelly, and I-Ming Chao (1998), “The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results,” in T. G. Crainic and G. LaPorte (eds.), Fleet Management and Logistics, Norwell: Kluwer, pp. 33–56.
26. Gonzalez, Enrique Lopez and Miguel A. Rodriguez Fernandez (2000), “Genetic Optimisation of a Fuzzy Distribution Model,” International Journal of Physical Distribution and Logistics Management, Vol. 30, No. 7/8, pp. 681–696.
27. Haughton, Michael A. (2002), “Measuring and Managing the Learning Requirements of Route Reoptimization of Delivery Vehicle Drivers,” Journal of Business Logistics, Vol. 23, No. 2, pp. 45–67.
28. Lenstra, Jan K. and A. H. G. Rinnooy Kan (1981), “Complexity of Vehicle Routing and Scheduling Problems,” Networks, Vol. 11, pp. 221–227.
29. McMullen, Patrick R. (2001), “An Ant Colony Optimization Approach to Addressing a JIT Sequencing Problem with Multiple Objectives,” Artificial Intelligence in Engineering, Vol. 15, pp. 309–317.
30. Min, Hokey (1996), “Consolidation Terminal Location-allocation and Consolidated Routing Problems,” Journal of Business Logistics, Vol. 17, No. 2, pp. 235–264.
31. Osman, Ibrahim H. (1993), “Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem,” Annals of Operations Research, Vol. 41, pp. 421–451.
32. Pankratz, Giselher (2005), “Dynamic Vehicle Routing by Means of a Genetic Algorithm,” International Journal of Physical Distribution and Logistics Management, Vol. 35, No. 5, pp. 362–384.
33. Reimann, Marc, Karl F. Doerner, and Richard F. Hartl (2004), “D-ants: Savings Based Ants Divide and Conquer the Vehicle Routing Problem,” Computers & Operations Research, Vol. 31, No. 4, pp. 563–591.
34. Reimann, Marc and Marco Laumanns (2006), “Savings Based Ant Colony Optimization for the Capacitated Minimum Spanning Tree Problem,” Computers & Operations Research, Vol. 33, No. 6, pp. 1794–1822.
35. Reimann, Marc and Heinz Ulrich (2006), “Comparing Backhauling Strategies in Vehicle Routing using Ant Colony Optimization,” Central European Journal of Operations Research, Vol. 14, No. 2, pp. 105–123.
36. Shyu, Shyong and Bertrand M. T. Lin (2004), “Application of Ant Colony Optimization for No-wait Flowshop Scheduling Problem to Minimize the Total Completion Time,” Computers & Industrial Engineering, Vol. 47, No. 2/3, pp. 181–193.
37. Tarasewich, Peter and Patrick R. McMullen (2002), “Swarm Intelligence: Power in Numbers,” Communications of the ACM, Vol. 45, No. 8, pp. 62–67.