Please use this identifier to cite or link to this item:
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
Issue Date: 2013
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.
ISSN: 0950-7051
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


checked on Sep 23, 2022


checked on Sep 24, 2022

Page view(s)

checked on Feb 6, 2023

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.