New heuristic function in ant colony system algorithm
NP-hard problem can be solved by Ant Colony System (ACS) algorithm.However, ACS suffers from pheromone stagnation problem, a situation when all ants converge quickly to one sub-optimal solution.ACS algorithm utilizes the value between nodes as heuristic value to calculate the probability of choosing...
Saved in:
| Main Authors: | , , , , |
|---|---|
| 格式: | Conference or Workshop Item |
| 語言: | English |
| 出版: |
2012
|
| 主題: | |
| 在線閱讀: | http://repo.uum.edu.my/6964/1/P6_-_ISSC2012.pdf http://repo.uum.edu.my/6964/ http://issc.uum.edu.my/index.php/ISSC2012/ISSC2012 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|