The ring/κ-rings network design problem: model and branch-and-cut algorithm
Author
Rodríguez-Martín, I.
Salazar-González, J-J.
Yaman, H.
Date
2016Source Title
Networks
Print ISSN
0028-3045
Electronic ISSN
1097-0037
Publisher
John Wiley & Sons
Volume
68
Issue
2
Pages
130 - 140
Language
English
Type
ArticleItem Usage Stats
121
views
views
89
downloads
downloads
Abstract
This article considers the problem of designing a two-level network where the upper level consists of a backbone ring network connecting the so-called hub nodes, and the lower level is formed by access ring networks that connect the non-hub nodes to the hub nodes. There is a fixed cost for each type of link, and a facility opening cost associated to each hub. The number of nodes in each access ring is bounded, and the number of access rings connected to a hub is limited to κ, thus resulting in a ring/κ-rings topology. The aim is to decide the hubs to open and to design the backbone and access rings to minimize the installation cost. We propose a mathematical model, give valid inequalities, and describe a branch-and-cut algorithm to solve the problem. Computational results show the algorithm is able to find optimal solutions on instances involving up to 40 nodes within a reasonable time.
Keywords
Branch-and-cutNetwork design
Ring networks
Valid inequalities
Algorithms
Access ring network
Branch and cut
Branch-and-cut algorithms
Computational results
Valid inequality