期刊文献+

基于混合遗传算法的车辆路径问题 被引量:1

Research in Vehicle Routing Problem Based on Hybrid Genetic Algorithm
下载PDF
导出
摘要 在详细分析遗传算法的局限性的基础上,构造了一种基于遗传算法和禁忌搜索算法相结合的、用于求解车辆路径问题的混合遗传算法.这种混合遗传算法主要是将禁忌搜索算法嵌入到遗传算法中的变异操作与最优解判定之间,可以有效地避免遗传算法易出现“早熟”收敛的问题.然后,分别用混合遗传算法和遗传算法对同一实例进行求解,并对求解结果进行对比分析.结果表明该混合遗传算法的求解结果比遗传算法收敛速度快,更加接近最优解. In the paper, after analyzing genetic algorithm's limit in detail, it forms a hybrid genetic algorithm to solve vehicle routing problem, which consists of genetic algorithm and tabu search algorithm. The key of the hybrid genetic algorithm is inserting tabu search algorithm into mutation operation and ablution determination of genetic algorithm. It can avoid genetic algorithm's "premature" convergence effectively. Then it solves the same example with genetic algorithm and the hybrid genetic algorithm, and compares their solutions. The results indicate that the hybrid genetic algorithm has better convergence rate, and its solution is much closer to optimal solution.
出处 《交通运输系统工程与信息》 EI CSCD 2006年第6期49-52,共4页 Journal of Transportation Systems Engineering and Information Technology
关键词 车辆路径问题 早熟 混合遗传算法 收敛 vehicle routing problem premature hybrid genetic algorithm convergence
  • 相关文献

参考文献1

  • 1李军,郭耀煌著..物流配送车辆优化调度理论与方法[M].北京:中国物资出版社,2001:216.

同被引文献7

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部