The study of Optimized models and algorithms of Dynamic Fleet Scheduling Problem
The road freight enterprises face the severe questions of the higher empty-loading ratio of vehicles.How to improve their managing level,to organize and schedule vehicle effectively,to low the running cost of the enterprises and strengthen core advantages has been an urge problem to governors of road transport.The paper makes use of Dynamic Programming theory,and designs relevant dynamic scheduling models aim to the fleets which own single vehicle-type or multiple types in the sense of making optimize the mission plan as a breakthrough.Secondly,the paper also designs the improved genetic algorithm to get the results.Successively,the paper farther brings forward the rolling horizon scheduling algorithm for the dynamic fleet scheduling management.At last,the paper develops a simulated platform for the rolling horizon scheduling of the dynamic fleet management,and tests the algorithm with the data of one transport enterprise of Shandong Province.The results can prove that the algorithms in the paper is effective and practicable,owning the important value for actual applications.
empty-loading ratio Dynamic Scheduling management Genetic Algorithm rolling horizon scheduling
Yaohua Wu Wumei Zhang Li Liao
The Logistics Institute Shandong University Jinan,Shandong Province,China
国际会议
2007 IEEE International Conference on Automation and Lofistics
山东济南
英文
2007-08-18（万方平台首次上网日期，不代表论文的发表时间）