發(fā)布時(shí)間：2018-01-13 21:33

  本文關(guān)鍵詞：多校區(qū)高校自動(dòng)排課系統(tǒng)的研究與設(shè)計(jì)　出處：《電子科技大學(xué)》2013年碩士論文　論文類型：學(xué)位論文

  更多相關(guān)文章： 遺傳算法 課表 沖突 甩課 適應(yīng)度

【摘要】：科學(xué)、規(guī)范的教學(xué)管理是獲得高水平教學(xué)質(zhì)量的必要條件，課表安排則是教學(xué)管理中最為關(guān)鍵的一環(huán)。制定一個(gè)靈活、高效、人性化的課程表，將對(duì)后繼教學(xué)活動(dòng)的有序開展起到至關(guān)重要的作用。因此，對(duì)課表安排問題進(jìn)行深入、細(xì)致的研究，具有非常重要的現(xiàn)實(shí)意義。近幾年，很多高校因?yàn)閿U(kuò)招而使得教學(xué)資源變得越來越緊張，在此背景之下，以往用人工安排課表的方法因?yàn)檫^程復(fù)雜、耗時(shí)長(zhǎng)、準(zhǔn)確度無法保證等不足而不能滿足現(xiàn)代教學(xué)要求。另外，隨著計(jì)算機(jī)的普及，其快速、準(zhǔn)確、自動(dòng)化的優(yōu)點(diǎn)給各個(gè)行業(yè)帶來了很大的便利。因此，可以將計(jì)算機(jī)運(yùn)用于現(xiàn)代教學(xué)活動(dòng)，根據(jù)教學(xué)要求，利用計(jì)算機(jī)求解不同課程間的排列組合，從而得出相應(yīng)的排課方案。排課實(shí)質(zhì)上是為了實(shí)現(xiàn)對(duì)有限教學(xué)資源的合理分配，優(yōu)化教學(xué)質(zhì)量，實(shí)現(xiàn)教學(xué)目標(biāo)而采取的規(guī)劃，即安排適當(dāng)?shù)慕淌摇⒔處熢谇‘?dāng)?shù)臅r(shí)間完成全部的教學(xué)任務(wù)。 排課問題具有以下幾個(gè)特點(diǎn)：具有一定約束條件、非線性以及多目標(biāo)優(yōu)化。而對(duì)于這種比較難解決的非線性方面的命題，遺傳算法具有很大優(yōu)勢(shì)。其原理是利用生物遺傳規(guī)律，運(yùn)用群體搜索的理論，，有效彌補(bǔ)了以往搜索方法的不足。 本文對(duì)多校區(qū)排課中出現(xiàn)的問題、原因進(jìn)行了研究。分析了多校區(qū)排課中的影響因素、主要約束條件、求解目標(biāo)和難點(diǎn)，并根據(jù)多校區(qū)排課問題的特點(diǎn)，將6元組問題簡(jiǎn)化成2元組問題，縮小問題規(guī)模，完整闡述了多校區(qū)排課的數(shù)學(xué)模型。 論文在遺傳算法的相關(guān)理論基礎(chǔ)上，討論了利用遺傳算法解決排課問題的可能，并據(jù)此提出了相應(yīng)的解決算法。對(duì)算法從編碼、交叉、變異設(shè)計(jì)進(jìn)行改進(jìn)：設(shè)計(jì)了二維資源片十進(jìn)制編碼方案，既方便初始種群產(chǎn)生和沖突檢測(cè)，又減小了時(shí)間復(fù)雜度；提出了一套新的能有效解決多校區(qū)排課的方法。同時(shí)，該算法充分考慮了排課時(shí)涉及到的一些重要因素，對(duì)其間發(fā)生的沖突提出了相應(yīng)的解決方法。 最后，通過對(duì)吉林工商學(xué)院多校區(qū)教學(xué)現(xiàn)狀的分析，實(shí)現(xiàn)了基于改進(jìn)遺傳算法的課表編排系統(tǒng)，并將該系統(tǒng)應(yīng)用于實(shí)際排課過程，經(jīng)理論和實(shí)踐表明該系統(tǒng)具有良好的自適應(yīng)性，且效率較高。
[Abstract]:Scientific and standardized teaching management is the necessary condition to obtain the high level teaching quality, and the schedule arrangement is the most important link in the teaching management. Make a flexible, efficient and humanized curriculum. It will play a vital role in the orderly development of subsequent teaching activities. Therefore, it is of great practical significance to make a thorough and detailed study on the arrangement of curriculum in recent years. Many colleges and universities because of the expansion of teaching resources become more and more tight, in this context, in the past, the use of manual scheduling method because of the complexity of the process, time-consuming. Accuracy can not be guaranteed and can not meet the requirements of modern teaching. In addition, with the popularity of computers, its advantages of speed, accuracy and automation have brought great convenience to various industries. The computer can be used in modern teaching activities. According to the teaching requirements, the computer can be used to solve the arrangement and combination of different courses. In essence, it is to achieve the reasonable allocation of limited teaching resources, optimize the quality of teaching, achieve the goal of teaching planning, that is, arrange appropriate classrooms. The teacher completed all the teaching tasks at the right time. The course scheduling problem has the following characteristics: some constraints, nonlinearity and multi-objective optimization, but for this difficult to solve the nonlinear aspects of the proposition. Genetic algorithm (GA) has great advantages. Its principle is to make up for the deficiency of previous search methods by using biological genetic law and the theory of population search. This paper studies the problems and causes in multi-campus scheduling, analyzes the influencing factors, main constraints, solving objectives and difficulties in multi-campus scheduling, and according to the characteristics of multi-campus scheduling problems. The 6-tuple problem is simplified into a 2-tuple problem, the scale of the problem is reduced, and the mathematical model of course scheduling in multi-campus is completely expounded. Based on the theory of genetic algorithm, this paper discusses the possibility of using genetic algorithm to solve the problem of course scheduling, and puts forward the corresponding algorithm. The mutation design is improved: a 2-D resource slice decimal coding scheme is designed, which not only facilitates the initial population generation and conflict detection, but also reduces the time complexity; A new method to solve the problem of multi-campus scheduling is proposed. At the same time, some important factors involved in the course scheduling are fully considered, and the corresponding solutions to the conflicts between them are put forward. Finally, through the analysis of the current teaching situation of Jilin Polytechnic College, the course schedule arrangement system based on improved genetic algorithm is realized, and the system is applied to the actual course scheduling process. The theory and practice show that the system has good adaptability and high efficiency.
【學(xué)位授予單位】：電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類號(hào)】：G647;TP301.6

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

1 龍一飛,郭文宏;基于知識(shí)推理的排課系統(tǒng)[J];電腦開發(fā)與應(yīng)用;2000年06期

2 方江yN;段富;;基于遺傳算法的排課問題分層研究[J];電腦開發(fā)與應(yīng)用;2010年05期

3 王巖冰,鄭明春,劉弘;回溯算法的形式模型[J];計(jì)算機(jī)研究與發(fā)展;2001年09期

4 石慧;彭曉紅;鄔志紅;舒遠(yuǎn)仲;;求解多校區(qū)排課問題的基因?qū)徊孢z傳算法[J];計(jì)算機(jī)工程與應(yīng)用;2010年18期

5 林巧;利用回溯法求解若干問題的探討[J];計(jì)算機(jī)時(shí)代;2002年08期

6 唐勇,唐雪飛,王玲;基于遺傳算法的排課系統(tǒng)[J];計(jì)算機(jī)應(yīng)用;2002年10期

7 田嶺;;大學(xué)自動(dòng)排課算法設(shè)計(jì)與實(shí)現(xiàn)[J];教育信息化;2006年13期

8 張春梅,行飛;用自適應(yīng)的遺傳算法求解大學(xué)課表安排問題[J];內(nèi)蒙古大學(xué)學(xué)報(bào)(自然科學(xué)版);2002年04期

9 聶丁;;基于遺傳算法的高校排課系統(tǒng)設(shè)計(jì)[J];軟件導(dǎo)刊;2010年09期

10 許可,李未;隨機(jī)約束滿足問題的回溯算法分析[J];軟件學(xué)報(bào);2000年11期

本文編號(hào)：1420646