@article{oai:it-hiroshima.repo.nii.ac.jp:00000624,
 author = {原, 肇 and 砂田, 謙二 and 玉野, 和保 and Hara, Hajime and Sunada, Kenji and Tamano, Kazuho},
 journal = {広島工業大学研究紀要},
 month = {},
 note = {application/pdf, 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.},
 pages = {1--4},
 title = {希望点による研究室配属問題の一解法},
 volume = {35},
 year = {2001},
 yomi = {ハラ, ハジメ and スナダ, ケンジ and タマノ, カズホ}
}