Abstract
We address the Multi Layer Hierarchical Ring Network Design Problem. This problem arises in the design of large telecommunication backbones, when high reliability is emphasized. The aim is to connect nodes that are assigned to different layers using a hierarchy of rings of bounded length. We present a memetic algorithm that focuses on clustering the nodes of each layer into disjoint subsets. A decoding procedure is then applied to each genotype for determining a ring connecting all nodes of each cluster. For local improvement we incorporate a previous variable neighborhood search. We experimentally evaluate our memetic algorithm on various graphs and show that it outperforms the sole variable neighborhood search approach in 13 out of 30 instances, while in eight instances they perform on par.
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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balakrishnan, A., Magnanti, T.L., Mirchandani, P.: The Multi-level Network Design Problem. Tech. Rep. 3366-91, Massachusetts Institute of Technology (1991)
Carroll, P., McGarraghy, S.: Investigation of the ring spur assignment problem. In: Bigi, G., Frangioni, A., Scutellà, M. (eds.) Proceedings of the 4th International Network Optimization Conference (INOC 2009). pp. MB1–3 (2009)
Cook, W.J.: Concorde TSP Solver, http://www.math.uwaterloo.ca/tsp/concorde/ (accessed: March 13, 2014)
Dreyfus, S., Wagner, R.A.: The Steiner Problem in Graphs. Networks 1, 195–207 (1972)
Du, J., Korkmaz, E., Alhajj, R., Barker, K.: Novel clustering approach that employs genetic algorithm with new representation scheme and multiple objectives. In: Kambayashi, Y., Mohania, M., Wöß, W. (eds.) DaWaK 2004. LNCS, vol. 3181, pp. 219–228. Springer, Heidelberg (2004)
Gendreau, M., Labbé, M., Laporte, G.: Efficient heuristics for the design of ring networks. Telecommunication Systems 4(1), 177–188 (1995)
Proestaki, A., Sinclair, M.: Design and dimensioning of dual-homing hierarchical multi-ring networks. IEE Proceedings Communications 147(2), 96–104 (2000)
Schauer, C., Raidl, G.R.: Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design. In: Coello Coello, C.A., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012, Part I. LNCS, vol. 7491, pp. 458–467. Springer, Heidelberg (2012)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Schauer, C., Raidl, G.R. (2014). A Memetic Algorithm for Multi Layer Hierarchical Ring Network Design. In: Bartz-Beielstein, T., Branke, J., Filipič, B., Smith, J. (eds) Parallel Problem Solving from Nature – PPSN XIII. PPSN 2014. Lecture Notes in Computer Science, vol 8672. Springer, Cham. https://doi.org/10.1007/978-3-319-10762-2_82
Download citation
DOI: https://doi.org/10.1007/978-3-319-10762-2_82
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10761-5
Online ISBN: 978-3-319-10762-2
eBook Packages: Computer ScienceComputer Science (R0)