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

Simple item page
dc.citation.epage29en_US
dc.citation.spage15en_US
dc.citation.volumeNumber88en_US
dc.contributor.authorGokbayrak, K.en_US
dc.contributor.authorKocaman, A. S.en_US
dc.date.accessioned2018-04-12T11:12:36Z
dc.date.available2018-04-12T11:12:36Z
dc.date.issued2017en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractWe 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.en_US
dc.description.provenanceMade available in DSpace on 2018-04-12T11:12:36Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 179475 bytes, checksum: ea0bedeb05ac9ccfb983c327e155f0c2 (MD5) Previous issue date: 2017en
dc.embargo.release2020-12-01en_US
dc.identifier.doi10.1016/j.cor.2017.06.013en_US
dc.identifier.eissn1873-765X
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/11693/37407
dc.language.isoEnglishen_US
dc.publisherElsevieren_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.cor.2017.06.013en_US
dc.source.titleComputers and Operations Researchen_US
dc.subjectContinuous location-allocationen_US
dc.subjectDecentralized systemsen_US
dc.subjectMulti-source Weber problemen_US
dc.subjectPlanar set coveringen_US
dc.subjectConstraint theoryen_US
dc.subjectHeuristic algorithmsen_US
dc.subjectLocationen_US
dc.subjectNumerical methodsen_US
dc.subjectStagesen_US
dc.subjectTransfer cases (vehicles)en_US
dc.subjectCandidate locationsen_US
dc.subjectConstrained problemen_US
dc.subjectContinuous locationsen_US
dc.subjectDecentralized systemen_US
dc.subjectNumerical experimentsen_US
dc.subjectSet covering problemen_US
dc.subjectSet coveringsen_US
dc.subjectWeber problemen_US
dc.subjectHeuristic methodsen_US
dc.titleA distance-limited continuous location-allocation problem for spatial planning of decentralized systemsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
A_distance-limited_continuous_location-allocation_problem_for_spatial_planning_of_decentralized_systems.pdf
Size:
1.16 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Industrial Engineering