带道路容量动态约束的关联运输调度问题

Incident vehicle routing problem with road capacity dynamic constraint

介绍了混沌遗传算法的基本原理,并对其进行改进,自适应地调整交叉概率和变异概率,引进了模拟退火机制,用聚类分析及改进的算法对多车场的关联运输调度问题进行求解,然后与遗传算法求解此模型的结果相比较。实例证明该算法求解关联运输调度问题是可行的,且优于传统的遗传算法。

The fundamental principle of CGA （Chaos Genetic Algorithm） was introduced and modified, adjusting self-adaption crossover probability and mutation probability, moreover, simulated annealing mechanism was brought in the algorithm, and then cluster analysis and the modified algorithm were applied to solve multi-depot IVRP（Incident Vehicle Routing Problem）. At the same time, Genetic Algorithm （GA） was applied too. The result shows that CGA is flexible to solve IVRP, and it＇s better than GA dur-ing the optimization process.