遺伝的アルゴリズムと極小値探索アルゴリズムとのハイブリッド化による板取り問題の一解法

概要

論文の詳細を見る
In layout design problems including blank nesting, the positions and directions of layout elements must be determined so as to minimize the total space. It is difficult and computationally time-consuming to find the optimal solution for such layout problems, because they include numerous underlying combinational conditions. In this paper, we develop an approach for optimal nesting by combining a genetic algorithm and a local minimization algorithm. In the approach, the genetic algorithm is used for handling combinations which are represented in the string, and the local minimization algorithm is used for determining the embodiment layout under fixed combinations so as to minimize the scrap space corresponding to the fitness value in the genetic algorithm. We also present an example for showing the effective nesting result produced by this approach.
1993-08-25