Table of Contents Author Guidelines Submit a Manuscript
Computational Intelligence and Neuroscience
Volume 2015, Article ID 485215, 8 pages
http://dx.doi.org/10.1155/2015/485215
Research Article

An Analytical Framework for Runtime of a Class of Continuous Evolutionary Algorithms

School of Mathematics and Statistics, Guangdong University of Finance and Economics, Guangzhou 510320, China

Received 26 May 2015; Accepted 26 July 2015

Academic Editor: Manuel Graña

Copyright © 2015 Yushan Zhang and Guiwu Hu. 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. L. J. Fogel, A. J. Owens, and M. J. Walsh, Artificial Intelligence through Simulated Evolution, Wiley, New York, NY, USA, 1966.
  2. D. B. Fogel, System Identification Through Simulated Evolution: A Machine Learning Approach to Modeling, Ginn Press, Washington, DC, USA, 1991.
  3. D. B. Fogel, Evolving artificial intelligence [Ph.D. thesis], University of Californiaat San Diego, La Jolla, Calif, USA, 1992.
  4. D. B. Fogel, “Applying evolutionary programming to selected traveling salesman problems,” Cybernetics and Systems, vol. 24, no. 1, pp. 27–36, 1993. View at Publisher · View at Google Scholar · View at MathSciNet
  5. T. Bäck and H. Schwefel, “An overview of evolutionary algorithms for parameter optimization,” Evolutionary Computation, vol. 1, no. 1, pp. 1–23, 1993. View at Publisher · View at Google Scholar
  6. H.-P. Schwefel, Evolution and Optimum Seeking, Sixth-Generation Computer Technology Series, John Wiley & Sons, New York, NY, USA, 1995. View at MathSciNet
  7. 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
  8. C.-Y. Lee and X. Yao, “Evolutionary programming using mutations based on the Lévy probability distribution,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 1, pp. 1–13, 2004. View at Publisher · View at Google Scholar · View at Scopus
  9. G. Rudolph, “Self-adaptive mutations may lead to premature convergence,” IEEE Transactions on Evolutionary Computation, vol. 5, no. 4, pp. 410–414, 2001. View at Publisher · View at Google Scholar · View at Scopus
  10. G. Rudolph, “Convergence of non-elitist strategies,” in Proceedings of the 1st IEEE Conference on Evolutionary Computation, pp. 63–66, June 1994. View at Scopus
  11. G. Rudolph, “Convergence of evolutionary algorithms in general search spaces,” in Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC '96), pp. 50–54, May 1996. View at Scopus
  12. S. Droste, T. Jansen, and I. Wegener, “On the analysis of the (1+1) evolutionary algorithm,” Theoretical Computer Science, vol. 276, no. 1-2, pp. 51–81, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. J. He and X. Yao, “Drift analysis and average time complexity of evolutionary algorithms,” Artificial Intelligence, vol. 127, no. 1, pp. 57–85, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. M. Laumanns, L. Thiele, and E. Zitzler, “Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 2, pp. 170–182, 2004. View at Publisher · View at Google Scholar · View at Scopus
  15. R. Kumar and N. Banerjee, “Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem,” Theoretical Computer Science, vol. 358, no. 1, pp. 104–120, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. F. Neumann, “Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem,” European Journal of Operational Research, vol. 181, no. 3, pp. 1620–1629, 2007. View at Publisher · View at Google Scholar · View at Scopus
  17. Y. Yu and Z.-H. Zhou, “A new approach to estimating the expected first hitting time of evolutionary algorithms,” Artificial Intelligence, vol. 172, no. 15, pp. 1809–1832, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. T. Chen, K. Tang, G. Chen, and X. Yao, “A large population size can be unhelpful in evolutionary algorithms,” Theoretical Computer Science, vol. 436, pp. 54–70, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. P. K. Lehre and X. Yao, “On the impact of mutation-selection balance on the runtime of evolutionary algorithms,” IEEE Transactions on Evolutionary Computation, vol. 16, no. 2, pp. 225–241, 2012. View at Publisher · View at Google Scholar · View at Scopus
  20. C. Witt, “Population size versus runtime of a simple evolutionary algorithm,” Theoretical Computer Science, vol. 403, no. 1, pp. 104–120, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. T. Chen, J. He, G. Sun, G. Chen, and X. Yao, “A new approach for analyzing average time complexity of population-based evolutionary algorithms on unimodal problems,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 39, no. 5, pp. 1092–1106, 2009. View at Publisher · View at Google Scholar · View at Scopus
  22. Y. Yu, X. Yao, and Z.-H. Zhou, “On the approximation ability of evolutionary optimization with application to minimum set cover,” Artificial Intelligence, vol. 180, pp. 20–33, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. Y. Zhou, J. He, and Q. Nie, “A comparative runtime analysis of heuristic algorithms for satisfiability problems,” Artificial Intelligence, vol. 173, no. 2, pp. 240–257, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. P. S. Oliveto, J. He, and X. Yao, “Analysis of the (1+1)-EA for finding approximate solutions to vertex cover problems,” IEEE Transactions on Evolutionary Computation, vol. 13, no. 5, pp. 1006–1029, 2009. View at Publisher · View at Google Scholar · View at Scopus
  25. P. K. Lehre and X. Yao, “Runtime analysis of the (1+1) EA on computing unique input output sequences,” Information Sciences, vol. 259, pp. 510–531, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. X. Lai, Y. Zhou, J. He, and J. Zhang, “Performance analysis of evolutionary algorithms for the minimum label spanning tree problem,” IEEE Transactions on Evolutionary Computation, vol. 18, no. 6, pp. 860–872, 2014. View at Publisher · View at Google Scholar · View at Scopus
  27. Y. Zhou, J. Zhang, and Y. Wang, “Performance analysis of the (1+1) evolutionary algorithm for the multiprocessor scheduling problem,” Algorithmica, pp. 1–21, 2014. View at Google Scholar · View at MathSciNet · View at Scopus
  28. Y. Zhou, X. Lai, and K. Li, “Approximation and parameterized runtime analysis of evolutionary algorithms for the maximum cut problem,” IEEE Transactions on Cybernetics, vol. 45, no. 8, pp. 1491–1498, 2014. View at Publisher · View at Google Scholar · View at Scopus
  29. C. Witt, “Tight bounds on the optimization time of a randomized search heuristic on linear functions,” Combinatorics, Probability and Computing, vol. 22, no. 2, pp. 294–318, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  30. C. Witt, “Fitness levels with tail bounds for the analysis of randomized search heuristics,” Information Processing Letters, vol. 114, no. 1-2, pp. 38–41, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  31. D. Sudholt, “A new method for lower bounds on the running time of evolutionary algorithms,” IEEE Transactions on Evolutionary Computation, vol. 17, no. 3, pp. 418–435, 2013. View at Publisher · View at Google Scholar · View at Scopus
  32. J. Jägersküpper, “Algorithmic analysis of a basic evolutionary algorithm for continuous optimization,” Theoretical Computer Science, vol. 379, no. 3, pp. 329–347, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  33. J. Jägersküpper, “Lower bounds for randomized direct search with isotropic sampling,” Operations Research Letters, vol. 36, no. 3, pp. 327–332, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  34. A. Agapie, M. Agapie, and G. Zbaganu, “Evolutionary algorithms for continuous-space optimisation,” International Journal of Systems Science, vol. 44, no. 3, pp. 502–512, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  35. A. Agapie, M. Agapie, G. Rudolph, and G. Zbaganu, “Convergence of evolutionary algorithms on the n-dimensional continuous space,” IEEE Transactions on Cybernetics, vol. 43, no. 5, pp. 1462–1472, 2013. View at Publisher · View at Google Scholar · View at Scopus
  36. Y. Chen, X. Zou, and J. He, “Drift conditions for estimating the first hitting times of evolutionary algorithms,” International Journal of Computer Mathematics, vol. 88, no. 1, pp. 37–50, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus