Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 895629, 12 pages
http://dx.doi.org/10.1155/2014/895629
Research Article

An Improved Central Force Optimization Algorithm for Multimodal Optimization

1School of Mathematics and Statistics, Xi’dian University, Xi’an 710071, China
2College of Science, Xi’an University of Science and Technology, Xi’an 710054, China
3School of Computer, Xi’dian University, Xi’an 710071, China

Received 24 June 2014; Revised 22 September 2014; Accepted 12 October 2014; Published 7 December 2014

Academic Editor: Boris Andrievsky

Copyright © 2014 Jie Liu and Yu-ping Wang. 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. Y. W. Leung and Y. Wang, “An orthogonal genetic algorithm with quantization for global numerical optimization,” IEEE Transactions on Evolutionary Computation, vol. 5, no. 1, pp. 41–53, 2001. View at Publisher · View at Google Scholar · View at Scopus
  2. R. F. T. Neto and M. G. Filho, “An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed,” Computers & Operations Research, vol. 38, no. 9, pp. 1286–1293, 2011. View at Publisher · View at Google Scholar · View at Scopus
  3. R. C. Green II, L. Wang, and M. Alam, “Training neural networks using central force optimization and particle swarm optimization: insights and comparisons,” Expert Systems with Applications, vol. 39, no. 1, pp. 555–563, 2012. View at Publisher · View at Google Scholar · View at Scopus
  4. S. Kirkpatrick, C. D. Gelatto, and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. E. Rashedi, H. Nezamabadi-pour, and S. Saryazdi, “GSA: a Gravitational Search Algorithm,” Information Sciences, vol. 179, no. 13, pp. 2232–2248, 2009. View at Publisher · View at Google Scholar · View at Scopus
  6. R. A. Formato, “Central force optimization: a new metaheuristic with applications in applied electromagnetics,” Progress in Electromagnetics Research, vol. 77, pp. 425–491, 2007. View at Publisher · View at Google Scholar · View at Scopus
  7. R. A. Formato, “Central force optimization: a new nature inspired computational framework for multidimensional search and optimization,” Studies in Computational Intelligence, vol. 129, pp. 221–238, 2008. View at Publisher · View at Google Scholar · View at Scopus
  8. R. A. Formato, “Central force optimization: a new deterministic gradient-like optimization metaheuristic,” Opsearch, vol. 46, no. 1, pp. 25–51, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. R. A. Formato, “Improved cfo algorithm for antenna optimization,” Progress In Electromagnetics Research B, no. 19, pp. 405–425, 2010. View at Publisher · View at Google Scholar · View at Scopus
  10. R. A. Formato, “Pseudorandomness in central force optimization,” British Journal of Mathematics & Computer Science, vol. 3, no. 3, pp. 241–264, 2013. View at Google Scholar
  11. J. A. Nelder and R. Mead, “A simplex method for function minimization,” The Computer Journal, vol. 7, no. 2, pp. 308–313, 1965. View at Google Scholar
  12. D. Ding, D. Qi, X. Luo, J. Chen, X. Wang, and P. Du, “Convergence analysis and performance of an extended central force optimization algorithm,” Applied Mathematics and Computation, vol. 219, no. 4, pp. 2246–2259, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  13. R. Chelouah and P. Siarry, “A hybrid method combining continuous tabu search and Nelder-Mead simplex algorithms for the global optimization of multiminima functions,” European Journal of Operational Research, vol. 161, no. 3, pp. 636–654, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  14. S. S. Fan and E. Zahara, “A hybrid simplex search and particle swarm optimization for unconstrained optimization,” European Journal of Operational Research, vol. 181, no. 2, pp. 527–548, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  15. B. Y. Qu, J. J. Liang, and P. N. Suganthan, “Niching particle swarm optimization with local search for multi-modal optimization,” Information Sciences, vol. 197, pp. 131–143, 2012. View at Publisher · View at Google Scholar · View at Scopus
  16. L. Zhang and B. Zhang, “Good point set based genetic algorithm,” Chinese Journal of Computers, vol. 24, no. 9, pp. 917–922, 2001. View at Google Scholar · View at MathSciNet · View at Scopus
  17. C. Xiao, Z. Cai, and Y. Wang, “A good nodes set evolution strategy for constrained optimization,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '07), pp. 943–950, Singapore, September 2007. View at Publisher · View at Google Scholar · View at Scopus
  18. X. Yao, Y. Liu, and G. Lin, “Evolutionary programming made faster,” IEEE Transactions on Evolutionary Computation, vol. 3, no. 2, pp. 82–102, 1999. View at Publisher · View at Google Scholar · View at Scopus
  19. J. J. Liang, P. N. Suganthan, and K. Deb, “Novel composition test functions for numerical global optimization,” in Proceedings of the IEEE Swarm Intelligence Symposium (SIS '05), pp. 71–78, June 2005. View at Publisher · View at Google Scholar · View at Scopus
  20. A.-R. Hedar and M. Fukushima, “Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization,” Optimization Methods & Software, vol. 17, no. 5, pp. 891–912, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus