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

Volumn 39, Issue 5, 2009, Pages 1092-1106

  Chen, Tianshi ^a   He, Jun ^b,c   Sun, Guangzhong ^a   Chen, Guoliang ^a   Yao, Xin ^a,b  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^c ABERYSTWYTH UNIVERSITY   (United Kingdom)

Author keywords

Drift analysis, evolutionary algorithms (EAs); First hitting time; Takeover time; Unimodal problems

Indexed keywords

DRIFT ANALYSIS, EVOLUTIONARY ALGORITHMS (EAS); FIRST HITTING TIME; GENERAL APPROACH; GLOBAL OPTIMUM; HITTING TIME; NEW APPROACHES; NEW RESULTS; PROBLEM-SPECIFIC KNOWLEDGE; SELECTION SCHEME; TAKEOVER TIME; THEORETICAL RESULT; TIGHT BOUND; TIME COMPLEXITY; UNIMODAL; UNIMODAL PROBLEMS;

EVOLUTIONARY ALGORITHMS;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; BIOLOGICAL MODEL; COMPUTER SIMULATION; METHODOLOGY; THEORETICAL MODEL;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; MODELS, GENETIC; MODELS, THEORETICAL; PATTERN RECOGNITION, AUTOMATED;

EID: 67649395579     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2008.2012167     Document Type: Article

References (39)

1. H.-G. Beyer, The Theory of Evolution Strategies, ser. Natural Computing Series. Heidelberg, Germany: Springer-Verlag, 2001.
2. H.-G. Beyer, H.-P. Schwefel, and I. Wegener, "How to analyse evolutionary algorithms," Theor. Comput. Sci., vol. 287, no. 1, pp. 101-130, Sep. 2002.
3. X.-B. Cao, H. Qiao, and J. Keane, "A low-cost pedestrian-detection system with a single optical camera," IEEE Trans. Intell. Transp. Syst., vol. 9, no. 1, pp. 58-67, Mar. 2008.
4. S. Droste, T. Jansen, and I. Wegener, "On the optimization of unimodal functions with the (1 + 1) evolutionary algorithm," in Proc. PPSN V Amsterdam, The Netherlands, 1998, pp. 13-22.
5. S. Droste, T. Jansen, and I. Wegener, "On the analysis of the (1 + 1) evolutionary algorithm," Theor. Comput. Sci., vol. 276, no. 1/2, pp. 51-81, Apr. 2002.
6. A. E. Eiben and G. Rudolph, "Theory of evolutionary algorithms: A bird eye view," Theor. Comput. Sci., vol. 229, no. 1/2, pp. 3-9, Nov. 1999.
7. A. E. Eiben, R. Hinterding, and Z. Michalewicz, "Parameter control in evolutionary algorithms," IEEE Trans. Evol. Comput., vol. 3, no. 2, pp. 124-141, Jul. 1999.
8. T. Friedrich, P. S. Oliveto, D. Sudholt, and C. Witt, "Theoretical analysis of diversity mechanisms for global exploration," in Proc. GECCO, Atlanta, GA, 2008, pp. 945-952.
9. J. Garnier, L. Kallel, and M. Schoenauer, "Rigorous hitting times for binary mutations," Evol. Comput., vol. 7, no. 2, pp. 167-203, 1999.
10. J. Garnier and L. Kallel, "Statistical distribution of the convergence time of evolutionary algorithms for long path problems," IEEE Trans. Evol. Comput., vol. 4, no. 1, pp. 16-30, Apr. 2000.
11. D. E. Goldberg and K. Deb, "A comparative analysis of selection scheme used in genetic algorithms," in Foundations of Genetic Algorithms San Mateo, CA: Morgan Kaufmann, 1991, pp. 69-93.
12. B. Hajek, "Hitting time and occupation time bounds implied by drift analysis with applications," Adv. Appl. Probab., vol. 14, no. 3, pp. 502-525, 1982.
13. J. He and X. Yao, "Drift analysis and average time complexity of evolutionary algorithms," Artif. Intell., vol. 127, no. 1, pp. 57-85, Mar. 2001.
14. J. He and X. Yao, "From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms," IEEE Trans. Evol. Comput., vol. 6, no. 5, pp. 495-511, Oct. 2002.
15. J. He and X. Yao, "Towards an analytic framework for analysing the computation time of evolutionary algorithms," Artif. Intell., vol. 145, no. 1/2, pp. 59-97, Apr. 2003.
16. J. He and X. Yao, "A study of drift analysis for estimating computation time of evolutionary algorithms," Natural Comput., vol. 3, no. 1, pp. 21-35, Mar. 2004.
17. J. Horn, D. E. Goldberg, and K. Deb, "Long path problems," in Proc. PPSN III, Jerusalem, Israel, 1994, pp. 149-158.
18. M. Iosifescu, Finite Markov Processes and Their Applications. Chichester, U.K.: Wiley, 1980.
19. T. Jansen and I. Wegener, "Evolutionary algorithms - How to cope with plateaus of constant fitness and when to reject strings of the same fitness," IEEE Trans. Evol. Comput., vol. 5, no. 6, pp. 589-599, Dec. 2001.
20. T. Jansen, K. A. D. Jong, and I. Wegener, "On the choice of the offspring population size in evolutionary algorithms," Evol. Comput. vol. 13, no. 4, pp. 413-440, 2005.
21. S. Khuri, T. Bäck, and J. Heitkotter, "An evolutionary approach to combinatorial optimization problems," in Proc. 22nd Annu. ACM Comput. Sci. Conf., 1994, pp. 66-73.
22. P. K. Lehre and X. Yao, "Crossover can be constructive when computing unique input output sequences," in Proc. 7th Int. Conf. SEAL, Melbourne, Australia, 2008, pp. 595-604.
23. K.-H. Liang, X. Yao, C. S. Newton, and D. Hoffman, "A new evolutionary approach to cutting stock problems with and without contiguity," Comput. Oper. Res., vol. 29, no. 12, pp. 1641-1659, Oct. 2002.
24. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
25. H. Mühlenbein and D. Schlierkamp-Voosen, "Predictive models for the breeder genetic algorithm, I.: Continuous parameter optimization," Evol. Comput., vol. 1, no. 1, pp. 25-49, 1993.
26. P. S. Oliveto, J. He, and X. Yao, "Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results," Int. J. Autom. Comput., vol. 4, no. 3, pp. 281-293, Jul. 2007.
27. P. S. Oliveto, J. He, and X. Yao, "Evolutionary algorithms and the vertex cover problem," in Proc. IEEE CEC, Singapore, 2007, pp. 1870-1877.
28. P. S. Oliveto, J. He, and X. Yao, "Analysis of population-based evolutionary algorithms for the vertex cover problem," in Proc. IEEE WCCI, Hong Kong, 2008, pp. 1563-1570.
29. P. S. Oliveto and C. Witt, "Simplified drift analysis for proving lower bounds in evolutionary computation," in Proc. PPSN X, Dortmund, Germany, 2008, pp. 82-91.
30. G. Rudolph, "How mutation and selection solve long path problems in polynomial expected time," Evol. Comput., vol. 4, no. 2, pp. 195-205, 1996.
31. G. Rudolph, "Convergence properties of evolutionary algorithms," Ph.D. dissertation, Verlag Dr. Kovač, Hamburg, Germany, 1997.
32. G. Rudolph, "Finite Markov chain results in evolutionary computation: A tour d'horizon," Fundam. Inform., vol. 35, no. 1-4, pp. 67-89, Aug. 1998.
33. J. Suzuki, "A Markov chain analysis on simple genetic algorithms," IEEE Trans. Syst., Man, Cybern., vol. 25, no. 4, pp. 655-659, Apr. 1995.
34. J. Suzuki, "A further result on the Markov chain model of genetic algorithms and its application to a simulated annealing-like strategy," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 28, no. 1, pp. 95-102, Feb. 1998.
35. R. Syski, Passage Times for Markov Chains. Amsterdam, The Netherlands: IOS Press, 1992.
36. M. Tang and X. Yao, "A memetic algorithm for VLSI floorplanning," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 37, no. 1, pp. 62-69, Feb. 2007.
37. E. W. Weisstein, "Basin of attraction," MathWorld - A Wolfram Web Resource. [Online]. Available: http://mathworld. wolfram.com/BasinofAttraction.html
38. C. Witt, "An analysis of the (μ + 1) EA on simple Pseudo-Boolean functions," in Proc. GECCO, Seattle, WA, 2004, pp. 761-773.
39. J. X. Yu, X. Yao, C.-H. Choi, and G. Gou, "Materialized view selection as constrained evolutionary optimization," IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 33, no. 4, pp. 458-467, Nov. 2003.