.png){kind=icon}
Return
Dynamic ant colony optimisation
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-005-2370-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
meta-heuristics
optimisation
Ant Colony optimisation
Journal
IF:
3.5
Papers:
7.6K
Citations:
1.7W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveCharacterisation of a boundary between satellite III and aiphoid sequences on human chromosome 10
OAAI
OAAIShareSave no more
no more