计算机工程
計算機工程
계산궤공정
COMPUTER ENGINEERING
2009年
21期
195-196,199
,共3页
蚂蚁系统算法%度约束最小生成树%蚁群系统算法
螞蟻繫統算法%度約束最小生成樹%蟻群繫統算法
마의계통산법%도약속최소생성수%의군계통산법
Ant System(AS) algorithm%Degree-Constrained Minimum Spanning Tree(DCMST)%Ant Colony System(ACS) algorithm
针对蚂蚁系统算法求解度约束最小生成树时收敛速度慢和早熟问题,提出一种改进的蚁群系统算法UDA-ACS.该算法在保留蚁群系统算法优点的基础上,通过增大能见度的影响力、采用动态负反馈机制和赋予不同初始信息索的方法解决上述问题.理论分析和实验结果证明,该算法的求解质量和速度比蚂蚁系统算法更优越.
針對螞蟻繫統算法求解度約束最小生成樹時收斂速度慢和早熟問題,提齣一種改進的蟻群繫統算法UDA-ACS.該算法在保留蟻群繫統算法優點的基礎上,通過增大能見度的影響力、採用動態負反饋機製和賦予不同初始信息索的方法解決上述問題.理論分析和實驗結果證明,該算法的求解質量和速度比螞蟻繫統算法更優越.
침대마의계통산법구해도약속최소생성수시수렴속도만화조숙문제,제출일충개진적의군계통산법UDA-ACS.해산법재보류의군계통산법우점적기출상,통과증대능견도적영향력、채용동태부반궤궤제화부여불동초시신식색적방법해결상술문제.이론분석화실험결과증명,해산법적구해질량화속도비마의계통산법경우월.
Aiming at the problems of slow converge-rate and precocity when using Ant System(AS) algorithm to solve Degree-Constrained Minimum Spanning Tree(DCMST) problem, this paper presents an improved algorithm named UDA-ACS(Unequal initial pheromone strategy, Dynamic negative feedback mechanism, Adequately augment the effect of visibility-Ant Colony System). It retains the advantages of Ant Colony System(ACS) algorithm, and adopts the method of augmenting the effect of visibility, dynamic negative feedback mechanism and giving with unequal initial pheromone. Theory analysis and experimental result prove that it gains better solving quality and higher speed than AS algorithm.
