Skip to main content
SpringerLink
Log in

Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem

  • Conference paper
Parallel Problem Solving from Nature, PPSN XI (PPSN 2010)

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

Included in the following conference series:

Abstract

The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting networks where quality of service constraints are of concern. We present two new approaches to solve this problem heuristically following the concepts of ant colony optimization (ACO) and variable neighborhood search (VNS). The ACO uses a fast construction heuristic based on node delays and local improvement exploiting two different neighborhood structures. The VNS employs the same neighborhood structures but additionally applies various kinds of shaking moves. Experimental results indicate that both metaheuristics outperform existing approaches whereas the ACO produces mostly the best solutions.

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. Dahl, G., Gouveia, L., Requejo, C.: On formulations and methods for the hop-constrained minimum spanning tree problem. In: Handbook of Optimization in Telecommunications, pp. 493–515. Springer Science + Business Media (2006)

    Google Scholar 

  2. Gouveia, L., Paias, A., Sharma, D.: Modeling and Solving the Rooted Distance-Constrained Minimum Spanning Tree Problem. Computers and Operations Research 35(2), 600–613 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  3. Gilbert, E.N., Pollak, H.O.: Steiner minimal trees. SIAM Journal on Applied Mathematics 16(1), 1–29 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  4. Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal 36, 1389–1401 (1957)

    Google Scholar 

  5. Salama, H.F., Reeves, D.S., Viniotis, Y.: The Delay-Constrained Minimum Spanning Tree Problem. In: Blum, C., Roli, A., Sampels, M. (eds.) Proceedings of the 2nd IEEE Symposium on Computers and Communications, pp. 699–703 (1997)

    Google Scholar 

  6. Ruthmair, M., Raidl, G.R.: A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) EUROCAST 2009. LNCS, vol. 5717, pp. 713–720. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  7. Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematics Society 7(1), 48–50 (1956)

    Article  MathSciNet  MATH  Google Scholar 

  8. Skorin-Kapov, N., Kos, M.: A GRASP heuristic for the delay-constrained multicast routing problem. Telecommunication Systems 32(1), 55–69 (2006)

    Article  Google Scholar 

  9. Xu, Y., Qu, R.: A GRASP approach for the Delay-constrained Multicast routing problem. In: Proceedings of the 4th Multidisplinary International Scheduling Conference (MISTA4), Dublin, Ireland, pp. 93–104 (2009)

    Google Scholar 

  10. Ghaboosi, N., Haghighat, A.T.: A Path Relinking Approach for Delay-Constrained Least-Cost Multicast Routing Problem. In: 19th IEEE International Conference on Tools with Artificial Intelligence, pp. 383–390 (2007)

    Google Scholar 

  11. Qu, R., Xu, Y., Kendall, G.: A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing. In: Proceedings of Learning and Intelligent OptimizatioN (LION3), pp. 15–29. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Leggieri, V., Haouari, M., Triki, C.: The Steiner Tree Problem with Delays: A Tight Compact Formulation and Reduction Procedures. Technical report, Universita del Salento, Lecce, Italy (2010)

    Google Scholar 

  13. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  14. Gouveia, L.: Multicommodity flow models for spanning trees with hop constraints. European Journal of Operational Research 95, 178–190 (1996)

    Article  MATH  Google Scholar 

  15. Hansen, P., Mladenović, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research 130(3), 449–467 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  16. Stützle, T., Hoos, H.: MAX–MIN ant system. Future Generation Computer Systems 16, 889–914 (2000)

    Article  Google Scholar 

  17. Duff, I., Erisman, A., Reid, J.: Direct methods for sparse matrices. Oxford University Press, USA (1989)

    MATH  Google Scholar 

  18. Gruber, M., van Hemert, J., Raidl, G.R.: Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACO. In: Proceedings of the Genetic and Evolutionary Computation Conference, vol. 2, pp. 1187–1194. ACM, New York (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria

    Mario Ruthmair & Günther R. Raidl

Authors
  1. Mario Ruthmair
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Günther R. Raidl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Electrical Engineering, Automatics, Computer Science and Electronics, Department of ComputerScience, AGH University of Science and Technology, Mickiewicza 30, 30-059, Kraków, Poland

    Robert Schaefer

  2. Departamento de Lenguajes y Ciencias de la Computación, ETSI Informática, Universidad de Málaga, Campus Teatinos, 29071, Málaga, Spain

    Carlos Cotta

  3. Department of Mathematics and Computer Science, University of Bielsko-Biala, Willowa 2, 43-309, Bielsko-Biala, Poland

    Joanna Kołodziej

  4. Fakultät für Informatik, Technische Universität Dortmund, 44221, Dortmund, Germany

    Günter Rudolph

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ruthmair, M., Raidl, G.R. (2010). Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds) Parallel Problem Solving from Nature, PPSN XI. PPSN 2010. Lecture Notes in Computer Science, vol 6239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15871-1_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15871-1_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15870-4

  • Online ISBN: 978-3-642-15871-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation