Orthogonal crossover cuckoo search algorithm with external archive

被引:0
作者
Wang, Lijin [1 ,2 ]
Zhong, Yiwen [1 ]
Yin, Yilong [2 ,3 ]
机构
[1] College of Computer and Information Sciences, Fujian Agriculture and Forestry University, Fuzhou
[2] School of Computer Science and Technology, Shandong University, Jinan
[3] School of Computer Science and Technology, Shandong University of Finance and Economics, Jinan
来源
Jisuanji Yanjiu yu Fazhan/Computer Research and Development | 2015年 / 52卷 / 11期
关键词
Cuckoo search algorithm; External archive; Function optimization problems; Orthogonal crossover; Orthogonal experimental design (OED);
D O I
10.7544/issn1000-1239.2015.20148042
中图分类号
学科分类号
摘要
Cuckoo search algorithm is a new population-based optimization technique inspired by the obligate brood parasitic behavior of some cuckoo species. It searches new solutions by iteratively using Lévy flights random walk and Biased random walk, which employs a mutation and crossover operators respectively. In Biased random walk, the crossover operator with random search schema will be a certain blindness or inefficiency, resulting in weakening the search ability of cuckoo search algorithm. Thus, this paper proposes an orthogonal crossover cuckoo search algorithm with external archive (OXCS). By being embedded in Biased random walk, the orthogonal crossover operator, which is an efficient search schema, is employed to enhance the crossover operator schema so as to polish the search ability of cuckoo search algorithm. The proposed algorithm also utilizes an external archive, which maintains the historical information of population within a certain period, to provide one parent-individual for the orthogonal crossover operator in order to improve the diversity. The comprehensive experiments are carried out on 24 benchmark functions in comparison with other algorithms. The results demonstrate the proposed strategies can improve the search ability of cuckoo search algorithm, and enhance the convergence speed and the solution quality of the algorithm for the continuous function optimization problems effectively. © 2015, Science Press. All right reserved.
引用
收藏
页码:2496 / 2507
页数:11
相关论文
共 37 条
[1]  
Holland J.H., Adaptation in Natural and Artificial Systems, (1975)
[2]  
Kennedy J., Eberhart R.C., Particle swarm optimization, Proc of the IEEE Int Conf on Neural Networks, pp. 1942-1948, (1995)
[3]  
Eberhart R.C., Kennedy J., A new optimizer using particle swarm theory, Proc of the 6th Int Symp on Micro Machine and Human Science, pp. 39-43, (1995)
[4]  
Dorigo M., Maniezzo V., Colorni A., The ant system: Optimization by a colony of cooperating agents, IEEE Trans on Systems, Man, and Cybernetics, Part B, 26, 1, pp. 29-41, (1996)
[5]  
Storn R., Price K., Differential evolution: A simple and efficient heuristic for global optimization over continuous spaces, Journal of Global Optimization, 11, 4, pp. 341-359, (1997)
[6]  
Karaboga D., An idea based on honey bee swarm for numerical optimization, TR-06, (2005)
[7]  
Yang X., A new metaheuristic bat-inspired algorithm, Proc of Nature Inspired Cooperative Strategies for Optimization (NICSO 2010), Studies in Computational Intelligence, pp. 65-74, (2010)
[8]  
Yang X., Nature-Inspired Metaheuristic Algorithms, (2010)
[9]  
Geem Z.W., Kim J.H., Loganathan G.V., A new heuristic optimization algorithm: Harmony search, Simulation, 76, 2, pp. 60-68, (2001)
[10]  
Simon D., Biogeography-based optimization, IEEE Trans on Evolutionary Computation, 12, 6, pp. 702-713, (2008)