| 求解带软时间窗车辆路径问题的融合算法 |
| |
| 引用本文： | 吴正成,文中华,黄丽芳.求解带软时间窗车辆路径问题的融合算法[J].计算机应用研究,2012,29(11):4028-4030. |
| |
| 作者姓名： | 吴正成 文中华 黄丽芳 |
| |
| 作者单位： | 湘潭大学 信息工程学院,湖南 湘潭,411105 |
| |
| 基金项目： | 国家自然科学基金资助项目; 湖南省自然科学基金资助项目 |
| |
| 摘 要： | 设计了遗传算法与变异蚂蚁算法的一个融合算法,该算法采用优良基因保护策略,引入蚂蚁寻径变异机制,并改进了信息素的更新方式,提高了寻径速度以及寻径的全局性。经过对比实验,验证了本融合算法可以有效而快速地获得问题模型的最优解或近似最优解。
|
| 关 键 词： | 带软时间窗车辆路径问题 遗传算法 变异蚂蚁算法 融合算法 |
Fusion algorithm for vehicle routing problem with soft time windows |
| |
| WU Zheng-cheng,WEN Zhong-hu,HUANG Li-fang.Fusion algorithm for vehicle routing problem with soft time windows[J].Application Research of Computers,2012,29(11):4028-4030. |
| |
| Authors: | WU Zheng-cheng WEN Zhong-hu HUANG Li-fang |
| |
| Affiliation: | College of Information Engineering, Xiangtan University, Xiangtan Hunan 411105, China |
| |
| Abstract: | This paper designed a fusion optimization algorithm of genetic algorithm and mutated ant colony algorithm. It used the excellent gene protection strategy and introduced a mutation mechanism and improved the pheromone updating methods, to improve the speed to search routing path and solve global ability. After experiments, the results verify this algorithm can obtain problem optimal solution or approximate optimal solution effectively and quickly. |
| |
| Keywords: | vehiele routing problem with soft time windows genetic algorithm mutated ant colony algorithm fusion algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
|
