Intelligent Routing For Rescue Squads using Game Theory Algorithm In Semnan

Reduced transfer time results in increased levels of service to citizens and their satisfaction would increase consequently. To this end، using new and improved routing algorithms and localizing them in urban areas، considering their scope and extent، can be efficient in urban management and relief sectors. The purpose of this study is to look at the operation of the routing algorithms، including Genetic and Ant colony and due to the size of the city conduct a research to optimize the routing by using Game theory algorithm in the software ArcGis. Therefore، programs written for routing with Genetic algorithm، Ant colony and Game theory were called for in the software ArcGis and then used for routing. The results showed lack of spatial information database shared between rescue squads makes their services impossible in the least amount of time and if spatial databases are made and used، due to the small size of the city of Semnan، the time to achieve an optimal route by ArcGis using Game theory algorithm would be shorter compared with other algorithms. Therefore، the time for the Genetic theory، Game theory and Ant colony are 0. 27، 0. 23 and 0. 19 ms. respectively. Time to reach the crash site، using the routing by ArcGis program with Genetic algorithm، Ant colony and Game theory are 3 minutes and 5 seconds، 3 minutes and 15 seconds، and 2 minutes and 42 seconds، respectively.