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

Dual-bound encoding genetic algorithm for corps vehicle scheduling problem

作　　者：谢昭莉[1] 蒲兴荣[1] 尹刚[1] 刘亮[1] 

机构地区：[1]重庆大学自动化学院,重庆400044

出　　处：《计算机工程与应用》2009年第27期210-212,223,共4页Computer Engineering and Applications

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

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

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]