Research of Vehicle Scheduling Problem and Algorithm Based on Emergency Needs

There will be some emergency needs which will disable the predetermined route during the vehicle scheduling, and affect the whole distribution process. The existing algorithms cannot efficiently and accurately solve these vehicle scheduling problems with the emergency needs. This article improved the C-K algorithm with the time window and the stowage constraint, studied the carriage of goods in Hebei province, and solved the emergency needs of vehicles scheduling problem, and the operation speed will be faster, the algorithm steps will be not complicated. Thus, vehicles scheduling route with burst situation will be redefined efficiently and accurately, and efficiency will be improved, resources inputs will be reduced, so that the cost will be saved, interests will be maximized. This article improved the existing logistics, and played a role in promoting the logistics capabilities and management.