J-STAGE トップ  >  資料トップ  > 書誌事項

進化計算学会論文誌
Vol. 7 (2016) No. 2 p. 46-55

記事言語:

http://doi.org/10.11394/tjpnsec.7.46

論文:「進化計算シンポジウム2015」特集号

This paper presents an analysis of an optimization process in asynchronous evolutionary algorithms from the viewpoint of influence of the relationship between characteristic of solutions and their evaluation time. An asynchronous evolutionary algorithm continuously evolves solutions without waiting for evaluations of other solutions, and consequently an asynchronous evolutionary algorithm is effective in the situation where the evaluation times of solutions differ from each other. This paper focuses on optimization problems in which the evaluation time of solutions depends on their characteristics. In particular, this paper considers two relationships; (a) the evaluation time relates to the evaluation value of solutions; and (b) the evaluation time relates to design variables of solutions. In each relationship, four correlation settings are defined; (1) uniform evaluation time setting where all solutions have the same evaluation time; (2) no-correlation setting where the evaluation time is not uniform but does not depend on characteristic of solutions; (3) positive correlation setting where the evaluation time increases by getting close to the optimal solution; and (4) negative correlation setting where the evaluation time increases by getting far awary from the optimmal solution. Experiments on the defined correlation settings are conducted on three conventional asynchronous evolutionary algorithms and four benchmark problems. The analytical results reveal the following implications; (1) in the case where the evaluation time relates to the evaluation value of solutions, when a lot of local optima exists in the search space such as multi-modal problems, a number of evaluations to escape from local optima is needed and the evaluation time of solutions close to local optima influences the computational time of search process. On the other hand, when it is hard to converge to the optimal solution, the evaluation time of solutions close to the optimal solution influences the computation time of search process; and (2) in the case where the evaluation time relates to the design variable of solutions, when the evaluation time of solutions decreases by getting close to the optimal solution, the computation time decreases because the search direction is biased toward the optimal solution.

Copyright © 2016 進化計算学会

記事ツール

この記事を共有