Advertisement

An Ant System Algorithm for the Mixed Vehicle Routing Problem with Backhauls

  • Anne Wade
  • Said Salhi
Part of the Applied Optimization book series (APOP, volume 86)

Abstract

Ant system algorithms have been used successfully to solve many hard combinatorial problems. In this paper we introduce an ant system method to solve the mixed vehicle routing problem with backhauls. Some enhancements to the general characteristics of ant system algorithms are proposed. We concentrate on the way the candidate list is constructed, a look ahead scheme to incorporate into the visibility function and efficient rules to deal with local as well as global updating. Computational results on test problems are reported and compared to known results.

Keywords

Metaheuristic Ant system Vehicle routing Backhauls. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. E. Bonabaeu, M. Dorigo, and G. Theraulaz. Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, 1999.Google Scholar
  2. B. Bullnheimer, R. Hartl, and C. Strauss. An Improved Ant System Algorithm for the Vehicle Routing Problem. Technical Report POM-10/97, Institute of Management Science, University of Vienna, 1997.Google Scholar
  3. B. Bullnheimer, R. Hartl, and C. Strauss. Applying the Ant System to the Vehicle Routing Problem. In I. Osman, S. Voss, S. Martello, and C. Roucairol, editors, Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization, pages 109–120. Kluwer Academics, 1998.Google Scholar
  4. O. Casco, B. Golden, and E. Wasil. Vehicle Routing with Backhauls: Models, Algorithms and Case Studies. In B. Golden and A. Assad, editors, Vehicle Routing: Methods and Studies, pages 127–147. North Holland, Amsterdam, 1988.Google Scholar
  5. A. Colorni, M. Dorigo, and V. Maniezzo. Distributed Optimization by Ant Colonies. In F. Varela and P. Bourgine, editors, Proceedings of the European Conference on Artificial Life, pages 134–142. Elsevier Publishing, Amsterdam, 1991.Google Scholar
  6. O. Cordon, I. Fernandez de Viana, F. Herrera, and L. Moreno. A New ACO Model Integrating Evolutionary Computation Concepts: The Best-Worst Ant System. In M. Dorigo, M. Middendorf, and T. Stützle, editors, Abstract Proceedings of ANTS2000- From Ant Colonies to Artificial Ants: A Series of International Workshops on Ant Algorithms, pages 22–29. Université Libre de Bruxelles, Belgium, 2000.Google Scholar
  7. I. Deif and L. Bodin. Extension of the Clarke and Wright Algorithm for Solving the Vehicle Routing Problem with Backhauls. In A. E. Kidder, editor, Proceedings of the Babson Conference on Software Uses in Transportation and Logistics Managemant, pages 75–96, 1984.Google Scholar
  8. M. Dorigo. Optimization, Learning and Natural Algorithms. PhD thesis, Politecnico di Milano, Italy, 1992.Google Scholar
  9. M. Dorigo, G. Caro, and L. Gambardella Ant Algorithms for Discrete Optimization. Artificial Life, 5 (3): 137–172, 1999.CrossRefGoogle Scholar
  10. M. Dorigo and L. Gambardella. Ant Colony System: A Cooperative Learning Approach to the Travelling Salesman Problem. IEEE Transactions on Evolutionary Computation, 1 (1): 53–66, 1997.CrossRefGoogle Scholar
  11. M. Dorigo, V. Maniezzo, and A. Colorni. The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions Systems, Man, and Cybernetics- Part B, 26 (1): 29–41, 1996.CrossRefGoogle Scholar
  12. M. Dorigo and T. Stützle. The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances. Technical Report IRIDIA-2000–32, Université Libre de Bruxelles, Belgium, 2000.Google Scholar
  13. L. Gambardella and M. Dorigo. HAS-SOP: An Hybrid Ant System for the Sequential Ordering Problem. Technical Report 11–97,IDSIA, Lugano, Switzerland,1997.Google Scholar
  14. L. Gambardella, E. Taillard, and G. Agazzi. MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 63–76. McGraw Hill, London, 1999.Google Scholar
  15. M. Carey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP Completeness. Freeman, San Francisco, 1979.Google Scholar
  16. M. Gendreau, G. Laporte, and D. Vigo. Heuristics for the Travelling Salesman Problem with Pickup and Delivery. Computers and Operations Research, 26: 699–714, 1999.zbMATHCrossRefGoogle Scholar
  17. M. Goetschalckx and C. Jacobs-Blecha. The Vehicle Routing Problem with Backhauls. European Journal of Operational Reasearch, 42: 39–51, 1989.MathSciNetCrossRefGoogle Scholar
  18. K. Halse. Modelling and Solving Complex Vehicle Routing Problems. PhD thesis, The Technical University of Denmark, 1992.Google Scholar
  19. V. Maniezzo. Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem. Informs Journal of Computing, 11 (4): 358–369, 1999.MathSciNetzbMATHCrossRefGoogle Scholar
  20. V. Maniezzo and A. Colorni. The Ant System applied to the Quadratic Assignment Problem. IEEE Trans. Knowledge and Data Engineering, 1998.Google Scholar
  21. A. Mingozzi, S. Giorgi, and R. Baldacci. An Exact Method for the Vehicle Routing Problem with Backhauls. Transportation Science, 33 (3): 315–329, 1999.zbMATHCrossRefGoogle Scholar
  22. I.H. Osman and N.A. Wassan. A reactive tabu search meta-heuristic for the vehicle routing problem with backhauling. Computers and Operations Research (to appear), 5, 2002.Google Scholar
  23. S. Salhi and G. Nagy. A Cluster Insertion Heuristic for the Single and Multiple Depot Vehicle Routing Problems with Backhauls. Journal of the Operational Research Society, 50 (10): 1034–1042, 1999.zbMATHGoogle Scholar
  24. S. Saihi and G. Rand. Improvements to Vehicle Routing Heuristics. Journal of the Operational Research Society, 38: 293–295, 1987.Google Scholar
  25. T. Stützle and H. Hoos. Improvements on the Ant System: Introducing MAX-MIN Ant System. In Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms, pages 245–249. Springer Verlag, Wien, 1997a.Google Scholar
  26. T. Stützle and H. Hoos. The MAX-MIN Ant System and Local Search for the Travelling Salesman Problem. In T. Baeck, Z. Michalewicz, and X. Yao, editors, Proceedings of IEEE-ICEC-EPS’97, IEEE International Conference on Evolutionary Computation and Evolutionary Programming Conference, pages 309–314. IEEE Press, 1997b.Google Scholar
  27. P. Toth and D. Vigo. A Heuristic Algorithm for the Vehicle Routing Problem with Backhauls. In Advanced Methods in Transportation Analysis, pages 585608. Springer Verlag, Berlin, 1996.Google Scholar
  28. P. Toth and D. Vigo. An Exact Algorithm for the Vehicle Routing Problem with Backhauls. Transportation Science, 31 (4): 372–385, 1997.zbMATHCrossRefGoogle Scholar
  29. A.C. Wade. Constructive and Ant System heuristics for a class of VRP with Back-hauls. PhD thesis, University of Birmingham, 2002.Google Scholar

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Anne Wade
    • 1
  • Said Salhi
    • 1
  1. 1.Management Mathematics Group School of Mathematics and StatisticsThe University of BirminghamUK

Personalised recommendations