Toward a distributed strategy for emergency ambulance routing problem

The optimal routing problem has always been the main event of city emergency rescue. Its research object has developed from searching for “the shortest route” to searching “the optimal route”. The related algorithms and techniques differ in different situations. In addition to distance problem, the influence of various parameters factors should also be analyzed under the complicated conditions. The amount of the accidents in the world is terrifying and it is viewed as the highest in the world. So in this situation, we need an efficient method for fast intervention that will respond in such situations. Therefore, it is important to encourage the study in ambulance management and routing by introducing a new strategy for guiding ambulance toward the position of the accident in an efficient way. A distributed solution is proposed based on the ant colony system algorithm model. The improved method is based on a distributed architecture to compute and find the optimal path for a set of emergency vehicles. Based on the defect of the ambulance route planning, this paper puts forward a new distributed model to find the best way that minimizes the time while taking into consideration the cases of problems that can appear each time such as traffics, speed limit, number of available ambulances, the position of the hospitals.