摘要
有时间窗的军事运输车辆调度问题是组合优化中的NP完全难题。针对军事运输的强时效性的特点,用数学建模的方法建立了模型,并设计了遗传算法进行求解。实例表明:用遗传算法可以方便有效地求出军事运输车辆调度问题的近似最优解。
The military transport vehicle scheduling problem restrained by time windows is a NP-complete hard problem of combinatorial optimization realm.According to the strong characteristic of military transport age,this paper sets up the mathematic model and adopts genetic algorithm to solve it. The case,illustrated in the paper,demonstrates that the approximate optimal solution to the military transport vehicle scheduling problem can be easily and effectively obtained by using genetic algorithm.
出处
《军事交通学院学报》
2010年第5期76-79,共4页
Journal of Military Transportation University
关键词
军事运输
车辆调度模型
遗传算法
时间窗
military transport
vehicle scheduling model
genetic algorithm
time windows