Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

A greedy variable neighborhood search heuristic for the maximal covering location problem with fuzzy coverage radii

Davari, Soheil, Zarandi, Mohammad Hossein Fazel and Turksen, I. Burhan 2013. A greedy variable neighborhood search heuristic for the maximal covering location problem with fuzzy coverage radii. Knowledge-Based Systems 41 , pp. 68-76. 10.1016/j.knosys.2012.12.012

Full text not available from this repository.

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.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Mathematics
Subjects: Q Science > QA Mathematics
Publisher: Elsevier
ISSN: 0950-7051
Last Modified: 20 Jul 2017 04:03
URI: http://orca.cf.ac.uk/id/eprint/68527

Citation Data

Cited 21 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item