求解装卸混合车辆路径问题的模拟退火遗传算法  

A Novel Simulated Annealing Genetic Algorithm for Solving the Vehicle Routing Problem with Backhaul

作　　者：冯雪[1] 裴志松[1] 

机构地区：[1]长春工业大学人文信息学院,吉林长春130122

出　　处：《计算机测量与控制》2011年第8期2013-2015,共3页Computer Measurement &Control

基　　金：吉林省高等教育教学研究课题(吉教高字2010第26号)

摘　　要：提出一种改进的模拟退火遗传算法来求解装卸混合车辆路径问题;通过使用模拟退火变异策略来增强遗传算法的局部搜索能力,从而改善遗传算法的"早熟"问题,使算法有能力避免陷入局部极值而快速收敛于全局最优解;仿真实验结果表明了所提算法求解装卸混合车辆路径问题的有效性与适用性。A novel simulated annealing genetic algorithm for solving the vehicle routing problem with backhaul （VRPB） was proposed. The local search ability of genetic algorithm was enhanced and genetic algorithm ＂premature＂ problem was improved by using mutation strategy with simulated annealing, and the capacity of algorithm was improved to avoid the local extreme and to converge to the global optimal solution quickly. Results of the numerical experiment show that the proposed algorithm is effective and useful in solving VRPB.

关 键 词：模拟退火算法 遗传算法 退火遗传算法 卸混合车辆路径问题 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]