Aimming at the complexity of time constraint in vspfl,a vsp model with full loads is set up which takes into consideration the load time and load sequence producing the dynamic time windows.A heuristic algorithm based on the dynamic formation is developed.In this paper,the model and algorithm improve the process of common time windows of vsp with full load,produce a more realistic solution and the resulting efficiency is that satisfactory solution of minimizing the total cost can be quickly drawn by parameters adjusting and iterations.
霍佳震, 王新华. 一种考虑动态时间窗的满载问题模型及算法[J]. J4, 2006, 3(3): 277-.
HUO Jia-Zhen, WANG Xin-Hua. Model and Algorithm for Full Loads Vehicle Scheduling Problem with Dynamic Time Windows. J4, 2006, 3(3): 277-.