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

Autor: Ayse Selin Kocaman, Kagan Gokbayrak
Jazyk: angličtina
Rok vydání: 2017
Předmět:
Mathematical optimization
General Computer Science
Heuristic (computer science)
Location
0211 other engineering and technologies
Transfer cases (vehicles)
02 engineering and technology
Management Science and Operations Research
Decentralized systems
Decentralized system
Set (abstract data type)
Integer
Component (UML)
Continuous location-allocation
Constrained problem
0202 electrical engineering
electronic engineering
information engineering
Stages
Heuristic algorithms
Constraint theory
Mathematics
Numerical experiments
Multi-source Weber problem
021103 operations research
Discrete space
Planar set covering
Set coverings
Set cover problem
Euclidean distance
Candidate locations
Continuous locations
Modeling and Simulation
020201 artificial intelligence & image processing
Location-allocation
Numerical methods
Weber problem
Heuristic methods
Set covering problem
Zdroj: Computers and Operations Research
Popis: 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.
Databáze: OpenAIRE
Externí odkaz: