Vehicle Scheduling Problems For Emergency Logistics Management With Recruitment Cost

Recently emergency events have been likely emerging around the global society, caused great loss of the social economy and people's life and property. How to establish an effective emergency logistics system, after emergency events, to launch the emergency plan to distribute the limited resources to the affect areas with a good planning and scheduling transportation, is the hotspot of present research. In the research of emergency logistics, Vehicle Scheduling Problem is particularly important. Vehicle Scheduling Problem is highly realistic significance which refers to how combine these affected points scientifically to form a series of path, then orderly through these demand point, and improve the relief activities of transportation efficient economically.With this consideration, the key point of this article will be the combination of Vehicle Scheduling Problem and some emergency logistics realities, especially for the large-scale demand of Vehicle Scheduling Problem. This paper firstly introduced the basic knowledge and the domestic and foreign relevant research of emergency logistics and Vehicle Scheduling Problem. Next, combined the Vehicle Scheduling Problem with vehicle recruiting cost and the shortage cost are studied, and also justified it by a numerical example. Then based on this foundation increasing marginal vehicles recruit costs and decreasing marginal shortage cost which are more related to reality were taking in to consideration. Each model, this thesis researches the shortest distance routine model and the quickest routine model, as well as a mix model which is on the basis of the formal two models respectively. Demonstrated the applicability and effectiveness of this study through programming in Matlab, with allocating each emergency vehicle according to the biggest marginal contribution.