计算机技术与发展
計算機技術與髮展
계산궤기술여발전
COMPUTER TECHNOLOGY AND DEVELOPMENT
2013年
5期
79-82
,共4页
二元蚁群算法%二元粒子群算法%组卷问题%时间性能对比分析
二元蟻群算法%二元粒子群算法%組捲問題%時間性能對比分析
이원의군산법%이원입자군산법%조권문제%시간성능대비분석
binary ant colony algotithm%binary particle swarm optimization%test paper problem%time performance analysis
二元蚁群优化算法(BACO-CA)及二元粒子群优化算法(BPSO-CA)作为基于概率的随机搜索智能算法,二者在寻优机理上有着显著的不同.以大规模组合优化问题组卷问题为例,通过设置算法中的参数,探讨二元蚁群优化算法和二元粒子群优化算法求解组卷问题性能的优劣.仿真实验表明,二元蚁群优化算法和二元粒子群优化算法虽然均能在多项式时间内完成组卷问题的求解,但二元粒子群优化算法在求解组卷问题时较二元蚁群优化算法具有更好的时间性能,能在较短的时间收敛到全局最优解.
二元蟻群優化算法(BACO-CA)及二元粒子群優化算法(BPSO-CA)作為基于概率的隨機搜索智能算法,二者在尋優機理上有著顯著的不同.以大規模組閤優化問題組捲問題為例,通過設置算法中的參數,探討二元蟻群優化算法和二元粒子群優化算法求解組捲問題性能的優劣.倣真實驗錶明,二元蟻群優化算法和二元粒子群優化算法雖然均能在多項式時間內完成組捲問題的求解,但二元粒子群優化算法在求解組捲問題時較二元蟻群優化算法具有更好的時間性能,能在較短的時間收斂到全跼最優解.
이원의군우화산법(BACO-CA)급이원입자군우화산법(BPSO-CA)작위기우개솔적수궤수색지능산법,이자재심우궤리상유착현저적불동.이대규모조합우화문제조권문제위례,통과설치산법중적삼수,탐토이원의군우화산법화이원입자군우화산법구해조권문제성능적우렬.방진실험표명,이원의군우화산법화이원입자군우화산법수연균능재다항식시간내완성조권문제적구해,단이원입자군우화산법재구해조권문제시교이원의군우화산법구유경호적시간성능,능재교단적시간수렴도전국최우해.
@@@@As a random search algorithm based on probability,the binary ant colony algorithm ( BACO-CA) and the binary particle swarm optimization (BPSO-CA) has the different optimization mechanism. Take the test paper for example,by setting the parameters of the algorithm,the performance of the BACO-CA and the BPSO-CA for the test paper problem was discussed. Experimental results show that the two algorithm can finish the group problem solving in polynomial time,but the BPSO-CA has the good performance,and can solve the test paper problem in polynomial time,and converge to the global optimal solution in a short time.
