Artificial bee colony algorithm based on dynamic wholly updating and tentative mechanism
LI Jing-fub · Jisuanji yingyong yanjiu · 2011
Artificial bee colony(ABC)algorithm has been proven to be a better heuristic algorithm compared with other evolution algorithms.however,ABC has little advantage when used to optimize nonseparable functions.In order to balancing single dimesnsion updating(SDU)stage and wholly updating(WU) stage for avoiding local optimization,proposed a hybrid algorithm named artificial bee colony algorithm particle swarm optimization(ABCPSO) to implement the two stages by turns and balance the exploitation depths of the two stages by controlling the parameter 'limit' dynamically in line with the success rate of SDU stage.In the WU stage,adopted a tentative PSO for avoiding colony flying toward wrong direction.The results on the benchmark functions show the effectiveness of the proposed algorithm.