New heuristic function in ant colony system for the travelling salesman problem
Ant Colony System (ACS) is one of the best algorithms to solve NP-hard problems.However, ACS suffers from pheromone stagnation problem when all ants converge quickly on one sub-optimal solution.ACS algorithm utilizes the value between nodes as heuristic values to calculate the probability of choosi...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | Conference or Workshop Item |
| 言語: | English |
| 出版事項: |
2012
|
| 主題: | |
| オンライン･アクセス: | http://repo.uum.edu.my/6966/1/P10_-_ICCCT.pdf http://repo.uum.edu.my/6966/ http://www.gconference.net/eng/conference_view.html?no=35577&location=02&rDay=11012012 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|