Comparing the performance of genetic algorithm and particle swarm optimization algorithm in allocating and scheduling fire stations

Genetic Algorithm (GA) and Particle Swarm Optimization Algorithm (PSOA) have positive effects on the allocation and scheduling of the stations, this research seeks to find which one of these two methods is more appropriate to shorten the time to reach fire/incident site in the Region 19 of Tehran. This is an applied type of research. Data analysis was carried out using NFPA standards and MATLAB software. The statistical population includes 8 fire stations and 250 personnel of the stations, and sampling volume was obtained using Morgan’s table (n = 148). In order to efficiently assign and schedule fire stations to arrive at the site, a linear numerical programming model was presented with the aim of minimizing the arrival time and taking into account the effect of firemen's fatigue (α = 0.1). Findings of the research showed that the operation processing time (of fire extinguishing) had a normal distribution with a mean of 40 min and a variance of 10 min, independent of the severity of the incident. Also, fatigue coefficient was calculated 0.1 by analyzing the sensitivity of the solution time of the algorithm with changes [0–1]. Initial standard travel time, with an average speed of 47 km/h and a density factor of 1.24, was 5_min:20_s. Solving the problem in large and small dimensions showed that the initial power effect of each fire station is 0.36 according to the fatigue level of the forces. Based on the obtained results, GA performs better in terms of problem solution time, and the improved PSOA also has higher quality answers.