研究了应用于连续空间优化问题的蚁群算法,给出了信息素的留存方式以及搜索策略.另外,针对蚁群算法易陷入局部最优的缺点,在最优蚂蚁周围进行了精细搜索,并加入了自适应的交叉变异算子,从而改进了蚁群算法的全局优化性能.数值仿真结果表明,该算法是一种有效的优化算法.
The ant colony optimization (ACO) algorithm for solving optimization problems in continuous space investigated. Both the remaining way of pheromone and the searching strategy are presented. Moreover, the shortcoming it that ACO easily trapped into local optimum improved by carrying out fine searching near the best ant and by adding the crossover and mutation operator so that the global optimization performance of ACO enhanced. The numerical simulation results demonstrate that the proposed algorithm is effective.