最適化シンポジウム講演論文集
Online ISSN : 2424-3019
セッションID: 214
会議情報
214 大域的最適化のための複数最適化手法の動的制御法
日和 悟廣安 知之三木 光範
著者情報
会議録・要旨集 フリー

詳細
抄録

When we apply the optimization algorithms to the target problems, the selection of an optimization algorithm significantly influences the accuracy of solutions. Therefore, we have to select the appropriate algorithms according to the complexity of problems. In this, we assume the total simulation is given by the users. Then, in our strategy to choose the optimization, there are two features ; 1) the maximum time to execute the optimization algorithms is defined, and the purpose of the strategy is to obtain the better solutions for the limited time, and 2) the landscape of the search space can be roughly grasped after the optimization has been finished. In this paper, we describe the algorithms used for the proposed strategy: SQP, GA and DIRECT. The searching ability of each algorithm is also discussed. We illustrated the strategy template how to use these three algorithms.

著者関連情報
© 2006 一般社団法人 日本機械学会
前の記事 次の記事
feedback
Top