In many cases where emergency medical services are required, ground and air ambulances cooperate in a shared activity to transfer the injured from the accident scene to treatment centers. The cooperation becomes necessary, particularly where the air ambulance can not land at the accident scene, and it sometimes seems essential to make use of transfer points during the cooperation. Given that the demand pattern might change during time, it does not seem logical to formulate the problem statically. Hence, in this paper, we have presented a multi-period maximal coverage location model, which simultaneously locates the transfer points, ground ambulance stations, air ambulance stations, and allocates ambulances to them. Also, the available ambulances are moved among the established stations if required subject to demand changes during the planning horizon. Coverage is provided based on the times it takes the ambulance to arrive at the accident scene and to transfer from the accident scene to the nearest treatment center. In this research, four methods of providing service to the injured and transferring them to treatment centers have been considered. In the presented model, the inaccessibility of ambulances has been considered in light of the notion of backup coverage. Given the complexity of the problem and the impossibility to solve it optimally at large-scale problems, a heuristic algorithm with the greedy approach has been presented for solving it. The obtained computational results demonstrate the efficiency of the proposed algorithm in solving different problems as compared to CPLEX.
