Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 147457, 11 pages
http://dx.doi.org/10.1155/2014/147457
Research Article

On the Convergence of Biogeography-Based Optimization for Binary Problems

1Department of Electrical Engineering, Shaoxing University, Shaoxing, Zhejiang, China
2Shanghai Key Laboratory of Power Station Automation Technology, School of Mechatronic Engineering and Automation, Shanghai University, Shanghai, China
3Department of Electrical and Computer Engineering, Cleveland State University, Cleveland, OH 44115, USA

Received 28 January 2014; Accepted 1 May 2014; Published 22 May 2014

Academic Editor: Erik Cuevas

Copyright © 2014 Haiping Ma 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. D. Simon, “Biogeography-based optimization,” IEEE Transactions on Evolutionary Computation, vol. 12, no. 6, pp. 702–713, 2008. View at Publisher · View at Google Scholar · View at Scopus
  2. D. Du, D. Simon, and M. Ergezer, “Biogeography-based optimization combined with evolutionary strategy and immigration refusal,” in Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (SMC '09), pp. 1023–1002, San Antonio, Tex, USA, October 2009. View at Publisher · View at Google Scholar · View at Scopus
  3. M. Ergezer, D. Simon, and D. Du, “Oppositional biogeography-based optimization,” in Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (SMC '09), pp. 1035–1040, San Antonio, Tex, USA, October 2009. View at Publisher · View at Google Scholar · View at Scopus
  4. M. Lundy and A. Mees, “Convergence of an annealing algorithm,” Mathematical Programming, vol. 34, no. 1, pp. 111–124, 1986. View at Publisher · View at Google Scholar · View at MathSciNet
  5. H. Ma and D. Simon, “Blended biogeography-based optimization for constrained optimization,” Engineering Applications of Artificial Intelligence, vol. 24, no. 3, pp. 517–525, 2011. View at Publisher · View at Google Scholar · View at Scopus
  6. A. Bhattacharya and P. K. Chattopadhyay, “Biogeography-based optimization for different economic load dispatch problems,” IEEE Transactions on Power Systems, vol. 25, no. 2, pp. 1064–1077, 2010. View at Publisher · View at Google Scholar · View at Scopus
  7. P. Lozovyy, G. Thomas, and D. Simon, “Biogeography-based optimization for robot controller tuning,” in Computational Modeling and Simulation of Intellect: Current State and Future Perspectives, B. Igelnik, Ed., pp. 162–181, IGI Global, Hershey, Pa, USA, 2011. View at Google Scholar
  8. V. Panchal, P. Singh, N. Kaur, and H. Kundra, “Biogeography based satellite image classification,” International Journal of Computer Science and Information Security, vol. 6, no. 2, pp. 269–274, 2009. View at Google Scholar
  9. R. Rarick, D. Simon, F. E. Villaseca, and B. Vyakaranam, “Biogeography-based optimization and the solution of the power flow problem,” in Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (SMC '09), pp. 1029–1034, usa, October 2009. View at Publisher · View at Google Scholar · View at Scopus
  10. D. Simon, M. Ergezer, and D. Du, “Population distributions in biogeography-based optimization algorithms with elitism,” in Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (SMC '09), pp. 1017–1022, San Antonio, Tex, USA, October 2009. View at Publisher · View at Google Scholar · View at Scopus
  11. D. Simon, M. Ergezer, D. Du, and R. Rarick, “Markov models for biogeography-based optimization,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 41, no. 1, pp. 299–306, 2011. View at Publisher · View at Google Scholar · View at Scopus
  12. D. Simon, R. Rarick, M. Ergezer, and D. Du, “Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms,” Information Sciences, vol. 181, no. 7, pp. 1224–1248, 2011. View at Publisher · View at Google Scholar · View at Scopus
  13. A. E. Eiben, E. H. L. Aarts, and K. M. Van Hee, “Global convergence of genetic algorithms: a Markov chain analysis,” in Parallel Problem Solving from Nature (Dortmund, 1990), vol. 496 of Lecture Notes in Computer Science, pp. 4–12, Springer, New York, NY, USA, 1991. View at Google Scholar · View at MathSciNet
  14. C. Grinstead and J. Snell, Introduction to Probability, American Mathematical Society, Providence, RI, USA, 1997.
  15. G. Guo and S. Yu, “The unified method analyzing convergence of genetic algorithms,” Control Theory & Applications, vol. 18, no. 3, pp. 443–446, 2001. View at Google Scholar · View at MathSciNet
  16. C. Reeves and J. Rowe, Genetic Algorithms: Principles and Perspectives, vol. 20, Kluwer Academic Publishers, Norwell, Mass, USA, 2003. View at MathSciNet
  17. L. Wang, Intelligent Optimization Algorithms with Applications, Springer, New York, NY, USA, 2001.
  18. A. Auger and B. Doerr, Theory of Randomized Search Heuristics, World Scientific, Singapore, 2011.
  19. T. Jansen, Analyzing Evolutionary Algorithms, Springer, New York, NY, USA, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  20. F. Neumann and C. Witt, Bioinspired Computation in Combinatorial Optimization, Springer, New York, NY, USA, 2010.
  21. T. Davis and J. Principe, “A Markov chain framework for the simple genetic algorithm,” Evolutionary Computation, vol. 1, no. 3, pp. 269–288, 1993. View at Publisher · View at Google Scholar
  22. J. He and L. Kang, “On the convergence rates of genetic algorithms,” Theoretical Computer Science, vol. 229, no. 1-2, pp. 23–39, 1999. View at Publisher · View at Google Scholar · View at MathSciNet
  23. J. Horn, “Finite Markov chain analysis of genetic algorithms with niching,” in Proceedings of the International Conference on Genetic Algorithms, pp. 1–13, San Francisco, Calif, USA, 1993.
  24. A. Nix and M. Vose, “Modeling genetic algorithms with Markov chains,” Annals of Mathematics and Artificial Intelligence, vol. 5, no. 1, pp. 79–88, 1992. View at Publisher · View at Google Scholar · View at MathSciNet
  25. J. Suzuki, “Markov chain analysis on simple genetic algorithms,” IEEE Transactions on Systems, Man and Cybernetics, vol. 25, no. 4, pp. 655–659, 1995. View at Publisher · View at Google Scholar · View at Scopus
  26. J. Suzuki, “A further result on the Markov chain model of genetic algorithms and its application to a simulated annealing-like strategy,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 28, no. 1, pp. 95–102, 1998. View at Publisher · View at Google Scholar · View at Scopus
  27. 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
  28. M. Iosifescu, Finite Markov Processes and their Applications, John Wiley & Sons, New York, NY, USA, 1980. View at MathSciNet
  29. G. Rudolph, “Convergence analysis of canonical genetic algorithms,” IEEE Transactions on Neural Networks, vol. 5, no. 1, pp. 96–101, 1994. View at Publisher · View at Google Scholar · View at Scopus