Pietro S. Oliveto, Jun He and Xin Yao. Time Complexity of Evolutionary Algorithms for Combinatorial Optimization:A Decade of Results. International Journal of Automation and Computing, vol. 4, no. 3, pp. 281-293, 2007. DOI: 10.1007/s11633-007-0281-3
Citation: Pietro S. Oliveto, Jun He and Xin Yao. Time Complexity of Evolutionary Algorithms for Combinatorial Optimization:A Decade of Results. International Journal of Automation and Computing, vol. 4, no. 3, pp. 281-293, 2007. DOI: 10.1007/s11633-007-0281-3

Time Complexity of Evolutionary Algorithms for Combinatorial Optimization:A Decade of Results

  • Computational time complexity analyzes of evolutionary algorithms (EAs) have been performed since the mid-nineties. The first results were related to very simple algorithms,such as the (1+1)-EA,on toy problems.These efforts produced a deeper understanding of how EAs perform on different kinds of fitness landscapes and general mathematical tools that may be extended to the analysis of more complicated EAs on more realistic problems.In fact,in recent years,it has been possible to analyze the (1+1)-EA on combinatorial optimization problems with practical applications and more realistic population-baeed EAs on structured toy problems. This paper presents a survey of the results obtained in the last decade along these two research lines.The most common mathematical techniques are introduced,the basic ideas behind them are discussed and their elective applications are highlighted.Solved problems that were still open are enumerated as are those still awaiting for a solution.New questions and problems arisen in the meantime are also considered.
  • loading

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return