• 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.

      Benders decomposition algorithms for two variants of the single allocation hub location problem

      Thumbnail
      View / Download
      878.7 Kb
      Author
      Ghaffarinasab, N.
      Kara, Bahar Y.
      Date
      2019
      Source Title
      Networks and Spatial Economics
      Print ISSN
      1566-113X
      Publisher
      Springer
      Volume
      19
      Issue
      1
      Pages
      83 - 108
      Language
      English
      Type
      Article
      Item Usage Stats
      73
      views
      122
      downloads
      Abstract
      The hub location problem (HLP) is a special type of the facility location problem with numerous applications in the airline industry, postal services, and computer and telecommunications networks. This paper addresses two basic variants of the HLP, namely the uncapacitated single allocation hub location problem (USAHLP) and the uncapacitated single allocation p-hub median problem (USAp HMP). Exact solution procedures based on Benders decomposition algorithm are proposed to tackle large sized instances of these problems. The standard Benders decomposition algorithm is enhanced through implementation of several algorithmic refinements such as using a new cut disaggregation scheme, generating strong optimality cuts, and an efficient algorithm to solve the dual subproblems. Furthermore, a modern implementation of the algorithm is used where a single search tree is established for the problem and Benders cuts are successively added within a branch-and-cut framework. Extensive computational experiments are conducted to examine the efficiency of the proposed algorithms. We have been able to solve all the instances of the problems from all three main data sets of the HLP to optimality in reasonable computational times.
      Keywords
      Hub location problem
      Single allocation
      Benders decomposition
      Branch-and-cut
      Algorithmic refinements
      Permalink
      http://hdl.handle.net/11693/52990
      Published Version (Please cite this version)
      https://dx.doi.org/10.1007/s11067-018-9424-z
      Collections
      • Department of Industrial Engineering 684
      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
      Copyright © Bilkent University - Library IT

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