Skip to main content
SpringerLink
Log in

Self-organizing Feature Maps to Solve the Undirected Rural Postman Problem

  • Conference paper
Computer Aided Systems Theory – EUROCAST 2007 (EUROCAST 2007)

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

Included in the following conference series:

Abstract

The Rural Postman Problem consists of finding a shortest tour containing all edges in a subset, in the subgraph induced by some subset of nodes. In general, the problem is NP-hard, since the Traveling Salesman Problem can be easily transformed into it. The Traveling Salesman Problem consist of finding a shortest closed tour which visits all the cities in a given set. Artificial Neural Networks have been applied to solve the Traveling Salesman Problem in the last years. In this work we propose to apply self-organizing feature maps to solve the first problem, transforming it previously into the second.

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  MATH  MathSciNet  Google Scholar 

  2. Eiselt, H.A., Gendreau, M., Laporte, G.: Arc Routing Problems, Part II: The Rural Postman Problem. Operations Research 43, 399–414 (1995)

    MATH  MathSciNet  Google Scholar 

  3. Grötschel, M., Jünger, M., Reinelt, G.: Optimal Control of Plotting and Drilling Machines: a Case Study. Mathematical Methods of Operations Research 35, 61–84 (1991)

    Article  MATH  Google Scholar 

  4. Ghiani, G., Improta, G.: The Laser-Plotter Beam Routing Problem. Journal of the Operational Research Society 52, 945–951 (2001)

    Article  MATH  Google Scholar 

  5. Lenstra, J.K., Rinnooy-Kan, A.H.G.: On General Routing Problems. Networks 6, 273–280 (1976)

    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. John Wiley and Sons, Chichester (1985)

    MATH  Google Scholar 

  7. Pérez-Delgado, M.L.: Los Mapas de Rasgos Auto-Organizativos y el Problema del Viajante de Comercio. Ediciones Universidad de Salamanca, Spain (2004)

    Google Scholar 

  8. Pérez-Delgado, M.L.: Sistemas Multiagente para la Resolución del Problema del Viajante de Comercio. IEEE Latin America Transactions 2(1) (2004)

    Google Scholar 

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

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

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

    Google Scholar 

  13. Frederickson, G.: Approximation Algorithms for some Postman Problems. Journal of the ACM 26, 538–554 (1979)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  15. Baldoquín, M.G.: Heuristics and Metaheuristics Approaches Used to Solve the Rural Postman Problem: A Comparative Case Study. Dpto. Matemática General, Facultad Ing. Industrial, Universidad Técnica de La Habana, Cuba

    Google Scholar 

  16. Kohonen, T.: Self-Organization and Associative Memory. Springer Series in Information Sciences, vol. 8. Springer, Heidelberg (1982)

    Google Scholar 

  17. Gendreau, M., Hertz, A., Laporte, G.: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem. Operations Research 40, 1086–1094 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  18. Pérez-Delgado, M.L., Calvo, J., Matos-Franco, J.C., Pérez-Iglesias, J.L.: The Undirected Rural Postman Problem Solved by Artificial Ants. In: Proc. 11th International Conference on Computer Aided Systems Theory, Las Palmas de Gran Canaria. Spain, pp. 279–280 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidad de Salamanca, Av. Requejo, 33, C.P. 49022, Zamora, Spain

    M. L. Pérez-Delgado & J. C. Matos-Franco

Authors
  1. M. L. Pérez-Delgado
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. C. Matos-Franco
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Roberto Moreno Díaz Franz Pichler Alexis Quesada Arencibia

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pérez-Delgado, M.L., Matos-Franco, J.C. (2007). Self-organizing Feature Maps to Solve the Undirected Rural Postman Problem. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2007. EUROCAST 2007. Lecture Notes in Computer Science, vol 4739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75867-9_101

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75867-9_101

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75866-2

  • Online ISBN: 978-3-540-75867-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation