An adaptive stochastic search algorithm with hybrid strategy(HASS)is presented to improve the low search efficiency and the incompetitive optimization of the free search algorithm and the adaptive stochastic search algorithm(ASS). The algorithm is based on group founding and joining behaviors that exist widely in nature. The strategy to adaptively update the search radius of each individual is used to improve the search efficiency
and a hybrid search strategy is designed to guide different particles to respectively conduct global or local searches. A new mutation operator is introduced to the evolutionary state estimation of the involved particles to improve the population diversity and to avoid premature convergence effectively. The main differences between HASS and ASS are in selection mechanism of solutions and the search strategy. The experimental results on twelve classic benchmark functions show that the HASS algorithm has competitive performance to other four existing algorithms in terms of accuracy
robustness and convergence speed
especially for high-dimensional multimodal problems.
关键词
Keywords
references
KENNEDY J, EBERHART R, SHI Y H. Swarm intelligence [M]. San Mateo, CA, USA: Morgan Kaufmann, 2001.
XIAO Renbin, TAO Zhenwu. Research progress of swarm intelligence [J]. Journal of Management Sciences in China, 2007, 10(3): 80-96.
DORIGO M, BLUM C. Ant colony optimization theory: a survey [J]. Theoretical Computer Science, 2005, 344(2/3): 243-278.
EBERHART R, KENNEDY J. A new optimizer using particle swarm theory [C]∥Proceedings of the 6th International Symposium on Micro Machine and Human Science. Piscataway, NJ, USA: IEEE, 1995: 39-43.
DORIGO M, BONABEAU E, THERAULAZ G. Ant algorithms and stigmergy [J]. Future Generation Computer Systems, 2000, 16(8): 851-871.
CARLOS A, SEBASTIAN L. A particle swarm optimization algorithm for part-machine grouping [J] Robotics and Computer-Integrated Manufacturing, 2006, 22(5/6): 468-474.
PENEV K, LITTLEFAIR G. Free search: a comparative analysis [J]. Information Sciences, 2005, 172(1/2): 173-193.
ZHOU Hui, LI Danmei, SHAO Shihuang, et al. Novel swarm intelligence algorithm and its improvement [J]. Systems Engineering and Electronics, 2008, 30(2): 337-340.
HOLLAND J H. Adaptation in natural and artificial systems [M]. Cambridge, USA: MIT Press, 1992: 6-24.
LI Tuanjie, CAO Yuyan, SUN Guoding. Free search algorithm with the variable neighbourhood and step [J]. Journal of Xidian University, 2010, 37(4): 737-742.
LIU Changjun, WEI Junhu, QIAO Yan, et al. An adaptive stochastic search algorithm [C]∥Proceedings of the 2011 IEEE International Conference on Automation and Logistics. Piscataway, NJ, USA: IEEE, 2011: 154-158.
BAMARD C J, SIBLY R M. Producers and scroungers: a general model and its application to captive flocks of house sparrows [J]. Animal Behaviour, 1981, 29(5): 543-550.
GIRALDEAU L A, BEAUCHAMP G. Food exploitation: searching for the optimal joining policy [J]. Trends in Ecology and Evolution, 1999, 14(3): 102-106.
CLARK C W, MANGEL M. Foraging and flocking strategies: information in an uncertain environment [J]. American Naturalist, 1984, 12(3): 626-641.
LI Xiaodong, YAO Xin. Cooperatively coevolving particle swarms for large scale optimization [J]. IEEE Transactions on Evolutionary Computation, 2012, 16(2): 210-224.
LIANG J J, QIN A K, SUGANTHAN P N, et al. Comprehensive learning particle swarm optimizer for global optimization of multimodal functions [J]. IEEE Transactions on Evolutionary Computation, 2006, 10(3): 281-295.
ZHAN Zhihui, ZHANG Jun, LI Yun, et al. Adaptive particle swarm optimization [J]. IEEE Transactions on Systems, Man, and Cybernetics: Part B Cybernetics, 2009, 39(6): 1362-1381.
HOUCK C R, JOINES J, KAY M. A genetic algorithm for function optimization: a MATLAB implementation, NCSU-IE TR 95-09[R]. Raleigh, North Carolina, USA: North Carolina State University, 1995.
BIRGE B. PSOt: a particle searm optimization toolbox for use with MATLAB [C]∥Proceedings of the 2003 IEEE Swarm Intelligence Symposium. Piscataway, NJ, USA: IEEE, 2003: 182-186.