Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014 (2014), Article ID 497514, 20 pages
http://dx.doi.org/10.1155/2014/497514
Research Article

A Cuckoo Search Algorithm for Multimodal Optimization

Departamento de Electronica, Universidad de Guadalajara, CUCEI, Avenida Revolución 1500, 44430 Guadalajara, JAL, Mexico

Received 23 April 2014; Accepted 5 May 2014; Published 22 July 2014

Academic Editor: Xin-She Yang

Copyright © 2014 Erik Cuevas and Adolfo Reyna-Orta. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. P. M. Pardalos, H. E. Romeijn, and H. Tuy, “Recent developments and trends in global optimization,” Journal of Computational and Applied Mathematics, vol. 124, no. 1-2, pp. 209–228, 2000. View at Publisher · View at Google Scholar · View at Scopus
  2. C. A. Floudas, I. G. Akrotirianakis, S. Caratzoulas, C. A. Meyer, and J. Kallrath, “Global optimization in the 21st century: advances and challenges,” Computers & Chemical Engineering, vol. 29, no. 6, pp. 1185–1202, 2005. View at Publisher · View at Google Scholar · View at Scopus
  3. Y. Ji, K.-C. Zhang, and S.-J. Qu, “A deterministic global optimization algorithm,” Applied Mathematics and Computation, vol. 185, no. 1, pp. 382–387, 2007. View at Publisher · View at Google Scholar · View at Scopus
  4. A. Georgieva and I. Jordanov, “Global optimization based on novel heuristics, low-discrepancy sequences and genetic algorithms,” European Journal of Operational Research, vol. 196, no. 2, pp. 413–422, 2009. View at Publisher · View at Google Scholar · View at Scopus
  5. D. Lera and Y. D. Sergeyev, “Lipschitz and Hölder global optimization using space-filling curves,” Applied Numerical Mathematics, vol. 60, no. 1-2, pp. 115–129, 2010. View at Publisher · View at Google Scholar · View at Scopus
  6. L. J. Fogel, A. J. Owens, and M. J. Walsh, Artificial Intelligence through Simulated Evolution, John Wiley & Sons, Chichester, UK, 1966.
  7. K. de Jong, Analysis of the behavior of a class of genetic adaptive systems [Ph.D. thesis], University of Michigan, Ann Arbor, Mich, USA, 1975.
  8. J. R. Koza, “Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems,” Tech. Rep. STAN-CS-90-1314, Stanford University, Stanford, Calif, USA, 1990. View at Google Scholar
  9. J. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, Mich, USA, 1975.
  10. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Boston, Mass, USA, 1989.
  11. L. N. de Castro and F. J. von Zuben, “Artificial immune systems—part I: basic theory and applications,” Tech. Rep. TR-DCA 01/99, 1999. View at Google Scholar
  12. R. Storn and K. Price, “Differential evolution-a simple and efficient adaptive scheme for global optimisation over continuous spaces,” Tech. Rep. TR-95-012, ICSI, Berkeley, Calif, USA, 1995. View at Google Scholar
  13. S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Google Scholar · View at Scopus
  14. S. I. Birbil and S.-C. Fang, “An electromagnetism-like mechanism for global optimization,” Journal of Global Optimization, vol. 25, no. 3, pp. 263–282, 2003. View at Publisher · View at Google Scholar · View at Scopus
  15. E. Rashedi, H. Nezamabadi-Pour, and S. Saryazdi, “Filter modeling using gravitational search algorithm,” Engineering Applications of Artificial Intelligence, vol. 24, no. 1, pp. 117–122, 2011. View at Publisher · View at Google Scholar · View at Scopus
  16. J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948, December 1995. View at Scopus
  17. M. Dorigo, V. Maniezzo, and A. Colorni, “Positive feedback as a search strategy,” Tech. Rep. 91-016, Politecnico di Milano, Milano, Italy, 1991. View at Google Scholar
  18. S. Dasa, S. Maity, B.-Y. Qu, and P. N. Suganthan, “Real-parameter evolutionary multimodal optimization—a survey of the state-of-the-art,” Swarm and Evolutionary Computation, vol. 1, no. 2, pp. 71–78, 2011. View at Publisher · View at Google Scholar · View at Scopus
  19. K.-C. Wong, C.-H. Wu, R. K. P. Mok, C. Peng, and Z. Zhang, “Evolutionary multimodal optimization using the principle of locality,” Information Sciences, vol. 194, pp. 138–170, 2012. View at Publisher · View at Google Scholar · View at Scopus
  20. D. Beasley, D. R. Bull, and R. R. Matin, “A sequential niche technique for multimodal function optimization,” Evolutionary Computation, vol. 1, no. 2, pp. 101–125, 1993. View at Publisher · View at Google Scholar
  21. B. L. Miller and M. J. Shaw, “Genetic algorithms with dynamic niche sharing for multimodal function optimization,” in Proceedings of the 3rd IEEE International Conference on Evolutionary Computation, pp. 786–791, May 1996. View at Scopus
  22. R. Thomsen, “Multimodal optimization using crowding-based differential evolution,” in Proceedings of the Congress on Evolutionary Computation (CEC '04), pp. 1382–1389, June 2004. View at Scopus
  23. S. W. Mahfoud, Niching methods for genetic algorithms [Ph.D. thesis], Illinois Genetic Algorithm Laboratory, University of Illinois, Urbana, Ill, USA, 1995.
  24. O. J. Mengshoel and D. E. Goldberg, “Probability crowding: deterministic crowding with probabilistic replacement,” in Proceedings of the International Genetic and Evolutionary Computation Conference, W. Banzhaf, Ed., pp. 409–416, Orlando, Fla, USA, 1999.
  25. X. Yin and N. Germay, “A fast genetic algorithm with sharing scheme using cluster analysis methods in multimodal function optimization,” in Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms, pp. 450–457, 1993.
  26. A. Petrowski, “A clearing procedure as a niching method for genetic algorithms,” in Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC '96), pp. 798–803, Nagoya, Japan, May 1996. View at Scopus
  27. J.-P. Li, M. E. Balazs, G. T. Parks, and P. J. Clarkson, “A species conserving genetic algorithm for multimodal function optimization,” Evolutionary Computation, vol. 10, no. 3, pp. 207–234, 2002. View at Google Scholar · View at Scopus
  28. Y. Liang and K.-S. Leung, “Genetic Algorithm with adaptive elitist-population strategies for multimodal function optimization,” Applied Soft Computing Journal, vol. 11, no. 2, pp. 2017–2034, 2011. View at Publisher · View at Google Scholar · View at Scopus
  29. G. Chen, C. P. Low, and Z. Yang, “Preserving and exploiting genetic diversity in evolutionary programming algorithms,” IEEE Transactions on Evolutionary Computation, vol. 13, no. 3, pp. 661–673, 2009. View at Publisher · View at Google Scholar · View at Scopus
  30. L. N. de Castro and F. J. von Zuben, “Learning and optimization using the clonal selection principle,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 3, pp. 239–251, 2002. View at Publisher · View at Google Scholar · View at Scopus
  31. L. N. Castro and J. Timmis, “An artificial immune network for multimodal function optimization,” in Proceedings of the Congress on Evolutionary Computation, pp. 699–704, Honolulu, Hawaii, USA, 2002.
  32. Q. Xu, L. Wang, and J. Si, “Predication based immune network for multimodal function optimization,” Engineering Applications of Artificial Intelligence, vol. 23, no. 4, pp. 495–504, 2010. View at Publisher · View at Google Scholar · View at Scopus
  33. K. C. Tan, S. C. Chiam, A. A. Mamun, and C. K. Goh, “Balancing exploration and exploitation with adaptive variation for evolutionary multi-objective optimization,” European Journal of Operational Research, vol. 197, no. 2, pp. 701–713, 2009. View at Publisher · View at Google Scholar · View at Scopus
  34. S. Roy, S. M. Islam, S. Das, S. Ghosh, and A. V. Vasilakos, “A simulated weed colony system with subregional differential evolution for multimodal optimization,” Engineering Optimization, vol. 45, no. 4, pp. 459–481, 2013. View at Publisher · View at Google Scholar · View at Scopus
  35. F. Yahyaie and S. Filizadeh, “A surrogate-model based multi-modal optimization algorithm,” Engineering Optimization, vol. 43, no. 7, pp. 779–799, 2011. View at Publisher · View at Google Scholar · View at Scopus
  36. S. Yazdani, H. Nezamabadi-pour, and S. Kamyab, “A gravitational search algorithm for multimodal optimization,” Swarm and Evolutionary Computation, vol. 14, pp. 1–14, 2014. View at Publisher · View at Google Scholar · View at Scopus
  37. X.-S. Yang and S. Deb, “Cuckoo search via Lévy flights,” in Proceedings of the World Congress on Nature & Biologically Inspired Computing (NABIC '09), pp. 210–214, Coimbatore, india, December 2009. View at Publisher · View at Google Scholar · View at Scopus
  38. S. Walton, O. Hassan, K. Morgan, and M. R. Brown, “A review of the development and applications of the Cuckoo search algorithm,” in Swarm Intelligence and Bio-Inspired Computation Theory and Applications, X.-S. Yang, Z. Cui, R. Xiao, A. H. Gandomi, and M. Karamanoglu, Eds., pp. 257–271, Elsevier, San Diego, Calif, USA, 2013. View at Publisher · View at Google Scholar
  39. X.-S. Yang and S. Deb, “Engineering optimisation by cuckoo search,” International Journal of Mathematical Modelling and Numerical Optimisation, vol. 1, no. 4, pp. 330–343, 2010. View at Google Scholar
  40. S. Walton, O. Hassan, K. Morgan, and M. R. Brown, “Modified cuckoo search: a new gradient free optimisation algorithm,” Chaos, Solitons and Fractals, vol. 44, no. 9, pp. 710–718, 2011. View at Publisher · View at Google Scholar · View at Scopus
  41. A. Kumar and S. Chakarverty, “Design optimization for reliable embedded system using Cuckoo search,” in Proceedings of the 3rd International Conference on Electronics Computer Technology (ICECT '11), pp. 264–268, April 2011. View at Publisher · View at Google Scholar · View at Scopus
  42. A. Kaveh and T. Bakhshpoori, “Optimum design of steel frames using Cuckoo search algorithm with Lévy flights,” The Structural Design of Tall and Special Buildings, vol. 22, no. 13, pp. 1023–1036, 2013. View at Publisher · View at Google Scholar · View at Scopus
  43. L. H. Tein and R. Ramli, “Recent advancements of nurse scheduling models and a potential path,” in Proceedings of 6th IMT-GT Conference on Mathematics, Statistics and Its Applications (ICMSA '10), pp. 395–409, 2010.
  44. V. Bhargava, S. E. K. Fateen, and A. Bonilla-Petriciolet, “Cuckoo search: a new nature-inspired optimization method for phase equilibrium calculations,” Fluid Phase Equilibria, vol. 337, pp. 191–200, 2013. View at Publisher · View at Google Scholar · View at Scopus
  45. Z. Moravej and A. Akhlaghi, “A novel approach based on cuckoo search for DG allocation in distribution network,” International Journal of Electrical Power and Energy Systems, vol. 44, no. 1, pp. 672–679, 2013. View at Publisher · View at Google Scholar · View at Scopus
  46. I. Pavlyukevich, “Lévy flights, non-local search and simulated annealing,” Journal of Computational Physics, vol. 226, no. 2, pp. 1830–1844, 2007. View at Google Scholar
  47. R. N. Mantegna, “Fast, accurate algorithm for numerical simulation of Lévy stable stochastic processes,” Physical Review E, vol. 49, no. 4, pp. 4677–4683, 1994. View at Publisher · View at Google Scholar · View at Scopus