志愿分級篩選算法在選課系統中的分析與改進

摘 要:在選課系統中，當同一門課程有多個教學班或要求學生選課必須有多個志愿時，適合使用志愿分級篩選算法。為了使選課過程更加科學化、人性化，對該算法進行了系統的分析，并從選課前準備工作、預選和正選三方面提出了改進措施，從而得到一個實用性更強，更加完善的選課算法。用改進后志愿分級篩選算法設計的選課系統，使優秀的學生可以優先選到自己感興趣的課程，使選課系統更加人性化，更加適合學生學習的需求。關鍵詞:選課系統; 志愿分級篩選算法; 平均分布概率算法; 權重

中圖分類號:TN911-34; TP311文獻標識碼:A

文章編號:1004-373X(2010)16-0026-03

Improvement of Voluntary Screening Algorithm for Classification in Course-selecting System

LI Chun-jie1，2， LIU Jie2， LI Dian-kui1， GUO Ji-ping1

(1.Commonality Teaching Department of Computer， Jiamusi University， Jiamusi 154007， China;

2.College of Computer Science and Technology， Harbin Engineering University， Harbin 154001， China)

Abstract: In course-selecting system， the voluntary screening algorithm for classification is suitable for the situation that there is a course with several classes or a student must select more than one courses as he makes selection. The algorithm is analyzed in this paper for making the process of the course selection more scientific and humane. The improvement measures are proposed in three aspects: preparation before course selection， pre-selection and formal selection， which allow the course selection algorithm to be more perfect. The course-selecting system designed with the improved voluntary screening algorithm for classification causes the good students to have priority in course selection to their own interest， and makes the elective system more humane and more appropriate to the students.Keywords: course-selecting system; voluntary screening algorithm for classification; average distribution probabilistic algorithm; weight

0 引 言

目前在高校中大多都已經實行了選課制，隨著網絡的普及，網上選課系統的出現，隨之而來的選課算法也不斷地出現和改進，而且越來越體現出選課的公平和公正性。

最簡單的先來先服務算法是根據選課時間的先后進行選課操作，當選課人數達到最大限選人數時即結束;若學生為了選到自己喜歡的課都在同一時間段內進行選課，容易造成網絡擁堵，而且由于網速的問題也可能出現學生先選的不一定先得到服務[1]。抽簽算法主要用于處理選課人數超過限選人數的情況。對于抽簽算法，抽簽的方法又不盡相同，總結起來有隨機抽取、按權重高低抽取和各種優先排列抽取等[2]。目前常用的優先排列抽取主要有專業優先算法，成績優先算法，按名額分配比例算法，志愿分級篩選算法等。……