• About
  • Policies
  • What is open access
  • 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.

      A distance-limited continuous location-allocation problem for spatial planning of decentralized systems

      Thumbnail
      Embargo Lift Date: 2020-12-01
      View / Download
      1.2 Mb
      Author(s)
      Gokbayrak, K.
      Kocaman, A. S.
      Date
      2017
      Source Title
      Computers and Operations Research
      Print ISSN
      0305-0548
      Electronic ISSN
      1873-765X
      Publisher
      Elsevier
      Volume
      88
      Pages
      15 - 29
      Language
      English
      Type
      Article
      Item Usage Stats
      281
      views
      328
      downloads
      Abstract
      We introduce a new continuous location-allocation problem where the facilities have both a fixed opening cost and a coverage distance limitation. The problem has wide applications especially in the spatial planning of water and/or energy access networks where the coverage distance might be associated with the physical loss constraints. We formulate a mixed integer quadratically constrained problem (MIQCP) under the Euclidean distance setting and present a three-stage heuristic algorithm for its solution: In the first stage, we solve a planar set covering problem (PSCP) under the distance limitation. In the second stage, we solve a discrete version of the proposed problem where the set of candidate locations for the facilities is formed by the union of the set of demand points and the set of locations in the PSCP solution. Finally, in the third stage, we apply a modified Weiszfeld's algorithm with projections that we propose to incorporate the coverage distance component of our problem for fine-tuning the discrete space solutions in the continuous space. We perform numerical experiments on three example data sets from the literature to demonstrate the performance of the suggested heuristic method.
      Keywords
      Continuous location-allocation
      Decentralized systems
      Multi-source Weber problem
      Planar set covering
      Constraint theory
      Heuristic algorithms
      Location
      Numerical methods
      Stages
      Transfer cases (vehicles)
      Candidate locations
      Constrained problem
      Continuous locations
      Decentralized system
      Numerical experiments
      Set covering problem
      Set coverings
      Weber problem
      Heuristic methods
      Permalink
      http://hdl.handle.net/11693/37407
      Published Version (Please cite this version)
      http://dx.doi.org/10.1016/j.cor.2017.06.013
      Collections
      • Department of Industrial Engineering 758
      Show full item record

      Related items

      Showing items related by title, author, creator and subject.

      • Thumbnail

        Hub location under competition 

        Mahmutogullari, A. I.; Kara, B. Y. (Elsevier, 2016)
        Hubs are consolidation and dissemination points in many-to-many flow networks. Hub location problem is to locate hubs among available nodes and allocate non-hub nodes to these hubs. The mainstream hub location studies ...
      • Thumbnail

        Double bound method for solving the p-center location problem 

        Calik, H.; Tansel, B. C. (Elsevier, 2013)
        We give a review of existing methods for solving the absolute and vertex restricted p-center problems on networks and propose a new integer programming formulation, a tightened version of this formulation and a new method ...
      • Thumbnail

        Spatial analysis of single allocation hub location problems 

        Peker, M.; Kara, B. Y.; Campbell, J. F.; Alumur, S. A. (Springer, 2016)
        Hubs are special facilities that serve as switching, transshipment and sorting nodes in many-to-many distribution systems. Flow is consolidated at hubs to exploit economies of scale and to reduce transportation costs between ...

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      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 2976
      © Bilkent University - Library IT

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