• 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 design of single allocation incomplete hub networks

      Thumbnail
      View / Download
      989.8 Kb
      Author
      Alumur, S. A.
      Kara, B. Y.
      Karasan, O. E.
      Date
      2009
      Source Title
      Transportation Research Part B
      Print ISSN
      0191-2615
      Electronic ISSN
      1879-2367
      Publisher
      Elsevier
      Volume
      43
      Issue
      10
      Pages
      936 - 951
      Language
      English
      Type
      Article
      Item Usage Stats
      139
      views
      259
      downloads
      Abstract
      The hub location problem deals with finding the location of hub facilities and allocating the demand nodes to these hub facilities so as to effectively route the demand between any origin-destination pair. In the extensive literature on this challenging network design problem, it has widely been assumed that the subgraph induced by the hub nodes is complete. Relaxation of this basic assumption constitutes the starting point of the present work. In this study, we provide a uniform modeling treatment to all the single allocation variants of the existing hub location problems, under the incomplete hub network design. No network structure other than connectivity is imposed on the induced hub network. Within this context, the single allocation incomplete p-hub median, the incomplete hub location with fixed costs, the incomplete hub covering, and the incomplete p-hub center network design problems are defined, and efficient mathematical formulations for these problems with O (n3) variables are introduced. Computational analyses with these formulations are presented on the various instances of the CAB data set and on the Turkish network.
      Keywords
      Hub location
      Network design
      P-hub median
      Hub covering
      P-hub center
      Permalink
      http://hdl.handle.net/11693/22513
      Published Version (Please cite this version)
      http://dx.doi.org/10.1016/j.trb.2009.04.004
      Collections
      • Department of Industrial Engineering 677
      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