GAによる研究室配属問題の一解法

URI http://harp.lib.hiroshima-u.ac.jp/it-hiroshima/metadata/3779
File
Title
GAによる研究室配属問題の一解法
Title Alternative
A Method of Seminar Assignment by GA
Author
氏名 原 肇
ヨミ ハラ ハジメ
別名 Hara Hajime
氏名 砂田 謙二
ヨミ スナダ ケンジ
別名 Sunada Kenji
氏名 玉野 和保
ヨミ タマノ カズホ
別名 Tamano Kazuho
Subject
seminar assignment
genetic algorithm
fitness
the part of points made
the part of fixed numbers
the selection points tendered
NDC
007.13
Abstract

Seminar assignment is a matter of primary concern for students. It is desired that requested seminars are assigned to all students. But there are some cases where a few students’ requirements are unable to be well satisfied by the collected data of the year. A few involuntary students must join the seminars against their wishes. So optimizing method of the seminar assignment used by Genetic Algorithm (GA) is proposed. Each student offers his major ranks to the three favorite seminars and tenders points from his share points (9 points) to each seminar. The selection of points tendered of students enlarge fitness which is consists of the part of the points made and the part of the fixed numbers. This result compares favorably with ordinary assignment. This method makes better use of assignment power of the large number of students.

Journal Title
広島工業大学研究紀要
Volume
34
Spage
1
Epage
6
Published Date
2000
Publisher
広島工業大学
ISSN
03851672
NCID
AN0021271X
Language
jpn
NIIType
Departmental Bulletin Paper
Text Version
出版社版
Old URI
Set
it-hiroshima