CAJ | 학술논문

通过用(1+1)演化算法和单只蚂蚁的蚁群算法分别解决给出的Bin函数,Trap函数,Jump函数,对实验结果进行了深入的对比和分析,得出单只蚂蚁的优化算法在很大程度上模拟了(1+1)演化算法,两种算法在解决Trap函数,Jump函数时都偏离最优值,以及随着信息素挥发因子的逐渐减小,单只蚂蚁算法求解拟布尔函数最优值的效率降低等结论.
통과용(1+1)연화산법화단지마의적의군산법분별해결급출적Bin함수,Trap함수,Jump함수,대실험결과진행료심입적대비화분석,득출단지마의적우화산법재흔대정도상모의료(1+1)연화산법,량충산법재해결Trap함수,Jump함수시도편리최우치,이급수착신식소휘발인자적축점감소,단지마의산법구해의포이함수최우치적효솔강저등결론.
We undertake several experimental analysis of the Single Ant ACO System and (1+1) evolutionary algorithm on several pseudo-boolean functions include Bin function, Trap function, Jump function. We analyze the results seriously and find that those cases where the Single Ant ACO system performs well, it basically simulates the (1+1) evolutionary algorithm. These two algorithms deviate from the optimal value in solving the Trap function, Jump function. And as the pheromone evaporation factor decreases, the effact of the 1-Ant Algorithm to solve the problem of Boolean fimctions is to be lower.