A Mathematical Model for Fire Station Locating with Maximal Covering Location and Multi Period Approach

In this study, a model is presented for fire station’s locating and facilities allocating to stations in different periods and emergency situations. This model is designed, considering amount of demands and facilities coverage radius, being dynamic (based on traffic and type of region) in different periods. According to fact, in the presented model, amount of demand for each demand point depends on number of coverage by facilities and amount of demand of demand point .in this model , location of stations is determined once in different periods. The numbers of facilities which are allocated to stations are allocated dynamically and can be relocated in different periods. In the model, each strategic demand point (arsenal, food storage and so on) can be potential point for facilities. This is a complicated model so to solve this model, particle swarm optimization algorithm and combinatorial matrix have been suggested. In the suggested algorithm, method of making matrix is such that locating matrix and early and final allocation are presented in a single matrix. Finally the results of proposed algorithm with artificial bee colony were compared the results show that this algorithm is better in terms of quality of answers and solving time.