메뉴 건너뛰기




Volumn 4, Issue 3, 2007, Pages 281-293

Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results

Author keywords

Combinatorial optimization; Computational complexity; Evolutionary algorithms; Evolutionary computation theory

Indexed keywords

COMBINATORIAL MATHEMATICS; EVOLUTIONARY ALGORITHMS; PROBLEM SOLVING;

EID: 34547427292     PISSN: 14768186     EISSN: 17518520     Source Type: Journal    
DOI: 10.1007/s11633-007-0281-3     Document Type: Article
Times cited : (188)

References (54)
  • 4
    • 0002082910 scopus 로고    scopus 로고
    • Theory of Evolutionary Algorithms: A Bird's Eye View
    • 1-2
    • A. E. Eiben, G. Rudolph. Theory of Evolutionary Algorithms: A Bird's Eye View. Theoretical Computer Science, vol. 229, no.1-2, pp. 3-9, 1999.
    • (1999) Theoretical Computer Science , vol.229 , pp. 3-9
    • Eiben, A.E.1    Rudolph, G.2
  • 6
    • 0028203106 scopus 로고
    • Convergence Analysis of Canonical Genetic Algorithms
    • 1
    • G. Rudolph. Convergence Analysis of Canonical Genetic Algorithms. IEEE Transactions on Neural Networks, vol. 5, no. 1, pp. 96-101, 1994.
    • (1994) IEEE Transactions on Neural Networks , vol.5 , pp. 96-101
    • Rudolph, G.1
  • 7
    • 0003059188 scopus 로고    scopus 로고
    • Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon
    • 1-4
    • G. Rudolph. Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon. Fundamenta Informaticae, vol. 35, no.1-4, pp. 67-89, 1998.
    • (1998) Fundamenta Informaticae , vol.35 , pp. 67-89
    • Rudolph, G.1
  • 8
    • 0001257451 scopus 로고    scopus 로고
    • Stopping Criteria for Finite Length Genetic Algorithms
    • 2
    • H. Aytug, G. J. Koehler. Stopping Criteria for Finite Length Genetic Algorithms. ORSA Journal on Computing, vol. 8, no.2, pp. 183-191, 1996.
    • (1996) ORSA Journal on Computing , vol.8 , pp. 183-191
    • Aytug, H.1    Koehler, G.J.2
  • 9
    • 0034457758 scopus 로고    scopus 로고
    • Convergence Criteria for Genetic Algorithms
    • 1
    • D. Greenhalgh, S. Marshall. Convergence Criteria for Genetic Algorithms. SIAM Journal of Computing, vol. 30, no.1, pp. 269-282, 2000.
    • (2000) SIAM Journal of Computing , vol.30 , pp. 269-282
    • Greenhalgh, D.1    Marshall, S.2
  • 10
    • 24644519130 scopus 로고    scopus 로고
    • On stopping criteria for genetic algorithms
    • 17th Brazilian Symposium on Artificial Intelligence Springer-Verlag
    • M. Safe, J. A. Carballido, I. Ponzoni, N. B. Brignole. On Stopping Criteria for Genetic Algorithms, In 17th Brazilian Symposium on Artificial Intelligence, Lecture Notes in Artificial Intelligence, Springer-Verlag, vol. 3171, pp. 405-413, 2004.
    • (2004) Lecture Notes in Artificial Intelligence , vol.3171 , pp. 405-413
    • Safe, M.1    Carballido, J.A.2    Ponzoni, I.3    Brignole, N.B.4
  • 11
    • 0037029331 scopus 로고    scopus 로고
    • On the Analysis of the (1+1) Evolutionary Algorithm
    • 1-2
    • S. Droste, T. Jansen, I. Wegener. On the Analysis of the (1+1) Evolutionary Algorithm. Theoretical Computer Science, vol. 276, no. 1-2, pp. 51-81, 2002.
    • (2002) Theoretical Computer Science , vol.276 , pp. 51-81
    • Droste, S.1    Jansen, T.2    Wegener, I.3
  • 14
    • 0012701514 scopus 로고    scopus 로고
    • Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions
    • Kluwer Academic Publishers Norwell, MA, USA
    • I. Wegener. Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions. In Evolutionary Optimization, R. Sarker, M. Mohammadian, X. Yao (eds.), Kluwer Academic Publishers, Norwell, MA, USA, 2002.
    • (2002) Evolutionary Optimization
    • Wegener, I.1    Sarker, R.2    Mohammadian, M.3    Yao, X.4
  • 15
    • 0032082507 scopus 로고    scopus 로고
    • A Rigorous Complexity Analysis of the (1+1) Evolutionary Algorithm for Separable Functions with Boolean Inputs
    • 2
    • S. Droste, T. Jansen, I. Wegener. A Rigorous Complexity Analysis of the (1+1) Evolutionary Algorithm for Separable Functions with Boolean Inputs. Evolutionary Computation, vol. 6, no. 2, pp. 185-196, 1998.
    • (1998) Evolutionary Computation , vol.6 , pp. 185-196
    • Droste, S.1    Jansen, T.2    Wegener, I.3
  • 17
    • 0035694032 scopus 로고    scopus 로고
    • Evolutionary Algorithms: How to Cope with Plateaus of Constant Fitness and When to Reject Strings of the Same Fitness
    • 6
    • T. Jansen, I. Wegener. Evolutionary Algorithms: How to Cope with Plateaus of Constant Fitness and When to Reject Strings of the Same Fitness. IEEE Transactions on Evolutionary Computation, vol. 5, no. 6, pp. 589-599, 2000.
    • (2000) IEEE Transactions on Evolutionary Computation , vol.5 , pp. 589-599
    • Jansen, T.1    Wegener, I.2
  • 21
    • 0037381842 scopus 로고    scopus 로고
    • Towards an Analytic Framework for Analyzing the Computation Time of Evolutionary Algorithms
    • 1-2
    • J. He, X. Yao. Towards an Analytic Framework for Analyzing the Computation Time of Evolutionary Algorithms. Artificial Intelligence, vol. 145, no. 1-2 pp. 59-97, 2003.
    • (2003) Artificial Intelligence , vol.145 , pp. 59-97
    • He, J.1    Yao, X.2
  • 24
    • 0036808673 scopus 로고    scopus 로고
    • From an Individual to a Population: An Analysis of the 1st Hitting Time of Population-based Evolutionary Algorithms
    • 5
    • J. He, X. Yao. From an Individual to a Population: An Analysis of the 1st Hitting Time of Population-based Evolutionary Algorithms. IEEE Transactions Evolutionary Computation, vol. 6, no. 5, pp. 495-511, 2002.
    • (2002) IEEE Transactions Evolutionary Computation , vol.6 , pp. 495-511
    • He, J.1    Yao, X.2
  • 27
    • 84878583363 scopus 로고    scopus 로고
    • On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm
    • Proceedings of the Parallel Problem Solving from Nature Conference Springer-Verlag
    • S. Droste, T. Jansen, I. Wegener. On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm. In Proceedings of the Parallel Problem Solving from Nature Conference, Lecture Notes in Computer Science, Springer-Verlag, vol. 1498, pp. 13-22, 1998.
    • (1998) Lecture Notes in Computer Science , vol.1498 , pp. 13-22
    • Droste, S.1    Jansen, T.2    Wegener, I.3
  • 31
    • 84958045928 scopus 로고    scopus 로고
    • On the analysis of evolutionary algorithms - A proof that crossover really can help
    • Springer-Verlag
    • T. Jansen, I. Wegener. On the Analysis of Evolutionary Algorithms - A Proof that Crossover Really Can Help. In Proceedings of the 7th Annual European Symposium on Algorithms, Springer-Verlag, pp. 184-193, 1999.
    • (1999) Proceedings of the 7th Annual European Symposium on Algorithms , pp. 184-193
    • Jansen, T.1    Wegener, I.2
  • 33
    • 0035276208 scopus 로고    scopus 로고
    • Drift Analysis and Average Time Complexity of Evolutionary Algorithms
    • 1
    • J. He, X. Yao. Drift Analysis and Average Time Complexity of Evolutionary Algorithms. Artificial Intelligence, vol. 127, no. 1, pp. 57-85, 2001.
    • (2001) Artificial Intelligence , vol.127 , pp. 57-85
    • He, J.1    Yao, X.2
  • 34
    • 4344644853 scopus 로고    scopus 로고
    • A Study of Drift Analysis for Estimating Computation Time of Evolutionary Algorithms
    • 1
    • J. He, X. Yao. A Study of Drift Analysis for Estimating Computation Time of Evolutionary Algorithms. Natural Computing: An International Journal, vol. 3, no. 1, pp. 21-35, 2004.
    • (2004) Natural Computing: An International Journal , vol.3 , pp. 21-35
    • He, J.1    Yao, X.2
  • 36
    • 22344431964 scopus 로고    scopus 로고
    • Real Royal Road Functions: Where Crossover Provably is Essential
    • 1-3
    • T. Jansen, I. Wegener. Real Royal Road Functions: Where Crossover Provably is Essential. Discrete Applied Mathematics, vol. 149, no. 1-3, pp. 111-125, 2005.
    • (2005) Discrete Applied Mathematics , vol.149 , pp. 111-125
    • Jansen, T.1    Wegener, I.2
  • 38
    • 2442505438 scopus 로고    scopus 로고
    • Real Royal Road Functions for Constant Population Size
    • 1
    • T. Storch. Real Royal Road Functions for Constant Population Size. Theoretical Computer Science, vol. 320, no. 1, pp. 123-134, 2004.
    • (2004) Theoretical Computer Science , vol.320 , pp. 123-134
    • Storch, T.1
  • 39
    • 27644579712 scopus 로고    scopus 로고
    • On the Choice of the Offspring Population Size in Evolutionary Algorithms
    • 4
    • T. Jansen, K. A. De Jong, I. Wegener. On the Choice of the Offspring Population Size in Evolutionary Algorithms. Evolutionary Computation, vol. 13, no. 4, pp. 413-440, 2005.
    • (2005) Evolutionary Computation , vol.13 , pp. 413-440
    • Jansen, T.1    De Jong, K.A.2    Wegener, I.3
  • 43
    • 33748121602 scopus 로고    scopus 로고
    • Minimum Spanning Trees Made Easier Via Multi-objective Optimization
    • 3
    • F. Neumann, I. Wegener. Minimum Spanning Trees Made Easier Via Multi-objective Optimization. Natural Computing, vol. 5, no. 3, pp. 305-319, 2006.
    • (2006) Natural Computing , vol.5 , pp. 305-319
    • Neumann, F.1    Wegener, I.2
  • 45
    • 4344662826 scopus 로고    scopus 로고
    • Expected run-times of evolutionary algorithms for the eulerian cycle problem
    • IEEE
    • F. Neumann. Expected Run-times of Evolutionary Algorithms for the Eulerian Cycle Problem. In Proceedings of the Congress on Evolutionary Computation, IEEE, pp. 904-910, 2004.
    • (2004) Proceedings of the Congress on Evolutionary Computation , pp. 904-910
    • Neumann, F.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.