| 摘要 |
PROBLEM TO BE SOLVED: To provide a method for optimizing a continuous complicated system which is under constraint. SOLUTION: The performance of the design parameter of a target function, obtained by modeling a system, is expressed in a multi-dimensional search space. The set of vertexes is arranged in the search space. Those respective vertexes are provided with performance. The vertexes in the set are sorted, so as to be sequenced from the worst performance to the best performance. The respective vertexes in the set ordered in this way are moved to the next position, when the performance at the next position can be made more satisfactory than the present performance. Then, sorting and movement are repeated cyclically, until end conditions are reached.
|
