arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0902.1647cs.NEcs.AI
收藏

不同类型进化算法的竞争性比较

A competitive comparison of different types of evolutionary algorithms

Czech Technical University in Prague(捷克布拉格技术大学);Klokner Institute(洛克纳研究所)

O. Hrstka, A. Kucerova, M. Leps, J. Zeman

摘要:

本文介绍了作者在其以前的工作中为解决土木工程中出现的一些问题而开发的几种随机优化算法的比较。介绍的优化方法有:整数增广模拟退火(IASA)、实数编码增广模拟退火(RASA)、R. Storn和K.价格和简化实数编码差分遗传算法(SADE)。这些方法中的每一种都是针对一些特定的优化问题开发的,即Chebychev试验多项式问题,所谓的0型函数和两个工程问题-钢筋混凝土梁布局和周期性单胞问题。详细和广泛的数值试验进行了研究所提出的算法的稳定性和效率。我们的实验结果表明,RASA,IASA和SADE方法的性能和鲁棒性是相当的,而DE算法的性能稍差。这一事实与少量的内部参数一起促进了SADE方法作为实际使用中最稳健的方法。

英文摘要:

This paper presents comparison of several stochastic optimization algorithms developed by authors in their previous works for the solution of some problems arising in Civil Engineering. The introduced optimization methods are: the integer augmented simulated annealing (IASA), the real-coded augmented simulated annealing (RASA), the differential evolution (DE) in its original fashion developed by R. Storn and K. Price and simplified real-coded differential genetic algorithm (SADE). Each of these methods was developed for some specific optimization problem; namely the Chebychev trial polynomial problem, the so called type 0 function and two engineering problems - the reinforced concrete beam layout and the periodic unit cell problem respectively. Detailed and extensive numerical tests were performed to examine the stability and efficiency of proposed algorithms. The results of our experiments suggest that the performance and robustness of RASA, IASA and SADE methods are comparable, while the DE algorithm performs slightly worse. This fact together with a small number of internal parameters promotes the SADE method as the most robust for practical use.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑