Mostafa Kheyrollahi; saeed nadi; Najmeh Neisany Samany
Abstract
Abstract
Due to the sensitivity oftheir missions, urban emergency vehicles are alwayslooking forthe shortest timeto reach the destination. In big cities, in addition todistance, several factors and parameters with respect to the complexityand extent of thetransport and traffic, are influencing time ...
Read More
Abstract
Due to the sensitivity oftheir missions, urban emergency vehicles are alwayslooking forthe shortest timeto reach the destination. In big cities, in addition todistance, several factors and parameters with respect to the complexityand extent of thetransport and traffic, are influencing time of arrival of an emergency vehicle, some of which are qualitative or quantitative, dynamic or static. In this paper, the modern approach used, is based on composing conflation models, Gamma quantification methods, travel time prediction formulas and meta-heuristic algorithms in order to find most optimal route. In this paper, first we have tried to introduce all the calculated, available, qualitative and quantitative, affecting factors related to emergency routing, thenwith converting qualitative parameters to quantitative ones, we normalize each parameter by the maximum approach and conflate them in such a way that thepriority and impact of each parameteris determined to find the optimal route. In order to calculate the priority and impact of factors, the Gamma test method, as a data derived method is selected. The procedure is implemented by the use of road network and traffic volume data from two regions of Tehran. Based on this approach, the considered weights for each following criterion of degree of difficulty including quality, width, slope, category, and route directness are 0.331, 0.286, 0.188, 0.172 and 0.020, respectively. Finally, genetic meta-heuristic algorithm is used to select the optimal route and the results compared with common Dijkstra routing algorithm. The length of the selected route by GA is about 130 meters in one time and about 300 meter in the other time more than the selected one by Dijkstra algorithm. Based on the implemented comparison, the represented approach in this paper had a considerable superiority over the simple current methods.