arrow
返回

An improved ant colony optimization algorithm for solving a complex combinatorial optimization problem

delete2010-03-01
delete96
PRE
AI
Y
Yang, Jingan *
Z
Zhuang, Yanbin
DOI:10.1016/j.asoc.2009.08.040delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This paper presents an improved ant colony optimization algorithm (IACO) for solving mobile agent routing problem. The ants cooperate using an indirect form of communication mediated by pheromone trails of scent and find the best solution to their tasks guided by both information (exploitation) which has been acquired and search (exploration) of the new route. Therefore the premature convergence probability of the system is lower. The IACO can solve successfully the mobile agent routing problem, and this method has some excellent properties of robustness, self-adaptation, parallelism, and positive feedback process owing to introducing the genetic operator into this algorithm and modifying the global updating rules. The experimental results have demonstrated that IACO has much higher convergence speed than that of genetic algorithm (GA), simulated annealing (SA), and basic ant colony algorithm, and can jump over the region of the local minimum, and escape from the trap of a local minimum successfully and achieve the best solutions. Therefore the quality of the solution is improved, and the whole system robustness is enhanced. The algorithm has been successfully integrated into our simulated humanoid robot system which won the fourth place of RoboCup2008 World Competition. The results of the proposed algorithm are found to be satisfactory. (C) 2009 Elsevier B.V. All rights reserved.
Keyword:
Ant colony optimization
Combinatorial optimization problem
Mobile agent routing problem
Premature convergence probability
Traveling salesman problems
Simulated annealing
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Applied Soft Computing 封面图
Applied Soft Computing
IF:
6.6
论文数:
1.4W
被引数:
4.8W

机构

H
hefei university of technology
学者数:
2.5W
论文数: 1.7W
被引数: 35
C
Changzhou Institute of Technology
学者数:
1.3K
论文数: 1.1K
被引数: 994
引用论文

引用论文

err分享
err收藏
err分享
err收藏
Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment
err2008-01-01
err165
PREAI
errLee, Zne-Jung; Su, Shun-Feng; Chuang, Chen-Chia; Liu, Kuan-Hung
err分享
err收藏
学者 查看更多内容