routing relief teams by introducing new urban congestion parameter and solving using gacd-mdvrp clustering through genetic algorithm

Emergency disasterrelief activities could dramatically reduce injuries and casualties, while routing and scheduling of the relief teams is also considered an important factor in reducing the fatalities. for this reason, in this paper, a new model is proposed for routing rescue teams considering time windows, capacitated and multidepot vehicles. in this model, additional factors such as availability of relief centers, congestion and service standard for the vehicles. a new parameter has been developed to denote the congestion of each path and id incorporated into the model using the concept of social network analysis (sna). finally, the model is solved using a corei5 8gb system. the model is also implemented using the data obtained from the roads and transport organization and the iranian red crescent society. the average accuracy of this algorithm was 87% after solving 23 problem samples and improvement of the runtime was 74% in large problems. the model is then applied to the case study of the 2017 earthquake in kermanshah, iran. a rescue scenario is generated using the historical data of i.r. iran road maintenance transportation organization and the i.r. relief and rescue organization of red crescent society of iran. in this study, simulations are conducted based on a case study with actual locations.