Skip to main content
Springer Nature Link
Log in

Solving an Arc-Routing Problem Using Artificial Ants with a Graph Transformation

  • Conference paper
Advances in Practical Applications of Agents and Multiagent Systems

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

  • 637 Accesses

Abstract

In a recent paper artificial ants were applied to solve the Undirected Rural Postman Problem. The problem was transformed into a Traveling Salesman Problem and artificial ants were applied to this new problem. This paper applies another transformation, proposed by Pearn et al, which also transforms the arc-routing problem into a node routing problem.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Baldoquín, M.G., Ryan, G., Rodriguez, R., Castellini, A.: Un enfoque hibrido basado en metaheurísticas para el problema del cartero rural. In: Proc. of XI CLAIO, Concepción de Chile, Chile (2002)

    Google Scholar 

  2. Christofides, N., Campos, V., Corberán, A., Mota, E.: An algorithm for the rural postman problem. Imperial College Report, London (1981)

    Google Scholar 

  3. Corberán, A., Sanchis, J.M.: A polyhedral approach to the rural postman problem. Eur. J. Oper. Res. 79, 95–114 (1994)

    Article  MATH  Google Scholar 

  4. Dorigo, M., Gambardella, L.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53–66 (1997)

    Article  Google Scholar 

  5. Fernández, P., García Raffi, L.M., Sanchis, J.M.: A heuristic algorithm based on Monte Carlo methods for the rural postman problem. Comput. Oper. Res. 25(12), 1097–1106 (1998)

    Article  MATH  Google Scholar 

  6. Frederickson, G.: Approximation algorithms for some postman problems. J. Assoc. Comput. Mach. 26, 538–554 (1979)

    MATH  MathSciNet  Google Scholar 

  7. Ghiani, G., Laporte, G.: A branch and cut algorithm for the undirected rural postman problem. Math. Program 87, 467–481 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Golden, B.L., Wong, R.T.: Capacitated Arc Routing Problems. Networks 11, 305–315 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  9. Groves, G.W., van Vuuren, J.H.: Efficiente heuristics for the rural postman problem. Orion 21(1), 33–51 (2005)

    Google Scholar 

  10. Hertz, A., Laporte, G., Nanchen, P.: Improvement procedures for the undirected rural postman problem. INFORMS J. Comput. 1, 53–62 (1999)

    Article  Google Scholar 

  11. LenstrA, J.K., Rinnooy Kan, A.H.G.: Complexity of vehicle routing and scheduling problems. Networks 11, 221–227 (1981)

    Article  Google Scholar 

  12. Letchford, A.N.: Polyhedral results for some constrained arc routing problemas. PhD Dissertation. Lancaster University, Lancaster (1996)

    Google Scholar 

  13. Orloff, C.S.: A fundamental problem in vehicle routing. Networks 4, 35–64 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  14. 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 (LNAI), vol. 4788, pp. 220–228. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  15. Pearn, W.L., Assard, A., Golden, B.L.: Transforming arc routing into node routing problems. Comput. Oper. Res. 14(4), 285–288 (1987)

    Article  MATH  Google Scholar 

  16. Reinelt, G.: The traveling salesman problem: computational solutions for TSP applications. In: Reinelt, G. (ed.) The Traveling Salesman. LNCS, vol. 840. Springer, Heidelberg (1994)

    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. Laboratoire d’Informatique de Grenoble, Centre National de la, Recherche Scientifique,, Maison Jean Kuntzmann, 110 av. de la Chimie, F-38041, Grenoble, France

    Yves Demazeau

  2. Department of Information and Computing Sciences, Universiteit Utrecht, Centrumgebouw Noord, office A117, Padualaan 14, De Uitho, 3584CH, Utrecht, The Netherlands

    Frank Dignum

  3. Departamento de Informática, y Automática, Facultad de Ciencias, Universidad de Salamanca, Plaza de la Merced S/N, 37008, Salamanca, Spain

    Juan M. Corchado

  4. Escuela Universitaria de Informática, Universidad Pontificia de Salamanca, Compañía 5, 37002, Salamanca, Spain

    Javier Bajo Pérez

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 an Arc-Routing Problem Using Artificial Ants with a Graph Transformation. In: Demazeau, Y., Dignum, F., Corchado, J.M., Pérez, J.B. (eds) Advances in Practical Applications of Agents and Multiagent Systems. Advances in Intelligent and Soft Computing, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12384-9_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12384-9_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12383-2

  • Online ISBN: 978-3-642-12384-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics