Design of Hierarchical Ring Networks Using BranchandPrice  Tommy Thomadsen, Thomas Stidsen
 Abstract  We consider the problem of designing hierarchical two layer ring networks. The top layer consists of a federalring which establishes connection between a number of node disjoint metrorings in a bottom layer. The objective is to minimize the costs of links in the network, taking both the fixed link establishment costs and the link capacity costs into account.
The hierarchical two layer ring network design problem is solved in two stages: First the bottom layer, i.e. the metrorings are designed, implicitly taking into account the capacity cost of the federalring. Then the federalring is designed connecting the metrorings, minimizing fixed link establishment costs of the federalring. A branchandprice algorithm is presented for the design of the bottom layer and it is suggested that existing methods are used for the design of the federalring. Computational results are given for networks with up to 36 nodes.  Keywords  Ring network design, Hierarchical network design, Branchand Price  Type  Technical report  Year  2004  Publisher  Informatics and Mathematical Modelling, Technical University of Denmark, DTU  Address  Richard Petersens Plads, Building 321, DK2800 Kgs. Lyngby  Series  IMMTechnical Report20047  BibTeX data  [bibtex]  IMM Group(s)  Operations Research 
Back :: IMM Publications
