| 基于混合蚂蚁算法的物流配送路径优化问题研究 |
| |
| 引用本文： | 柳林,朱建荣.基于混合蚂蚁算法的物流配送路径优化问题研究[J].计算机工程与应用,2006,42(13):203-205,221. |
| |
| 作者姓名： | 柳林 朱建荣 |
| |
| 作者单位： | 长沙理工大学计算机与通信工程学院,长沙,410076 |
| |
| 摘 要： | 论文针对物流配送路径优化问题,提出了一种混合蚂蚁算法,以克服单用蚂蚁算法求解问题时间复杂度过大的难点,论文还研究了该算法解的二次优化方法以更适合实际需要。实验表明该算法运行效果好。
|
| 关 键 词： | 物流配送 优化 混合蚂蚁算法 |
| 文章编号： | 1002-8331-（2006）13-0203-03 |
| 收稿时间： | 2005-01 |
| 修稿时间： | 2005-01 |
Study of the Optimizing of Physical Distribution Routing Problem Based on Mixed Ants Algorithm |
| |
| Liu Lin,Zhu Jianrong.Study of the Optimizing of Physical Distribution Routing Problem Based on Mixed Ants Algorithm[J].Computer Engineering and Applications,2006,42(13):203-205,221. |
| |
| Authors: | Liu Lin Zhu Jianrong |
| |
| Affiliation: | College of Computer and Telecommunication Engineering,Changsha University of Technology,Changsha 410076 |
| |
| Abstract: | Aimed to overcome the disadvantages of time complexity about the ants algorithm,this paper proposes a mixed ants algorithm for solving the physical distribution routing problem which can optimize the solution for the second time and make it suit to the practice.This algorithm is effective by a number of experiment which is proved. |
| |
| Keywords: | physical distribution optimizing mixed ants algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
