Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11851/6087
Title: | A Greedy Variable Neighborhood Search Heuristic for the Maximal Covering Location Problem With Fuzzy Coverage Radii | Authors: | Davari, Soheil Zarandi, Mohammad Hossein Fazel Türkşen, İsmail Burhan |
Keywords: | Maximal covering location problem (MCLP) Credibility theory Variable neighborhood search Fuzzy simulation Facility location |
Publisher: | Elsevier Science Bv | Abstract: | The maximal covering location problem (MCLP) seeks location of facilities on a network, so as to maximize the total demand within a pre-defined distance or travel time of facilities (which is called coverage radius). Most of the real-world applications of MCLP comprise many demand nodes to be covered. Moreover, uncertainty is ubiquitous in most of the real-world covering location problems, which are solved for a long-term horizon. Therefore, this paper studies a large-scale MCLP on the plane with fuzzy coverage radii under the Hurwicz criterion. In order to solve the problem, a combination of variable neighborhood search (VNS) and fuzzy simulation is offered. Test problems with up to 2500 nodes and different settings show that VNS is competitive, since it is able to find solutions with gaps all below 1.5% in much less time compared to exact algorithms. (C) 2012 Elsevier B.V. All rights reserved. | URI: | https://doi.org/10.1016/j.knosys.2012.12.012 https://hdl.handle.net/20.500.11851/6087 |
ISSN: | 0950-7051 1872-7409 |
Appears in Collections: | Endüstri Mühendisliği Bölümü / Department of Industrial Engineering Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Show full item record
CORE Recommender
SCOPUSTM
Citations
30
checked on Dec 21, 2024
WEB OF SCIENCETM
Citations
33
checked on Aug 31, 2024
Page view(s)
70
checked on Dec 16, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.