Computer Engineering & Science >
A Study of the Logistic Distribution Routing Problem Based on the Improved Ant Colony Algorithm
Received date: 2009-05-27
Revised date: 2009-09-24
Online published: 2010-06-25
The ant colony algorithm solving the logistic distribution routing problem is prone to prematurity,stagnation and local optimum.In order to overcome this defect,a mixed algorithm of the MAXMIN ant system,chaos and mutation is proposed.In the simulation experiments,the maxmin ant algorithm,the mixed algorithm of the MAXMIN ant system and chaos,the mixed algorithm of the MAXMIN ant system and mutation,the mixed algorithm of the MAXMIN ant system,chaos and mutation are respectively adopted to solve the logistic distribution routing problem.Experiments show that the mixed algorithm of the MAXMIN ant system,chaos and mutation is better to enhance the global optimization capacity of the ant colony algorithm,as well as to achieve better results for the logistic distribution routing problem.
ZHANG Jianmin1,QIAHAN·Hezier2,GAO Dali3 . A Study of the Logistic Distribution Routing Problem Based on the Improved Ant Colony Algorithm[J]. Computer Engineering & Science, 2010 , 32(7) : 117 -119 . DOI: 10.3969/j.issn.1007130X.2010.
/
| 〈 |
|
〉 |