In this paper, a mathematical formulation is presented for fire station’s locating and facilities allocating to stations in different periods and emergency situations (wars and natural disasters). This model is designed, considering amount of demands and facilities coverage radius, being dynamic based on traffic and type region and fuzzy in different periods. According to fact, in the model, amount of demand for each demand point depends on number of coverage and the location. In this model, location of stations is positioned once in different periods. The number of facilities which are allocated to stations are located dynamically and can be relocated in different periods. Since the proposed model is NP-hard, particle swarm optimization (PSO) and artificial bee colony (ABC) algorithms by considering an efficient combinatorial chromosome are presented to solve the problem at hand. In the PSO, way of making chromosome is such that locating chromosome, early and final allocation are presented in a novel approach. The results demonstrated that the presented PSO are better than ABC in terms of quality of solutions and computational time.

本文针对在不同时期和紧急情况（战争和自然灾害）中消防局的位置和设施分配提出了数学公式。该模型的设计考虑了需求量和设施覆盖半径，基于交通量和类型区域是动态的，并且在不同时期是模糊的。实际上，在模型中，每个需求点的需求量取决于覆盖范围和位置。在此模型中，站点的位置在不同的时期内一次。分配给站点的设施数量是动态定位的，可以在不同的时期内重新定位。由于建议的模型是NP-hard的，通过考虑有效的组合染色体，提出了粒子群优化（PSO）和人工蜂群（ABC）算法来解决当前的问题。在PSO中，制作染色体的方法是以一种新颖的方法呈现染色体的位置，早期分配和最终分配。结果表明，所提出的PSO在解决方案质量和计算时间方面均优于ABC。