arrow
返回

A modified approach to cross entropy method: Elitist stepped distribution algorithm

delete2017-09-01
delete8
PRE
AI
M
Murat Altun
O
Onur Pekcan *
DOI:10.1016/j.asoc.2017.04.032delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This paper introduces a new algorithm named Elitist Stepped Distribution Algorithm (ESDA), which is inspired from the existing Cross Entropy Method (CEM) through the modification of elite sample based normal distribution used in CEM. Considering the natural behavior of normal distribution, ESDA is proposed to enhance the drawbacks of CEM through improving the efficiency in both exploration and exploitation processes when applying for complex function optimization problems. In ESDA, the elite sample percent defined in CEM is separated into two parts: (1) elite sample percent to calculate the mean value, and (2) elite sample percent to calculate standard deviation of normal distribution to construct an applicable balance between exploration and exploitation ability of the algorithm at a reasonable convergence speed. The elite sample percent parameter for the mean guides the algorithm to focus more on the better solutions and therefore improves the exploitation ability, whereas the elite sample percent parameter for the standard deviation controls the length of standard deviation to handle the exploration process more effectively. Performance of ESDA is investigated using unconstrained benchmark problems and compared with CEM, Simple Genetic Algorithm and Particle Swarm Optimization. The comparisons on unimodal and multi-modal functions confirm the efficiency of the algorithm in both exploration and exploitation process. In addition, the performance of ESDA is tested using constrained engineering problems commonly used in literature by comparing its performance with the other ones statistically. The results on engineering problems also prove that ESDA is perfectly applicable in real-world applications. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Elitist stepped distribution algorithm
Metaheuristic
Cross entropy method
Optimization
Unconstrained optimization problems
Engineering design problems
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Applied Soft Computing 封面图
Applied Soft Computing
IF:
6.6
论文数:
1.4W
被引数:
4.8W

机构

M
Middle East Technical University
学者数:
7.4K
论文数: 6.7K
被引数: 6.3K
引用论文

引用论文

A bat-inspired algorithm for structural optimization
err2013-11-01
err112
PREAI
errHasancebi, O.; Teke, T.; Pekcan, O.
err分享
err收藏
A tutorial on the cross-entropy method关于交叉熵方法的教程
err2005-02-01
err2.2K
PREAI
errDe Boer, PT; Kroese, DP; Mannor, S; Rubinstein, RY
err分享
err收藏
err分享
err收藏
Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
err2006-06-01
err3.2K
PREAI
errLiang, J. J.; Qin, A. K.; Suganthan, Ponnuthurai Nagaratnam; Baskar, S.
err分享
err收藏
NON-SEASONALITY OF SICKLE-CELL CRISIS
err1973-09-01
err0
PREAI
errRuthAndrea Seeler
err分享
err收藏
Planetary Landers and Entry Probes
err
IF0
err2009-08-12
err0
PREAI
errAndrew Ball; James Garry; Ralph Lorenz; Viktor Kerzhanovich
err分享
err收藏
学者 查看更多内容