Variable neighborhood search and GRASP for three-layer hierarchical ring network design

Authors:
Christian Schauer;Günther R. Raidl
Affiliations:
Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria
Venue:
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Year:
2012

Citing 4
Cited 0

Comparing Metaheuristic Algorithms for Sonet Network Design Problems

Journal of Heuristics
The Capacitated m-Ring-Star Problem

Operations Research
Handbook of Metaheuristics

Handbook of Metaheuristics
A variable neighborhood search approach for the two-echelon location-routing problem

EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

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.