2018
DOI: 10.3390/ijgi7020044
|View full text |Cite
|
Sign up to set email alerts
|

The Ordered Capacitated Multi-Objective Location-Allocation Problem for Fire Stations Using Spatial Optimization

Abstract: Determining the positions of facilities, and allocating demands to them, is a vitally important problem. Location-allocation problems are optimization NP-hard procedures. This article evaluates the ordered capacitated multi-objective location-allocation problem for fire stations, using simulated annealing and a genetic algorithm, with goals such as minimizing the distance and time as well as maximizing the coverage. After tuning the parameters of the algorithms using sensitivity analysis, they were used separa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
8
0
3

Year Published

2018
2018
2023
2023

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 35 publications
(13 citation statements)
references
References 29 publications
0
8
0
3
Order By: Relevance
“…In 2018, Bolouri et al examined two Genetic and Simulated Annealing algorithms to solve the multi-objective location-allocation problem of fire stations in GIS environment. The results showed the efficiency of the Genetic algorithm with high demand (Bolouri et al, 2018). Because in the various studies, Tabu and Genetic algorithm in solving location-allocation problems presented better results compared to other algorithms in less time and escaped from trapping in local optima, these two algorithms will be used to solve the location-allocation raised in this research.…”
Section: Literature Reviewmentioning
confidence: 90%
“…In 2018, Bolouri et al examined two Genetic and Simulated Annealing algorithms to solve the multi-objective location-allocation problem of fire stations in GIS environment. The results showed the efficiency of the Genetic algorithm with high demand (Bolouri et al, 2018). Because in the various studies, Tabu and Genetic algorithm in solving location-allocation problems presented better results compared to other algorithms in less time and escaped from trapping in local optima, these two algorithms will be used to solve the location-allocation raised in this research.…”
Section: Literature Reviewmentioning
confidence: 90%
“…Tang Jian et al, Have proposed a rescue solution using simulated annealing optimization (Tang et al 2018) and also Bolouri et al, Using simulated annealing optimization to locate fire stations. (Bolouri et al 2018); also Hongman Wang et al, Improved emergency transportation using multi-purpose ant-community algorithm (Wang et al 2018). Mousanejad et al, Using geographic information system and simulated annealing for optimizing the railway design (Mousanejad et al, 2018) and Aghakhani et al, Using Geospatial Inforrmation System Assessment of the effects of land use scenarios on watershed surface runoff (Aghakhani et al 2018).…”
Section: Literature Reviewmentioning
confidence: 99%
“…If they are not well positioned, they cannot satisfy the needs of customers or offer some services to them. In crowded cities where there is insufficient space for positioning these facilities, the issue becomes even more important (Bolouri et al , 2018).…”
Section: Introductionmentioning
confidence: 99%