Search

application/pdf, In this paper, the authors discuss optimization algorithms for engineering layout problems in industry, such as sheet metal design, VLSI floor plan design and so forth. We propose game-theoretic algorithms by constructing polyomino packing models for those problems. First of all, we showed effective performance of topological features for minimizing the layout area. Then, introducing layout constraints among individual pieces, the optimization algorithms were extended successfully without major changes in originals. A part of these results has been presented individually in society conferences or journals including this journal. In this paper, organizing the whole results, we construct a set of polyomino packing models as a general optimization algorithm and also, show its applicability for the varieties of actual layout problems.

application/pdf, It is well known that traveling salesm皿problem(for short. TSP) is one of most important problems for optimization, and almost all optimization problems result in TSP. This paper describes on an effective solution of TSP using genetic algorithm. The features of our method are summarized as follows: (1) By using division and unification method, a large problem is replaced with some small ones. (2) Smoothing method proposed in this paper enables us to obtain a fine approximate solution globally. Accordingly, demerits caused by division and unification method are decreased. (3) Parallel operation is available because all divided problems are independent of each other.