版權說明 操作指南
首頁 > 成果 > 詳情

新型蟻群算法在TSP問題中的應用

認領
導出
Link by 中國知網學術期刊 Link by 維普學術期刊
反饋
分享
QQ微信 微博
成果類型:
期刊論文
論文標題(英文):
Application of self-adaptive ant colony optimization in TSP
作者:
張弛;涂立;王加陽
通訊作者:
Zhang, Chi
作者機構:
[張弛; 王加陽] School of Information Science and Engineering, Central South University, Changsha, China
[涂立; 張弛] School of Information Science and Engineering, Hunan City University, Yiyang, China
通訊機構:
School of Information Science and Engineering, Central South University, Changsha, China
語種:
中文
關鍵詞:
蟻群算法(ACA);輪盤賭;信息素;差分演化;災變
關鍵詞(英文):
Ant colony algorithm (ACA);Convulsions;Differential evolution;Pheromones;Roulette
期刊:
中南大學學報. 自然科學版
期刊(英文):
Zhongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Central South University (Science and Technology)
ISSN:
1672-7207
年:
2015
卷:
46
期:
8
頁碼:
2944-2949
基金類別:
湖南省教育科學“十二五”規劃課題(XJK014CGD013); 益陽市科技計劃項目(2014JZ52)~~;
機構署名:
本校為其他機構
院系歸屬:
信息與電子工程學院
摘要:
針對傳統的螞蟻算法容易出現早熟和停滯現象,提出一種新型螞蟻算法(new ant colony algorithm,NACA),即將轉移規則、全局信息素災變規則和局部混合調整信息素規則。選擇幾個典型TSP問題進行實驗。研究結果表明:新型螞蟻算法一方面提高了算法種群的多樣性,同時將輪盤賭算子利用到城市轉移規則中,有利于提高算法的收斂速度;另一方面,將種群個體的差分信息應用于局部信息素更新規則中,有利于搜索全局解;最后災變算子避免算法陷入局部最優,而達到全局最優。新型的蟻群算法具有更強的搜索全局最優解的能力以及更好的穩定性和收斂性,同時為解決其他優化問題提供新的思路。
摘要(英文):
Considering that there exists precocious and stagnation behavior phenomenon about the traditional ant algorithm, a new ant colony algorithm(NACA) was proposed, i.e. the transition rule, convulsions rule of global pheromones and the mixing adjustment rule of local pheromones were mixed. The results show that on one hand, NACA enhances genetic algorithms population diversity and at the same time the roulette operator is used in translative rules, whch is beneficial to improving the convergence speed. On the other hand, the individual differential information is used in the updated rule of local pheromones, which is good for searching the global solution. Finally, the cataclysm operator avoids falling into local optimum, and leads to reach the global optimum. NACA has stronger ability to search the global optimal solution and better stability and astringency. It also provides a new idea for solving other combinational optimization problems. ©, 2015, Central South University of Technology. All right reserved.

反饋

驗證碼:
看不清楚,換一個
確定
取消

成果認領

標題:
用戶 作者 通訊作者
請選擇
請選擇
確定
取消

提示

該欄目需要登錄且有訪問權限才可以訪問

如果您有訪問權限,請直接 登錄訪問

如果您沒有訪問權限,請聯系管理員申請開通

管理員聯系郵箱:yun@hnwdkj.com

亚洲熟伦熟女专区