Development of CCRP algorithm based on departure time to support disaster evacuation scheduling

摘要

Research in this paper is focused on handling the issue of accumulation of vehicles at the intersection of evacuation routes. Solution of these problems is the development of CCRP** algorithms that integrates scheduling departure of vehicles on the evacuation route. The algorithm was developed by adding a variable start time of departure and an additional minute for the interval of departure. The algorithm starts from defining individual routes with travel time and capacity. Next determine the number of evacuee could pass through each route based on the smallest capacity on the route. Scheduling is done with dispatch displaced by the longest route in advance up to the total of evacuee already dispatched. Departure time each route adapted to give extra minutes between departures. To test the performance of CCRP** algorithm, conducted the development of applications for simulation scheduling evacuation. Applications developed by utilizing the API of GoogleMap to get the input of the evacuation route. By using the application, can be simulated by entering an early departure time, vehicle speed, and an interval of departure from which to avoid the accumulation of vehicles at intersections. The results show that with the departure schedule setting optimal vehicle, CCRP** algorithm can avoid conflict at intersection nodes.