希望点による研究室配属問題の一解法

URI http://harp.lib.hiroshima-u.ac.jp/it-hiroshima/metadata/3812
ファイル
タイトル
希望点による研究室配属問題の一解法
別タイトル
A Method of Seminar Assignment by the Selection Points Tendered
著者
氏名 原 肇
ヨミ ハラ ハジメ
別名 Hara Hajime
氏名 砂田 謙二
ヨミ スナダ ケンジ
別名 Sunada Kenji
氏名 玉野 和保
ヨミ タマノ カズホ
別名 Tamano Kazuho
キーワード
seminar assignment
the genetic algorithm
fitness
the points made
the fixed number
the selection points tendered
own points
NDC
507
抄録

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 own points (9 points) for each seminar. The skilful assignment 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.

掲載雑誌名
広島工業大学研究紀要
35
開始ページ
1
終了ページ
4
出版年月日
2001
出版者
広島工業大学
ISSN
03851672
NCID
AN0021271X
本文言語
日本語
資料タイプ
紀要論文
著者版フラグ
出版社版
旧URI
区分
it-hiroshima