2021
DOI: 10.1016/j.eswa.2021.115830
|View full text |Cite
|
Sign up to set email alerts
|

A multi-objective formulation of maximal covering location problem with customers’ preferences: Exploring Pareto optimality-based solutions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 47 publications
0
2
0
Order By: Relevance
“…In [46] an uncapacitated FLP is proposed as bi-objective formulation with fractional and linear objectives. Many interesting biobjective real-time work has been developed, such as in [28] capacitated FLP was dealt with for locating certain facilities with minimum sum of objectives, in [47], Current et al have treated shortest path problems as bi-objective formulation with coverage and cost as two contrasting objectives [48].…”
Section: Literature Reviewmentioning
confidence: 99%
“…In [46] an uncapacitated FLP is proposed as bi-objective formulation with fractional and linear objectives. Many interesting biobjective real-time work has been developed, such as in [28] capacitated FLP was dealt with for locating certain facilities with minimum sum of objectives, in [47], Current et al have treated shortest path problems as bi-objective formulation with coverage and cost as two contrasting objectives [48].…”
Section: Literature Reviewmentioning
confidence: 99%
“…The essence of this problem is to maximize or minimize one or more mathematical functions to solve the allocation scheme of public facilities resources, such as the locations of fire stations, hospitals, schools, and environmental monitoring stations, as well as reserve site selection (Church et al, 1996;Malcolma and Revelle, 2005;Murray, 2010;Tong and Murray, 2012). Approaches for such location modeling focus on the P-median location-allocation model (Church and Wang, 2020;Zaferanieh et al, 2022), the maximum minimization model (Wang and Zhang, 2012), the maximum coverage location problem (MCLP) (Atta et al, 2021;Taiwo, 2021), and continuous model of coverage problem (CMCP) (Yang et al, 2020;Blanco and Gaźquez, 2021). Based on the vertex weights and correction costs as independent uncertain variables (both side length and vertex weights are variable), Soltanpour et al (2020) proposed a model of an uncertain inverse P-median location problem to deal with tail values at risk targets and proved that it is a nondeterminism Polynomial(NP) problem; meanwhile, a hybrid PSO algorithm was proposed to obtain the approximate optimal solution of the proposed model.…”
Section: Related Workmentioning
confidence: 99%
“…As defined by Atta et al (2021), the maximum coverage location problem (MCLP) is a well-known combinatorial optimization issue with several applications in emergency and military services, as well as in public services. According to the conventional definition, MCLP is a single objective problem with the purpose of maximizing the total number of customer requests that can be met by a specific number of operational facilities.…”
Section: Introductionmentioning
confidence: 99%