中文摘要：

进化算法困难性是进化计算研究领域的重要分支，旨在研究进化算法的性能表现与优化问题特性之间的联系，其目的是利用有限信息估计进化算法在求解优化问题时的性能表现。本文主要介绍进化算法困难性研究的几种典型方法及近年来的研究进展，主要包括适应值-距离模型、适应值曲面模型、曲面自动机模型、最优吸引子理论和基因关联模型等六种分析优化问题难度的理论，以及相应的八种难度指标。此外，本文还通过对比分析指出现有方法存在的优缺点，并展望了该领域未来的发展趋势。

英文摘要：

The research work of hardness on evolutionary algorithm is an important branch of evolutionary computation .It aims to study the relationship between the performance of evolutionary algorithm and the characters of the optimization problem . And ,the goal of the hardness research is estimating the performance of an evolutionary algorithm deployed in one optimization prob-lem by using limited information .This paper summarizes six kinds of hardness theories on evolutionary algorithm ,such as fitness-distance correlation model ,fitness landscape methods ,landscape state machine ,optimal contraction theorem ,epistasis methods ,etc . and eight hardness indicators with them .Furthermore ,this paper discusses the advantages and disadvantages of these methods ,and prospects the trends of this research field .