The Cuckoo Search Algorithm Based on Dynamic Grouping to Adjust Flight Scale

Article Preview

Abstract:

The cuckoo search (CS) algorithm is a very efficient swarm optimization algorithm. Based on CS, a cuckoo search algorithm based on dynamic grouping to adjust flight scale (DGCS) is proposed: All cuckoos are divided into three groups according to the fitness of the individual and the average fitness of the population, then different flight scale is adopted dynamically for each group. Simulation experiments show that the DGCS can quickly converge to the global optimum solution, and has better optimization performance.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1822-1826

Citation:

Online since:

March 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] D. E. Goldberg. Genetic algorithm in search, optimization and machine learning [M]. Boston: Addison-Wesley Longman Publishing co. Inc, (1989).

Google Scholar

[2] M. Dorigo, E. Bonabeaue, G. Theraulaz. Ant algorithms and stigmergy [J]. Future Generation Computer System, 2000, 16(8): 851-871.

DOI: 10.1016/s0167-739x(00)00042-x

Google Scholar

[3] J. Kennedy, R. Eberhart. Particle swarm optimization[C]. Proc IEEE Int. Conf. on Neural Networks, Australia: Perth, 1995: 1942-(1948).

Google Scholar

[4] X. S. Yang, S. Deb. Cuckoo search via Lévy flight[C]/Proceeding of World Congress on nature & Biologically Inspired Computing, India: IEEE Publications, 2009: 210-214.

DOI: 10.1109/nabic.2009.5393690

Google Scholar

[5] X. S. Yang, S. Deb. Engineering optimization by cuckoo search [J]. Int. J Math Modeling & Num. Optimization, 2010(4): 330-343.

Google Scholar

[6] W. Fan, H. Xing-shi, W. Yan, The Cuckoo Search Algorithm Based on Gaussian Disturbance, " Journal of Xi, an Polytechnic University, Vol. 25, No. 4, 2011, pp.566-569.

Google Scholar

[7] S. Walton, O. Hassan, K. Morgan, M. R. Brown. Modified cuckoo search: A new gradient free optimization algorithm[J]. Chaos, Solitons & Fractals, 2011, 44: 710-718.

DOI: 10.1016/j.chaos.2011.06.004

Google Scholar

[8] R.N. Mantegna. Fast, accurate algorithm for numerical simulation of Lévy stable stochastic processes [J]. Physical Review E, 1994, 5(49): 4677-4683.

DOI: 10.1103/physreve.49.4677

Google Scholar

[9] R.N. Mantegna. Lévy walks and enhanced diffusion in Milan stock exchange [J]. Physica A. 1991, 179: 232-242.

DOI: 10.1016/0378-4371(91)90061-g

Google Scholar

[10] X.S. Yang, S. Deb: Cuckoo search: recent advances and applications. Neural Computing and Application. 1-6(2013).

Google Scholar

[11] X.S. Yang, S. Deb. (2013). Multiobjective cuckoo search for design optimization, Computer & Operations Research, Vol. 40, No. 6, pp.1616-1624.

DOI: 10.1016/j.cor.2011.09.026

Google Scholar

[12] X.S. Yang . Nature-Inspired Metaheuristic Algorithms, 2nd Edition, Luniver Press, (2010).

Google Scholar

[13] Haoyang Wu, Changchun Zhu: Adaptive genetic algorithm to improve group premature convergence, Journal of Xi'An Jiao Tong University. 33(11), 27-32(1999).

Google Scholar