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

Samira Bolouri, Alireza Vafaeinejad, Ali Alesheikh, Hossein Aghamohammadi
2018 ISPRS International Journal of Geo-Information  
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
more » ... ere used separately to process data for Region 11, Tehran. The results showed that the genetic algorithm was more efficient than simulated annealing, and therefore, the genetic algorithm was used in later steps. Next, we increased the number of stations. Results showed that the model can successfully provide seven optimal locations and allocate high demands (280,000) to stations in a discrete space in a GIS, assuming that the stations' capacities are known. Following this, we used a weighting program so that in each repetition, we could allot weights to each target randomly. Finally, by repeating the model over 10 independent executions, a set of solutions with the least sum and the highest number of non-dominated solutions was selected from among many non-dominated solutions as the best set of optimal solutions.
doi:10.3390/ijgi7020044 fatcat:2fb2c5ikcnacjpkq7uinhg2jca