Maximal covering location problem (MCLP) with fuzzy travel times

Soheil Davari

doi:10.1016/j.eswa.2011.05.031

Maximal covering location problem (MCLP) with fuzzy travel times

Soheil Davari

Hertfordshire Business School

Research output: Contribution to journal › Article › peer-review

44 Citations (Scopus)

Abstract

This paper presents a fuzzy maximal covering location problem (FMCLP) in which travel time between any pair of nodes is considered to be a fuzzy variable. A fuzzy expected value maximization model is designed for such a problem. Moreover, a hybrid algorithm of fuzzy simulation and simulated annealing (SA) is used to solve FMCLP. Some numerical examples are presented, solved and analyzed to show the performance of the proposed algorithm. The results show that the proposed SA finds solutions with objective values no worse than 1.35% below the optimal solution. Furthermore, the simulation-embedded simulated annealing is robust in finding solutions.

Original language	English
Pages (from-to)	14535-14541
Journal	Expert Systems with Applications
Volume	38
Issue number	12
DOIs	https://doi.org/10.1016/j.eswa.2011.05.031
Publication status	Published - 1 Nov 2011

Access to Document

10.1016/j.eswa.2011.05.031

Cite this

@article{1fd1e3eae6b24008865ae047e7f867e7,

title = "Maximal covering location problem (MCLP) with fuzzy travel times",

abstract = "This paper presents a fuzzy maximal covering location problem (FMCLP) in which travel time between any pair of nodes is considered to be a fuzzy variable. A fuzzy expected value maximization model is designed for such a problem. Moreover, a hybrid algorithm of fuzzy simulation and simulated annealing (SA) is used to solve FMCLP. Some numerical examples are presented, solved and analyzed to show the performance of the proposed algorithm. The results show that the proposed SA finds solutions with objective values no worse than 1.35% below the optimal solution. Furthermore, the simulation-embedded simulated annealing is robust in finding solutions.",

author = "Soheil Davari",

year = "2011",

month = nov,

day = "1",

doi = "10.1016/j.eswa.2011.05.031",

language = "English",

volume = "38",

pages = "14535--14541",

journal = "Expert Systems with Applications",

issn = "0957-4174",

publisher = "Elsevier",

number = "12",

}

TY - JOUR

T1 - Maximal covering location problem (MCLP) with fuzzy travel times

AU - Davari, Soheil

PY - 2011/11/1

Y1 - 2011/11/1

N2 - This paper presents a fuzzy maximal covering location problem (FMCLP) in which travel time between any pair of nodes is considered to be a fuzzy variable. A fuzzy expected value maximization model is designed for such a problem. Moreover, a hybrid algorithm of fuzzy simulation and simulated annealing (SA) is used to solve FMCLP. Some numerical examples are presented, solved and analyzed to show the performance of the proposed algorithm. The results show that the proposed SA finds solutions with objective values no worse than 1.35% below the optimal solution. Furthermore, the simulation-embedded simulated annealing is robust in finding solutions.

AB - This paper presents a fuzzy maximal covering location problem (FMCLP) in which travel time between any pair of nodes is considered to be a fuzzy variable. A fuzzy expected value maximization model is designed for such a problem. Moreover, a hybrid algorithm of fuzzy simulation and simulated annealing (SA) is used to solve FMCLP. Some numerical examples are presented, solved and analyzed to show the performance of the proposed algorithm. The results show that the proposed SA finds solutions with objective values no worse than 1.35% below the optimal solution. Furthermore, the simulation-embedded simulated annealing is robust in finding solutions.

U2 - 10.1016/j.eswa.2011.05.031

DO - 10.1016/j.eswa.2011.05.031

M3 - Article

SN - 0957-4174

VL - 38

SP - 14535

EP - 14541

JO - Expert Systems with Applications

JF - Expert Systems with Applications

IS - 12

ER -

Maximal covering location problem (MCLP) with fuzzy travel times

Abstract

Access to Document

Fingerprint

Cite this