Skip to main content
SpringerLink
Log in

Ant Colony Optimization for the Maximum Edge-Disjoint Paths Problem

  • Conference paper
Applications of Evolutionary Computing (EvoWorkshops 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3005))

Included in the following conference series:

Abstract

Given a graph G representing a network topology, and a collection T={(s 1,t 1)...(s k ,t k )} of pairs of vertices in G representing connection request, the maximum edge-disjoint paths problem is an NP-hard problem which consists in determining the maximum number of pairs in T that can be routed in G by mutually edge-disjoint s i -t i paths. We propose an Ant Colony Optimization (aco) algorithm to solve this problem. aco algorithms are inspired by the foraging behavior of real ants, whose distributed nature makes them suitable for the application in network environments. Our current version is aimed for the application in static graphs. In comparison to a multi-start greedy approach, our algorithm has advantages especially when speed is an issue.

Partially supported by the FET Programme of the EU under contract number IST-2001-33116 (FLAGS), and by the Spanish CICYT projects TIC-2001-4917-E and TIC-2002-04498-C05-03 (TRACER). M. Blesa acknowledges support by the Catalan Research Council of the Generalitat de Catalunya (grant no. 2001FI-00659). C. Blum acknowledges support by the Metaheuristics Network, a Research Training Network funded by the Improving Human Potential program of the CEC, grant HPRN-CT-1999-00106. The information provided is the sole responsibility of the authors and does not reflect the Community’s opinion. The Community is not responsible for any use that might be made of data appearing in this publication.

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. Karp, R.: Reducibility among combinatorial problems. In: Compexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)

    Google Scholar 

  2. Awerbuch, B., Gawlick, R., Leighton, F., Rabani, Y.: On-line admission control and circuit routing for high performance computing and communication. In: 35th IEEE Symposium on Foundations of Computer Science, pp. 412–423 (1994)

    Google Scholar 

  3. Raghavan, P., Upfal, E.: Efficient all-optical routing. In: 26th Annual ACM Symposium on Theory of Computing, pp. 134–143 (1994)

    Google Scholar 

  4. Aggarwal, A., Bar-Noy, A., Coppersmith, D., Ramaswami, R., Schieber, B., Sudan, M.: Efficient routing and scheduling algorithms for optical networks. In: 5th ACM-SIAM Symposium on Discrete Algorithms, pp. 412–423 (1994)

    Google Scholar 

  5. Hromkovič, J., Klasing, R., Stöhr, E., Wagener, H.: Gossiping in vertex-disjoing paths mode in d-dimensional grids and planar graphs. In: Lengauer, T. (ed.) ESA 1993. LNCS, vol. 726, pp. 200–211. Springer, Heidelberg (1993)

    Google Scholar 

  6. Sidhu, D., Nair, R., Abdallah, S.: Finding disjoint paths in networks. ACM SIGCOMM Computer Communication Review 21(4), 43–51 (1991)

    Article  Google Scholar 

  7. Dorigo, M., Di Caro, G., Gambardella, L.: Ant algorithms for discrete optimization. Artificial Life 5(2), 137–172 (1999)

    Article  Google Scholar 

  8. Di Caro, G., Dorigo, M.: AntNet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research 9, 317–365 (1998)

    MATH  Google Scholar 

  9. Kleinberg, J.: Approx. algorithms for disjoint paths problems. PhD thesis (1996)

    Google Scholar 

  10. Gambardella, L.M., Taillard, E.D., Agazzi, G.: New Ideas in Optimization, pp. 63–76. McGraw-Hill, London (1999)

    Google Scholar 

  11. Dorigo, M., Gambardella, L.: Ant Colony System: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)

    Article  Google Scholar 

  12. Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics - Part B (2004) (to appear)

    Google Scholar 

  13. Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: Boston University Representative Internet Topoloy Generator (2001), http://cs-pub.bu.edu/brite/

  14. Waxman, B.: Routing of multipoint connections. IEEE Journal on Selected Areas in Communications 6(9), 1622–1671 (1988)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, E-08034, Barcelona, Spain

    Maria Blesa

  2. Université Libre de Bruxelles IRIDIA, B-1050, Brussels, Belgium

    Christian Blum

Authors
  1. Maria Blesa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Blum
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Graphics and Algorithms, Vienna University of Technology, Favoritenstraße 9–11/1861, 1040, Vienna, Austria

    Günther R. Raidl

  2. Dipartimento di Ingegneria dell’Informazione, Università di Parma,  

    Stefano Cagnoni

  3. Institute AIFB, University of Karlsruhe, 76128, Karlsruhe, Germany

    Jürgen Branke

  4. School of Mathematical and Computer Science, Heriot-Watt University, EH14 8AS, Edinburgh, UK

    David Wolfe Corne

  5. Institute of Computer Science, University of Bremen, 28359, Bremen, Germany

    Rolf Drechsler

  6. Honda Research Institute Europe GmbH, Offenbach/Main, Germany

    Yaochu Jin

  7. Computing Laboratory, University of Kent, Canterbury, UK

    Colin G. Johnson

  8. CISUC, Department of Informatics Engineering, University of Coimbra, Polo II of the University of Coimbra, 3030, Coimbra, Portugal

    Penousal Machado

  9. ICIS, Radboud University Nijmegen, The Netherlands

    Elena Marchiori

  10. Johannes Gutenberg University, Mainz, Germany

    Franz Rothlauf

  11. School of Computing Sciences, UEA Norwich, University of East Anglia, NR4 7TJ, Norwich, UK

    George D. Smith

  12. Dipartimento di Automatica e Informatica, Politecnico di Torino, Italy

    Giovanni Squillero

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blesa, M., Blum, C. (2004). Ant Colony Optimization for the Maximum Edge-Disjoint Paths Problem. In: Raidl, G.R., et al. Applications of Evolutionary Computing. EvoWorkshops 2004. Lecture Notes in Computer Science, vol 3005. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24653-4_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24653-4_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21378-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation