Skip to main content
SpringerLink
Log in

Rank-Based Ant System to Solve the Undirected Rural Postman Problem

  • Conference paper
Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living (IWANN 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5518))

Included in the following conference series:

Abstract

Ant-based algorithms constitute a metaheuristic successfully applied to solve combinatorial optimization problems. This paper presents the computational results of the application of an ants-algorithm, called the Rank-Based Ant System, to solve the Undirected Rural Postman Problem. Because this is a NP-hard problem, several approximate methods have been proposed to solve it. The results reported in this paper improve some of the ones reached by other approximate methods applied to the problem.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Orloff, C.S.: A Fundamental Problem in Vehicle Routing. Networks 4, 35–64 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  2. 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  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. Ghiani, G., Improta, G.: The Laser-plotter Beam Routing Problem. J. Oper. Res. Soc. 52(8), 945–951 (2001)

    Article  MATH  Google Scholar 

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

    Google Scholar 

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

  7. Ghiani, G., Laporte, G.: A Branch-and-cut Algorithm for the Undirected Rural Postman Problem. Math. Programming 87(3), 467–481 (2000)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  9. Lenstra, J.K., Rinnooy-Kan, A.H.G.: On the General Routing Problem. Networks 6(3), 273–280 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  10. Chistofides, N., Campos, V., Corberán, A., Mota, E.: An Algorithm for the Rural Postman Problem on a Directed Graph. Math. Programming Stud. 26, 155–166 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  11. Chistofides, N., Mingozzi, A., Toth, P.: Exact Algorithms for the Vehicle Routing Problem Based on Spanning Tree and Shortest Path Relaxations. Math. Programming 20(1), 255–282 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  12. Fernández, E., Meza, O., Garfinkel, R., Ortega, M.: On the Undirected Rural Postman Problem: Tight bounds based on a new formulation. Oper. Res. 51(2), 281–291 (2003)

    Article  MathSciNet  MATH  Google Scholar 

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

  14. Ghiani, G., Laganà, D., Musmanno, R.: A Constructive Heuristic for the Undirected Rural Postman Problem. Comput. Oper. Res. 33(12), 3450–3457 (2006)

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  16. Hertz, A., Laporte, G., Nanchen-Hugo, P.: Improvement Procedures for the Undirected Rural Postman Problem. INFORMS J. on Computing 11(1), 53–62 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  17. Pearn, W.L., Wu, C.M.: Algorithms for the Rural Postman Problem. Comput. Oper. Res. 22, 815–828 (1995)

    MATH  Google Scholar 

  18. Baldoquín, M.G.: Heuristics and Metaheuristics Approaches Used to Solve the Rural Postman Problem: a Comparative Case Study. In: Fourth International ICSC Symposium on Engineering of Intelligent Systems, Madeira, Portugal (2004)

    Google Scholar 

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

    Google Scholar 

  20. Kang, M.-J., Han, C.-G.: Solving the Rural Postman Problem Using a Genetic Algorithm with a Graph Transformation. Technical report, 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. Pérez-Delgado, M.L.: A Solution to the Rural Postman Problem Based on Artificial Ant Colonies. In: Borrajo, D., Castillo, L., Corchado, J.M. (eds.) CAEPIA 2007. LNCS, vol. 4788, pp. 220–228. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  23. Pérez-Delgado, M.L., Matos-Franco, J.C.: Self-organizing Feature Maps to Solve the Undirected Rural Postman Problem. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds.) EUROCAST 2007. LNCS, vol. 4739, pp. 804–811. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  24. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)

    MATH  Google Scholar 

  25. Deneubourg, J.-L., Aron, S., Goss, S., Pasteels, J.-M.: The Self-organizing Exploratory Pattern of the Argentine Ant. Journal of Insect Behaviour 3, 159–168 (1990)

    Article  Google Scholar 

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

  27. Bullnheimer, B., Hartl, R.F., Strauss, C.: A New Rank-based Version of the Ant System: A Computational Study. Central European Journal for Operations Research and Economics 7(1), 25–38 (1999)

    MathSciNet  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. Graduate School of Engineering, Osaka Prefecture University, Osaka, Japan

    Sigeru Omatu

  2. Department of Informatics / CCTC, University of Minho, Braga, Portugal

    Miguel P. Rocha

  3. MAmI Research Lab, University of Castilla-La Mancha,, Ciudad Real, Spain

    José Bravo

  4. Department of Informatics, University of Vigo, Ourense, Spain

    Florentino Fernández

  5. Grupo de Investigación GICAP, Área de Lenguajes Higher Polytechnic School, Universidad de Burgos, Burgos, Spain

    Emilio Corchado

  6. Higher Polytechnic School, University of Burgos, Burgos, Spain

    Andrés Bustillo

  7. Department of Informatics, University of Salamanca, Salamanca, Spain

    Juan M. Corchado

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pérez-Delgado, M.L. (2009). Rank-Based Ant System to Solve the Undirected Rural Postman Problem. In: Omatu, S., et al. Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living. IWANN 2009. Lecture Notes in Computer Science, vol 5518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02481-8_74

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02481-8_74

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02480-1

  • Online ISBN: 978-3-642-02481-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation