Genetic Algorithm on Set Partitioning Problem

• Main Authors: Chi-San Lin, 林祺山
• Other Authors: Ching-Chi Hsu
• Format: Others
• Language: zh-TW
• Published: 1994
• Online Access: http://ndltd.ncl.edu.tw/handle/65074018702923273150

碩士 === 國立臺灣大學 === 資訊工程研究所 === 82 === Set partitioning problems appear in a wide range of applications such as resource allocation ,political distinct and scheduling. Genetic algorithm is a general purpose optimization algorithm. Normally, they are directly applicable only to uncosntrained problems. Local serach heuristic is important to solve set partitioning problem. Without it , there may be a low probability to find a feasible solution of set partitioning problem. Local saerch hueristic itself can use only to solve Set Partitioning problem. The empirical results show our local search heuristic in a faster and more effective way to find a feasible solution. The consuming time is fewer, and the minimun cost of the Set Partitioning Problem is lower.