摘要
蚁群算法是一种用来在图中寻找优化路径的机率型算法，由于蚁群算法的多样性和反馈性会有可能过早的收敛于局部最优解，这样得到的最优解精度不高，该文改进了这一点，取开始的各条路径信息量为最大，让每条路径都有遍历，从而得到准确的最优解而不是局部最优解。对准确性方面进行了比较，得出改进后的算法是确实可行的。
Ant colony optimization is a diagram is used to find the probability of path-based optimization algorithm. Due to the diversity and the feedback of AOC may be premature convergence to local optimal solution. But the optimal solution are not high accuracy. In this paper, this is improved. From the beginning of each path for the largest amount of information. Let each path have the traversal. In order to obtain accurate optimal solution rather than the local optimal solution. Compared the accuracy. The result the improved algorithm is feasible.
作者
李瑞
韩永祥
LI Rui, HAN Yong-xiang （Dalian Jiao Tong University, Liaoning 116028, China）
出处
《电脑知识与技术》
2009年第8期6290-6291,共2页
Computer Knowledge and Technology
关键词
蚁群算法
配货发送
最优解
ant colony optimization
distribution send
Optimal solution
