文章基本信息

标题：厳しい計算回数制限下における多変数最適化問題への効果的アプローチの提案
本地全文：下载
作者：開発拓也 ; 渡邉真也
期刊名称：進化計算学会論文誌
电子版ISSN：2185-7385
出版年度：2018
卷号：9
期号：3
页码：93-102
DOI：10.11394/tjpnsec.9.93
出版社：The Japanese Society for Evolutionary Computation
摘要：In the real world, it has been strongly desired to develop an algorithm for solving an optimization problem with many variables under strictly limiting the number of function calls. Because of this kind of reason, evolutionary computation competition 2017 in evolutionary computation symposium hosted by the JSEC was designed for enhancing the development of practical optimization algorithms. The main features of this competition are that the benchmark problem is "Benchmark Problem Based on Real-World Car Structure Design Optimization(Mazda Benchmark Problem)" created from the actual real problem in the car company and the computational condition for optimizing this problem is so strict. In this competition, the number of function calls is limited to only 30,000 even though the number of variables of this problem is over 200 and the landscape of this problem is multi-modal. This paper presents the winning algorithm of this competition in the single-objective category and tries to reveal the reasons why this algorithm could work so effectively in competition problem. This algorithm is based on estimating a high potential search area by iterating solution sampling like Estimation of Distribution Algorithm (EDA) and has a mechanism for improving the algorithm's efficiency. The most important points of this algorithm are very simple and with no unnecessary mechanisms. Through applying this algorithm to not only the competition benchmark problem but also some typical test problems, the effectiveness of this algorithm was confirmed and the characteristics of this algorithm were analyzed..
关键词：evolutionaly computation;optimization algorithm;single;objective optimization;large scale global optimization;mazda benchmark problem