Optimizing of Schedule Time for Relay Transportation System in Hazard Condition Respect to Dividing Tasks between Centers and Capacity of Fleet (Case study: Qazvin City)

Avoidance of turning natural disasters to natural tragedies requires upraising in capacitance of management and planning in Hazard management. Into this purpose, seconds and minutes should be considered as an essential limitation to save lives in such natural catastrophes in the process of serving. To this end, planning for the optimal use of available time of relief system in these cases, will lead to increased backup capabilities, assistance in the shortest possible time, and the appropriate allocation of resources to the required people. In this regard, the present study tries to provide a model for distributing relief tasks in different regions of a city, between hospitals and relief centers, and considering the relief funds assigned to them for relief, and use of real distances in different parts of the city of Qazvin. These centers, will focus on optimizing the time needed to transfer injured people in crisis situations to hospitals, in a three-stage supply chain, and, in order to achieve these goals, consider the capacity of the fleet in the problem. Degree of complexity of the problem is NP-hard.Therefore, finding an optimal solution in a reasonable time is impossible by using accurate methods. In This paper, a dynamic genetic algorithm has been employed in which contains chromosomes with variable structure in order to solve the problem. In addition, for evaluation of results accuracy from this algorithm, it compare with result from random search method. Results show genetic algorithm is more reliable and demonstrate the improvement of average results with increase of relay vehicle and capacity of them; also the deterioration of average results with growth of injured people.