计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (27): 210-212.DOI: 10.3778/j.issn.1002-8331.2009.27.064

• 工程与应用 • 上一篇    下一篇

求解军车调度问题的双重约束编码遗传算法

谢昭莉,蒲兴荣,尹 刚,刘 亮   

  1. 重庆大学 自动化学院,重庆 400044
  • 收稿日期:2009-02-09 修回日期:2009-04-16 出版日期:2009-09-21 发布日期:2009-09-21
  • 通讯作者: 谢昭莉

Dual-bound encoding genetic algorithm for corps vehicle scheduling problem

XIE Zhao-li,PU Xing-rong,YIN Gang,LIU Liang   

  1. College of Automation,Chongqing University,Chongqing 400044,China
  • Received:2009-02-09 Revised:2009-04-16 Online:2009-09-21 Published:2009-09-21
  • Contact: XIE Zhao-li

摘要: 依据某部队车场车辆调度的实际情况,建立了考虑卸货时间因素的带硬时间窗车辆调度问题的数学模型;针对该模型,提出了一种基于载重量和时间窗双重约束条件的编码方式,并改进了交叉、变异算子,到达了全局寻优,避免了遗传算法的早熟收敛。仿真结果表明:改进的算法提高了计算效率,能缩短车辆行驶总里程,满足军车调度在时间上的严格要求。

关键词: 双重约束, 遗传算法, 全局寻优, 军车调度

Abstract: According to the situation of corps vehicle scheduling,establish the mathematical model of the vehicle scheduling problem with a hard time window which considers the unloading time factor.As to the model,this paper proposes an encoding based on the dual-bound of dead weight and time windows,and improves the cross operator and the mutation operator,reaches the global optimization and avoids the premature convergence.The simulation results indicate that the algorithm improves the efficiency of computing and reduces the total mileage of vehicles and meets the stringent time requirement of the corps vehicle scheduling.

Key words: dual-bound, genetic algorithm, global optimization, corps vehicle scheduling

中图分类号: