Skip to main content
SpringerLink
Log in

A Solution to the Rural Postman Problem Based on Artificial Ant Colonies

  • Conference paper
Current Topics in Artificial Intelligence (CAEPIA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4788))

Included in the following conference series:

Abstract

The objective of this work is to apply artificial ant colonies to solve the Rural Postman Problem on undirected graphs. In order to do so, we will transform this problem into a Traveling Salesman Problem, applying to this new problem algorithms based on artificial ant colonies, which have been applied at great length to the same, 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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: an Autocatalytic Optimizing Process. Tech. Rep. 91-016, Dipartamento di Electtronica e Informazione - Politecnico di Milano. Italia, pp. 1–26 (1991)

    Google Scholar 

  2. Dorigo, M.: Optimization, Learning and Natural Algorithms. PhD Thesis, Dip. Elettronica, Politecnico di Milano (1992)

    Google Scholar 

  3. Maniezzo, V., Colorni, A., Dorigo, M.: The Ant System Applied to the Quadratic Assignment Problem. Technical Report IRIDIA/94-28, Université Libre de Bruxelles, Belgium (1994)

    Google Scholar 

  4. Maniezzo, V.: Exact and Approximate Nondeterministic Tree-search Procedures for the Quadratic Assignment Problem. Technical Report CSR 98-1, C.L. In: Science dell’Informazione, Universitá di Bologna, Italy (1998)

    Google Scholar 

  5. Bullnheimer, B., Hartl, R.F., Strauss, C.: Applying the Ant System to the Vehicle Routing Problem. Advances and Trends in Local Search Paradigms for Optimization, pp. 285–296 (1999)

    Google Scholar 

  6. Gambardella, L.M., Taillard, E., Agazzi, G.: Ant Colonies for Vehicle Routing Problems. In: Corne, E.D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, McGraw-Hill, New York (1999)

    Google Scholar 

  7. Costa, D., Hertz, A.: Ants Can Colour Graphs. Journal of the Operational Research Society 48, 295–305 (1997)

    Article  MATH  Google Scholar 

  8. Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L.: Network Models 7. North-Holland, Amsterdam (1995)

    Google Scholar 

  9. Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: Solution of a Large-scale Traveling Salesman Problem. Operations Research 2, 393–410 (1954)

    MathSciNet  Google Scholar 

  10. Reinelt, G.: The Traveling Salesman. LNCS, vol. 840. Springer, Heidelberg (1994)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  12. Frederickson, G.: Approximation Algorithms for Some Postman Problems. Journal of the Association for Computing Machinery 26, 538–554 (1979)

    MATH  MathSciNet  Google Scholar 

  13. Christofides, N., Campos, V., Corberán, A., Mota, E.: An Algorithm for the Rural Postman Problem. Imperial College Report. London (1981)

    Google Scholar 

  14. Corberán, A., Sanchis, J.M.: A Polyhedral Approach to the Rural Postman Problem. European Journal of the Operational Research 79, 95–114 (1994)

    Article  MATH  Google Scholar 

  15. Ghiani, G., Laporte, G.: A Branch and Cut Algorithm for the Undirected Rural Postman Problem. Mathematical Programming 87, 467–481 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  16. Letchford, A.N.: Polyhedral Results for Some Constrained Arc Routing Problems. PhD Dissertation, Lancaster University, Lancaster (1996)

    Google Scholar 

  17. Fernández de Córdoba, P., García Raffi, L.M., Sanchis, J.M.: A Heuristic Algorithm Based on Monte Carlo Methods for the Rural Postman Problem. Computers Ops. Res. 25(12), 1097–1106 (1998)

    Article  MATH  Google Scholar 

  18. Hertz, A., Laporte, G., Nanchen, P.: Improvement Procedures for the Undirected Rural Postman Problem. INFORMS J. Comput. 1, 53–62 (1999)

    Article  Google Scholar 

  19. Groves, G.W., van Vuuren, J.H.: Efficiente Heuristics for the Rural Postman Problem. Orion 21(1), 33–51 (2005)

    Google Scholar 

  20. Kang, M.-J., Han, C.-G.: Solving the Rural Postman Problem Using a Genetic Algorithm with a Graph Transformation. RR: Dept. of Computer Engineering, Kyung Hee University (1998)

    Google Scholar 

  21. Rodrigues, A.M., Ferreira, J.S.: Solving the Rural Postman problem by Memetic Algorithms. In: MIC 2001. 4th Metaheuristics International Conference, Porto, Portugal (2001)

    Google Scholar 

  22. Baldoquín, M.G., Ryan, G., Rodríguez, R., Castellini, A.: Un Enfoque Hibrido Basado en Metaheurísticas para el Problema del Cartero Rural. In: Proceedings of XI CLAIO, Concepción de Chile, Chile (2002)

    Google Scholar 

  23. Dorigo, M., Gambardella, L.: Ant Colony System: a Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transaction on Evolutionary Computation 1(1), 53–66 (1997)

    Article  Google Scholar 

  24. Dorigo, M., Gambardella, L.M.: Ant Colonies for the Traveling Salesman Problem. Biosystems 43, 73–81 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. 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

Daniel Borrajo Luis Castillo Juan Manuel Corchado

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pérez-Delgado, M.L. (2007). A Solution to the Rural Postman Problem Based on Artificial Ant Colonies. In: Borrajo, D., Castillo, L., Corchado, J.M. (eds) Current Topics in Artificial Intelligence. CAEPIA 2007. Lecture Notes in Computer Science(), vol 4788. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75271-4_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75271-4_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75270-7

  • Online ISBN: 978-3-540-75271-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation