计算机工程与应用
計算機工程與應用
계산궤공정여응용
COMPUTER ENGINEERING AND APPLICATIONS
2009年
31期
37-39
,共3页
文化算法%广义信念空间%调度问题%NP完全难
文化算法%廣義信唸空間%調度問題%NP完全難
문화산법%엄의신념공간%조도문제%NP완전난
cultural algorithm%generalized belief space%scheduling problem%NP-complete hard
优化调度问题是计算机领域的NP完全难问题,论文探讨了求解该问题的改进文化算法仿真计算.用数学模型形式化该问题.基于三个主要遗传算子,创新地采用可对应Ⅳ维解空间广义信念空间定义的文化算法求解问题.大量仿真实验结果表明了算法的可行性、正确性和较传统GA的优越性.
優化調度問題是計算機領域的NP完全難問題,論文探討瞭求解該問題的改進文化算法倣真計算.用數學模型形式化該問題.基于三箇主要遺傳算子,創新地採用可對應Ⅳ維解空間廣義信唸空間定義的文化算法求解問題.大量倣真實驗結果錶明瞭算法的可行性、正確性和較傳統GA的優越性.
우화조도문제시계산궤영역적NP완전난문제,논문탐토료구해해문제적개진문화산법방진계산.용수학모형형식화해문제.기우삼개주요유전산자,창신지채용가대응Ⅳ유해공간엄의신념공간정의적문화산법구해문제.대량방진실험결과표명료산법적가행성、정학성화교전통GA적우월성.
The optimized scheduling problem is NP-complete hard in the computer field and the paper discusses the simulation calculation of the cultural algorithm for solving the problem.This paper has formalized the problem in the math model.And then has solved the problem based on the three main genetic operators,it has applied the improved cultural algorithm whose belief spaces have innovated in being generalized corresponding to the n-dimension solution spaces.The experimental results have indicated the feasibility,the correctness and the superiority to the traditional GA.
