2026-03-13T10:48:14Z https://fit.repo.nii.ac.jp/oai

oai:fit.repo.nii.ac.jp:00000703 2023-05-15T12:41:02Z 256:257:371

イデンテキ アルゴリズム ニ オケル トツゼン ヘンイ ノ カイ ニ オヨボス エイキョウ ニ ツイテ 遺伝的アルゴリズムにおける突然変異の解におよぼす影響について The Effects of Mutations on Solutions in Genetic Algorithm 百原, 武敏 3276 荒屋, 真二 3277 Genetic algorithm Mutation Knapsack Problem Genetic algorithm Mutation Knapsack Problem application/pdf 論文(Article) This paper discusses the characteristics of genetic algorithms from the view point of mutation. Two kinds of mutation with fixed and variable probabilities are used for the Knapsack problem in our experiments. The following results are obtained : (1) The quality of solution is better when using mutation of a suitable probability value than not. (2) There exists an optimal value of mutation probability. (3) The variable mutation method where the probability decreases together with generations could converge to the best solution. departmental bulletin paper 福岡工業大学 1996-10-30 VoR application/pdf 福岡工業大学研究論集 1 29 175 182 RESEARCH BULLETIN OF FUKUOKA INSTITUTE OF TECHNOLOGY 02876620 https://fit.repo.nii.ac.jp/record/703/files/29(1)-175.pdf http://hdl.handle.net/11478/00001667 https://fit.repo.nii.ac.jp/records/703 jpn