.png){kind=icon}
返回
Dynamic ant colony optimisation
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-005-2370-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Ant Colony optimisation has proved suitable to solve static optimisation problems, that is problems that do not change with time. However in the real world changing circumstances may mean that a previously optimum solution becomes suboptimal. This paper explores the ability of the ant colony optimisation algorithm to adapt from the optimum solution for one set of circumstances to the optimal solution for another set of circumstances. Results are given for a preliminary investigation based on the classical travelling salesman problem. It is concluded that, for this problem at least, the time taken for the solution adaption process is far shorter than the time taken to find the second optimum solution if the whole process is started over from scratch.
Keyword:
meta-heuristics
optimisation
Ant Colony optimisation
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
Characterisation of a boundary between satellite III and aiphoid sequences on human chromosome 10
OAAI
OAAI分享收藏Recruitment and retention of African American patients for clinical research: An exploration of response rates in an urban psychiatric hospital.招募和保留非裔美国患者进行临床研究: 城市精神病医院响应率的探索。OAAI
OAAI分享收藏 没有更多内容
没有更多内容