Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 425853, 4 pages
http://dx.doi.org/10.1155/2014/425853
Editorial

Computational Intelligence and Metaheuristic Algorithms with Applications

1School of Science and Technology, Middlesex University, London NW4 4BT, UK
2Strategic Advanced Research (StAR), Mathematical Modeling Lab, MIMOS Berhad, Technology Park Malaysia, Kuala Lumpur, Malaysia
3Department of Electrical and Electronic Engineering, Xi’an Jiaotong-Liverpool University, No. 111 Ren’ai Road, HET, SIP, Suzhou, Jiangsu 215123, China

Received 4 August 2014; Accepted 4 August 2014; Published 31 December 2014

Copyright © 2014 Xin-She Yang et al. 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. J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948, Piscataway, NJ, USA, December 1995. View at Scopus
  2. X. S. Yang, Cuckoo Search and Firefly Algorithm: Theory and Applications, vol. 516 of Studies in Computational Intelligence, Springer, Heidelberg, Germany, 2014.
  3. X.-S. Yang and S. Deb, “Cuckoo search: recent advances and applications,” Neural Computing and Applications, vol. 24, no. 1, pp. 169–174, 2014. View at Publisher · View at Google Scholar · View at Scopus
  4. M. K. Marichelvam, T. Prabaharan, and X. S. Yang, “Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan,” Applied Soft Computing, vol. 19, no. 1, pp. 93–101, 2014. View at Publisher · View at Google Scholar · View at Scopus
  5. J. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, 1975. View at MathSciNet
  6. S. Kirkpatrick, C. D. Gellat, and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Google Scholar
  7. P. Judea, Heuristics, Addison-Wesley, New York, NY, USA, 1984.
  8. M. Clerc and J. Kennedy, “The particle swarm-explosion, stability, and convergence in a multidimensional complex space,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 1, pp. 58–73, 2002. View at Publisher · View at Google Scholar · View at Scopus
  9. G. Marsaglia and A. Zaman, “Monkey tests for random number generators,” Computers & Mathematics with Applications, vol. 26, no. 9, pp. 1–10, 1993. View at Google Scholar · View at Scopus
  10. A. Gut, Probabilty: A Graduate Course, Springer Texts in Statistics, Springer, Berlin, Germany, 2005. View at MathSciNet
  11. A. V. Prokhorov, “Borel-Cantelli lemman,” in Encyclopedia of Matheamtics, M. Hazewinkel, Ed., Springer, Heidelberg, Germany, 2002. View at Google Scholar
  12. C. M. Bishop, Neural Networks for Pattern Recognition, Oxford University Press, Oxford, UK, 1995.
  13. V. N. Vapnik, The Nature of Statistical Learning Theory, Springer, New York, NY, USA, 1995.
  14. X. S. Yang, Nature-Inspired Optimization Algorithms, Elsevier, London, UK, 2014.
  15. A. H. Gandomi, S. Talatahari, X.-S. Yang, and S. Deb, “Design optimization of truss structures using cuckoo search algorithm,” Structural Design of Tall and Special Buildings, vol. 22, no. 17, pp. 1330–1349, 2013. View at Publisher · View at Google Scholar · View at Scopus
  16. X.-S. Yang and S. Deb, “Two-stage eagle strategy with differential evolution,” International Journal of Bio-Inspired Computation, vol. 4, no. 1, pp. 1–5, 2012. View at Publisher · View at Google Scholar · View at Scopus
  17. X.-S. Yang, “Bat algorithm: literature review and applications,” International Journal of Bio-Inspired Computation, vol. 5, no. 3, pp. 141–149, 2013. View at Publisher · View at Google Scholar · View at Scopus
  18. X.-S. Yang, M. Karamanoglu, and X. S. He, “Flower pollination algorithm: a novel approach for multiobjective optimization,” Engineering Optimization, vol. 46, no. 9, pp. 1222–1237, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. 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 Publisher · View at Google Scholar · View at Scopus
  20. T. O. Ting, S. F. Chien, X. S. Yang, and S. H. Lee, “Analysis of quality-of-service aware othorgonal frequency division multiple access system considering energy efficiency,” IET Communications, vol. 8, no. 11, pp. 1947–1954, 2014. View at Publisher · View at Google Scholar
  21. D. Greenhalgh and S. Marshall, “Convergence criteria for genetic algorithms,” SIAM Journal on Computing, vol. 30, no. 1, pp. 269–282, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. W. J. Gutjahr, “Convergence analysis of metaheuristics,” Annals of Information Systems, vol. 10, no. 1, pp. 159–187, 2010. View at Google Scholar
  23. D. H. Wolpert and W. G. Macready, “No free lunch theorems for optimization,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 67–82, 1997. View at Publisher · View at Google Scholar · View at Scopus
  24. D. H. Wolpert and W. G. Macready, “Coevolutionary free lunches,” IEEE Transactions on Evolutionary Computation, vol. 9, no. 6, pp. 721–735, 2005. View at Publisher · View at Google Scholar · View at Scopus