• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      The ring/κ-rings network design problem: model and branch-and-cut algorithm

      Thumbnail
      View / Download
      545.7 Kb
      Author
      Rodríguez-Martín, I.
      Salazar-González, J-J.
      Yaman, H.
      Date
      2016
      Source Title
      Networks
      Print ISSN
      0028-3045
      Electronic ISSN
      1097-0037
      Publisher
      John Wiley & Sons
      Volume
      68
      Issue
      2
      Pages
      130 - 140
      Language
      English
      Type
      Article
      Item Usage Stats
      121
      views
      89
      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-cut
      Network design
      Ring networks
      Valid inequalities
      Algorithms
      Access ring network
      Branch and cut
      Branch-and-cut algorithms
      Computational results
      Valid inequality
      Permalink
      http://hdl.handle.net/11693/36951
      Published Version (Please cite this version)
      http://dx.doi.org/10.1002/net.21687
      Collections
      • Department of Industrial Engineering 687
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy