There exist many inverse problems in various fields, e.g. CT in medical field, inverse dynamics in control field, and so on. Puzzle problem is also one of our familiar inverse problems. It is important technique to solve such problems as optimization problems. Though GA is one of promising approaches in order to solve inverse problem through optimization, we should solve "early convergence" problem and "diversity maintaining" problem. This paper presents a DGA applying different search method to each group (island) with selective migration strategy. We discuss the performance especially resulting from the selective manner of migration, through numerical experiments of illustration logic problem, in terms of accuracy and diversity of the solutions.
抄録全体を表示