Skip to main content
SpringerLink
Log in

Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design

  • Conference paper
Book cover Parallel Problem Solving from Nature - PPSN XII (PPSN 2012)

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

Included in the following conference series:

Abstract

We introduce the Three-Layer Hierarchical Ring Network Design Problem, which arises especially in the design of large telecommunication networks. The aim is to connect nodes that are assigned to three different layers using rings of bounded length. We present tailored Variable Neighborhood Search (VNS) and GRASP approaches to solve large instances of this problem heuristically, and discuss computational results indicating the VNS’ superiority.

This work has been funded by the Vienna Science and Technology Fund (WWTF) through project ICT10-027.

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. Concorde TSP Solver, www.tsp.gatech.edu/concorde.html , (accessed: February 02, 2012)

  2. Aringhieri, R., Dell’ Amico, M.: Comparing Metaheuristic Algorithms for Sonet Network Design Problems. Journal of Heuristics 11, 35–57 (2005)

    Article  MATH  Google Scholar 

  3. Balakrishnan, A., Magnanti, T.L., Mirchandani, P.: The Multi-level Network Design Problem. Tech. rep., Massachusetts Institute of Technology, Cambridge (1991)

    Google Scholar 

  4. Baldacci, R., Dell’Amico, M., Gonzalez, J.S.: The Capacitated m-Ring-Star Problem. Operations Research 55(6), 1147–1162 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Current, J.R., ReVelle, C.S., Cohon, J.L.: The hierarchical network design problem. European Journal of Operational Research 27(1), 57–66 (1986)

    Article  MATH  Google Scholar 

  6. Dreyfus, S.E., Wagner, R.A.: The Steiner Problem in Graphs. Networks 1, 195–207 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gendreau, M., Potvin, J.Y. (eds.): Handbook of Metaheuristics, International Series in Operations Research & Management Science, vol. 146. Springer (2010)

    Google Scholar 

  8. Hansen, P., Mladenović, N., Brimberg, J., Pérez, J.A.M.: Variable Neighborhood Search. In: Gendreau and Potvin [7], pp. 61–86

    Google Scholar 

  9. Potvin, J.Y., Rousseau, J.M.: An Exchange Heuristic for the for the Routing Problems with Time Windows. Journal of the Operational Research Society 46, 1433–1446 (1995)

    MATH  Google Scholar 

  10. Resende, M.G., Ribeiro, C.C.: Greedy Randomized Adaptive Search Procedures: Advances, Hybridizations, and Applications. In: Gendreau and Potvin [7], pp. 283–320

    Google Scholar 

  11. Schwengerer, M., Pirkwieser, S., Raidl, G.R.: A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem. In: Hao, J.-K., Middendorf, M. (eds.) EvoCOP 2012. LNCS, vol. 7245, pp. 13–24. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  12. Thomadsen, T., Stidsen, T.: Hierarchical Ring Network Design Using Branch-and-Price. Telecommunication Systems 29(1), 61–76 (2005)

    Article  Google Scholar 

  13. Trampont, M., Destré, C., Faye, A.: Solving a hierarchical network design problem with two stabilized column generation approaches. In: International Network Optimization Conference 2009, Pisa, Italy (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Christian Schauer & Günther R. Raidl

Authors
  1. Christian Schauer
    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. Centro de Investigacion y de Estudios, Avanzados del Instituto Politecnico Nacional (CINVESTAV-IPN), Departmento de Computation, Av. IPN No. 2508, Col. San Pedro Zacatenco, 0360, Mexico, D.F., Mexico

    Carlos A. Coello Coello

  2. Department of Mathematics and Computer Science, University of Catania, V.le A. Doria 6, 95125, Catania, Italy

    Vincenzo Cutello  & Mario Pavone  & 

  3. Kanpur Genetic Algorithms Laboratory (KanGAL), Indian Institute of Technology, Kanpur, Kanpur, India

    Kalyanmoy Deb

  4. Department of Computer Science, University of New, Mexico, USA

    Stephanie Forrest

  5. Department of Mathematics and Computer Science, University of Catania, Viale A. Doria 6, 95125, Catania, Italy

    Giuseppe Nicosia

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schauer, C., Raidl, G.R. (2012). Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds) Parallel Problem Solving from Nature - PPSN XII. PPSN 2012. Lecture Notes in Computer Science, vol 7491. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32937-1_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32937-1_46

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation