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...
保存先:
| 主要な著者: | , , , , |
|---|---|
| フォーマット: | 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 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|