中立突然変異型GAによるジョブショップ・スケジューリング問題の解法

概要

論文の詳細を見る
This paper presents a new genetic algorithm (GA)-based approach to job-shop scheduling problems (JSSPs). The proposed method adopts an extended GA, called GA with neutral mutations, which has originally been proposed in order to improve GA robustness for function optimization performance in solving various GA-hard problems. In order to apply this GA to JSSPs, a redundant genotype is constructed to have three layers: substring layer, operon layer and locus layer. The developmental process from the genotype to the phenotype is defined as the process of obtaining an active schedule using a mature function which includes the functionarity of GT-algorithm. Computer simulations are conducted on two benchmark problems in order to compare the performance of the proposed approach with those of others.
1997-10-25