摘要
提出一种基于遗传算法的求解清运车队车辆路径优化问题方法.对具有时间约束的路径采用整数编码,并利用AOE网验证其有效性.利用多分组多目标交叉进化方法,对具有不同适应度值的分组个体采用不同交叉算子,提高算法进化速度和搜索范围.仿真结果表明,算法可行有效.
An approach to optimize the vehicle routing problem of trash-hauling convoys based on genetic algorithm was proposed .Integer code was adopted for the routing with time constrained .AOE network was used to verify the routing availability .A genetic algorithm containing multi object cross operator was used to improve the evolution speed and the scope of the search .Different cross operator was used by individuals in groups with different fitness values .Simulation results showed that the algorithm was feasible and effective .
出处
《吉林师范大学学报（自然科学版）》
2015年第3期132-134,138,共4页
Journal of Jilin Normal University:Natural Science Edition
基金
吉林省教育厅"十二五"科学技术研究项目(吉教科合字[2011]第162号)
关键词
多精英
协同进化
时间窗
车辆路径问题
multi-elite
coevolution
time window
vehicle routing problem
