中文摘要：

针对处理大尺度全局优化问题,提出一种基于自适应t-分布的分布估计算法（EDA-t）.该算法不仅求解效果良好,而且求解速度也比同类型算法快.其基本思想是：在迭代搜索过程,首先利用期望最大化算法对演化种群进行概率主成分分析,然后根据得到的概率隐变量建立算法的概率模型,并通过t-分布自由度自适应方法,在算法收敛停滞时跳出局部最优.由于在构建模型时进行了数据降维,在不影响算法求解精度的前提下,其计算开销得到了明显降低.通过和目前主流的演化算法在大尺度优化测试函数上的仿真实验和分析,验证了所提算法的有效性和适用性.

英文摘要：

In this paper,an adaptive estimation of student＇s t-distribution algorithm（EDA-t）is proposed to deal with the large-scale global optimization problems.The proposed algorithm can not only obtain optimal solution with high precision,but also run faster than EDA and their variants.In order to reduce the number of the parameters in student＇s t-distribution,we adapt its closed-form in latent space to replace it,and use the expectation maximization algorithm to estimate its parameters.To escape from local optimum,a new strategy adaptively tune the degree of freedom in the tdistribution is also proposed.As we introduce the technology of latent variable,the computational cost in EDA-t significantly decreases while the quality of solution can be guaranteed. The experimental results show that the performance of EDA-t is super than or equal to the state-of-the-art evolutionary algorithms for solving the large scale optimization problems.