Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Solving the General Routing Problem by Artificial Ants

  • Conference paper
Distributed Computing and Artificial Intelligence

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 79))

  • 1370 Accesses

Abstract

Routing Problems arise in several areas of distribution management and logistics and their practical significance is widely known. These problems are usually difficult to solve. Therefore, heuristic methods are applied to try to solve them. This paper describes the application of artificial ant colonies to solve the General Routing Problem. For this, the problem is first transformed into a node-routing problem. The transformed problem is solved by applying an ant-based algorithm which has been widely applied to node-routing problems, obtaining good results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 469.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 599.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Assard, A.A., Golden, B.L.: Arc routing methods and applications. In: Ball, M.G., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Routing. Handbooks in Operations Research and Management Science, vol. 8, pp. 375–483. Elsevier, Amsterdam (1995)

    Chapter  Google Scholar 

  2. Blais, M., Laporte, G.: Exact solution of the generalized routing problem through graph transformations. The J. of the Oper. Res. Soc. 54, 906–910 (2003)

    Article  MATH  Google Scholar 

  3. Corberán, A., Letchford, N., Sanchís, J.M.: A cutting plane algorithm for the general routing problem. Math. Program. Ser. A 90, 291–316 (2001)

    Article  MATH  Google Scholar 

  4. Corberán, A., Sanchís, J.M.: The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra. Eur. J. Oper. Res. 108(3), 538–550 (1998)

    Article  MATH  Google Scholar 

  5. Cornuejols, G., Fonlupt, J., Naddef, D.: The traveling salesman on a graph and some related integer polyhedra. Math. Program. 33, 1–27 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  6. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.): The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons, New York (1985)

    MATH  Google Scholar 

  7. Dorigo, M, Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IRIDIA. 96-05. Université Libre de Bruxelles (1996)

    Google Scholar 

  8. Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: an atocatalytic optimizing process. Dipartamento di Electtronica e Informazione - Politecnico di Milano, Italia (1991)

    Google Scholar 

  9. Dror, M.: Arc Routing: Theory, Solutions and Applications. Kluwer Academic Publishers, Boston (2000)

    MATH  Google Scholar 

  10. Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, Part I: The chinese postman problem. Oper. Res. 43(3), 231–244 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  11. Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, Part II: The rural postman problem. Oper. Res. 43(3), 399–414 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  12. Fleischmann, B.: A cutting-plane procedure for the travelling salesman on a road network. Eur. J. Oper. Res. 21, 307–317 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  13. Jansen, K.: An approximation algorithm for the general routing problem. Inf. Proc. Letts 41, 333–339 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  14. Laporte, G.: The traveling salesman problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(2), 231–247 (1992)

    Article  MATH  Google Scholar 

  15. Laporte, G., Nobert, Y.: Generalized traveling salesman through n sets of nodes: an integer programming approach. INFOR 21, 61–75 (1983)

    MATH  Google Scholar 

  16. Lenstra, J.K., Rinnooy Kan, A.H.G.: On general routing problems. Networks 6, 273–380 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  17. Letchford, A.N.: New inequalities for the general routing problem. Eur. J. Oper. Res. 96(2), 317–322 (1997)

    Article  MATH  Google Scholar 

  18. Letchford, A.N.: The general routing polyhedron: A unifying framework. Eur. J. Oper. Res. 112(1), 122–133 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  19. Noon, C.E., Bean, J.C.: An efficient transformation of the generalized traveling salesman problem. INFOR 31, 39–43 (1993)

    MATH  Google Scholar 

  20. Orloff, C.S.: A Fundamental Problem in Vehicle Routing. Networks 4, 35–64 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  21. Orloff, C.S.: On general routing problems. Networks 6, 281–284 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  22. Orloff, C.S., Caprera, D.: Reduction and solution of large scale vehicle routing problems. Transp. Sci. 19, 361–373 (1976)

    Article  Google Scholar 

  23. Reinelt, G., Theis, D.O.: On the general routing polytope. Discrete Applied Mathematics 156, 368–384 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  24. Stützle, T., Hoos, H.: MAX-MIN ant system. Futur. Gener. Comput. Syst. 16(8), 889–914 (2000)

    Article  Google Scholar 

  25. Stützle, T., Hoos, H.: Improving the ant-system: A detailed report on the MAX-MIN ant system. AIDA-96-12. FG Intellektik, TH Darmstadt (1996)

    Google Scholar 

  26. Stützle, T., Hoos, H.: The MAX-MIN ant system and local search for the traveling salesman problem. In: Baeck, T., Michalewicz, Z., Yao, X. (eds.) Proc. of the IEEE Int. Conf. on Evol. Comput., pp. 309–314 (1997)

    Google Scholar 

  27. Stützle, T.: A short convergence proof for a class of ant colony optimization algorithms. IEEE Trans. Evol. Comput. 6(4), 358–365 (2002)

    Article  Google Scholar 

  28. Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia (2002)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Escuela Politécnica Superior de Zamora, Universidad de Salamanca, Av. Requejo, 33, C.P. 49022, Zamora, Spain

    María-Luisa Pérez-Delgado

Authors
  1. María-Luisa Pérez-Delgado
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Sao Paulo at Sao Carlos, Sao Carlos, SP, Brazil

    Andre Ponce de Leon F. de Carvalho

  2. Department of Computing, Science and Control, Faculty of Science, University of Salamanca, Plaza de la Merced S/N, 37008, Salamanca, Spain

    Sara Rodríguez-González

  3. Department of Computing, Science and Control, Faculty of Science, University of Salamanca, Plaza de la Merced S/N, 37008, Salamanca, Spain

    Juan F. De Paz Santana  & Juan M. Corchado Rodríguez  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pérez-Delgado, ML. (2010). Solving the General Routing Problem by Artificial Ants. In: de Leon F. de Carvalho, A.P., Rodríguez-González, S., De Paz Santana, J.F., Rodríguez, J.M.C. (eds) Distributed Computing and Artificial Intelligence. Advances in Intelligent and Soft Computing, vol 79. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14883-5_81

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14883-5_81

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14882-8

  • Online ISBN: 978-3-642-14883-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation