本文選題：遺傳算法　切入點：年度計劃　出處：《計算機(jī)與數(shù)字工程》2016年08期 　論文類型：期刊論文

【摘要】：論文深入分析了年度排課問題的特點,提出了一種基于改進(jìn)遺傳算法的求解方法。該方法通過分析適應(yīng)度與編碼之間的內(nèi)在關(guān)系,對常規(guī)遺傳算法的雜交和變異操作進(jìn)行了改進(jìn),提出了基于子適應(yīng)度的縱向基因雜交法和自適應(yīng)變異策略等方法。仿真結(jié)果表明該改進(jìn)的遺傳算法相比于常規(guī)遺傳算法在求解年度排課問題時性能有了較大的提升。
[Abstract]:In this paper, the characteristics of the annual course scheduling problem are deeply analyzed, and a solution method based on the improved genetic algorithm is proposed, which is based on the analysis of the inherent relationship between fitness and coding. The hybrid and mutation operation of conventional genetic algorithm is improved. The longitudinal gene hybridization method and adaptive mutation strategy based on subfitness are proposed. The simulation results show that the improved genetic algorithm has a better performance than the conventional genetic algorithm in solving the annual course scheduling problem.
【作者單位】： 山東省質(zhì)量技術(shù)監(jiān)督教育培訓(xùn)中心;山東電力工程咨詢院有限公司;
【分類號】：G473;TP18

【相似文獻(xiàn)】

相關(guān)碩士學(xué)位論文 前1條

1 姚建波;基于遺傳算法的排課問題的研究[D];貴州大學(xué);2008年

，

本文編號：1612659