A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
Kocaman, A. S.
Computers and Operations Research
15 - 29
Item Usage Stats
MetadataShow full item record
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.
Multi-source Weber problem
Planar set covering
Transfer cases (vehicles)
Set covering problem
Embargo Lift Date2020-12-01
Published Version (Please cite this version)http://dx.doi.org/10.1016/j.cor.2017.06.013
Showing items related by title, author, creator and subject.
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 ...
Dukkanci, O.; Kara, B. Y. (Elsevier, 2017)Hubs are facilities that consolidate and disseminate flow in many-to-many distribution systems. The hub location problem considers decisions that include the locations of hubs in a network and the allocations of demand ...
A bilevel uncapacitated location/pricing problem with Hotelling access costs in one-dimensional space Arbib, C.; Pınar, Mustafa Ç.; Tonelli, M. (International Conference on Information Systems, Logistics and Supply Chain, 2016)We formulate a spatial pricing problem as bilevel non-capacitated location: a leader first decides which facilities to open and sets service prices taking competing offers into account; then, customers make individual ...