The ring/κ-rings network design problem: model and branch-and-cut algorithm
| dc.citation.epage | 140 | en_US |
| dc.citation.issueNumber | 2 | en_US |
| dc.citation.spage | 130 | en_US |
| dc.citation.volumeNumber | 68 | en_US |
| dc.contributor.author | Rodríguez-Martín, I. | en_US |
| dc.contributor.author | Salazar-González, J-J. | en_US |
| dc.contributor.author | Yaman, H. | en_US |
| dc.date.accessioned | 2018-04-12T10:58:15Z | |
| dc.date.available | 2018-04-12T10:58:15Z | |
| dc.date.issued | 2016 | en_US |
| dc.department | Department of Industrial Engineering | en_US |
| dc.description.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. | en_US |
| dc.identifier.doi | 10.1002/net.21687 | en_US |
| dc.identifier.eissn | 1097-0037 | |
| dc.identifier.issn | 0028-3045 | |
| dc.identifier.uri | http://hdl.handle.net/11693/36951 | |
| dc.language.iso | English | en_US |
| dc.publisher | John Wiley & Sons | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1002/net.21687 | en_US |
| dc.source.title | Networks | en_US |
| dc.subject | Branch-and-cut | en_US |
| dc.subject | Network design | en_US |
| dc.subject | Ring networks | en_US |
| dc.subject | Valid inequalities | en_US |
| dc.subject | Algorithms | en_US |
| dc.subject | Access ring network | en_US |
| dc.subject | Branch and cut | en_US |
| dc.subject | Branch-and-cut algorithms | en_US |
| dc.subject | Computational results | en_US |
| dc.subject | Valid inequality | en_US |
| dc.title | The ring/κ-rings network design problem: model and branch-and-cut algorithm | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- The_ringκ-rings_network_design_problem_model_and_branch-and-cut_algorithm.pdf
- Size:
- 545.67 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version