Skip to main content

On the Comparison of Decoding Strategies for a Memetic Algorithm for the Multi Layer Hierarchical Ring Network Design Problem

  • Conference paper
  • First Online:
Computer Aided Systems Theory – EUROCAST 2015 (EUROCAST 2015)

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

Included in the following conference series:

  • 1512 Accesses

Abstract

We address the Multi Layer Hierarchical Ring Network Design Problem, which arises in the design of large telecommunication backbone networks. To ensure reliability for the network the nodes are assigned to different layers and connected using a hierarchy of rings of bounded length. Previously we presented a memetic algorithm that clusters the nodes of each layer into disjoint subsets and then uses a decoding procedure to determine rings connecting all nodes of each cluster. In this paper we compare several decoding procedures based on construction heuristics for the Traveling Salesman Problem and an integer linear programming approach. We observe that a nearest neighbor procedure outperforms the other constructive methods, while the exact approach proves to be to slow for practical use.

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

Access this chapter

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 EPUB and 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

Notes

  1. 1.

    www.math.uwaterloo.ca/tsp/concorde.

  2. 2.

    http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95

  3. 3.

    All instances are available at www.ac.tuwien.ac.at/research/problem-instances

References

  1. Gendreau, M., Labbé, M., Laporte, G.: Efficient heuristics for the design of ring networks. Telecommun. Syst. 4(1), 177–188 (1995)

    Article  Google Scholar 

  2. Proestaki, A., Sinclair, M.: Design and dimensioning of dual-homing hierarchical multi-ring networks. IEE Proc.Commun. 147(2), 96–104 (2000)

    Article  Google Scholar 

  3. Schauer, C., Raidl, G.R.: 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.) PPSN 2012, Part I. LNCS, vol. 7491, pp. 458–467. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  4. Schauer, C., Raidl, G.R.: A memetic algorithm for multi layer hierarchical ring network design. In: Bartz-Beielstein, T., Branke, J., Filipič, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 832–841. Springer, Heidelberg (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Christian Schauer .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Schauer, C., Raidl, G.R. (2015). On the Comparison of Decoding Strategies for a Memetic Algorithm for the Multi Layer Hierarchical Ring Network Design Problem. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2015. EUROCAST 2015. Lecture Notes in Computer Science(), vol 9520. Springer, Cham. https://doi.org/10.1007/978-3-319-27340-2_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27340-2_34

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27339-6

  • Online ISBN: 978-3-319-27340-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics