摘要
优化调度问题是计算机领域的NP完全难问题,论文探讨了求解该问题的改进文化算法仿真计算。用数学模型形式化该问题。基于三个主要遗传算子,创新地采用可对应N维解空间广义信念空间定义的文化算法求解问题。大量仿真实验结果表明了算法的可行性、正确性和较传统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 resuhs have indicated the feasibility,the correctness and the superiority to the traditional GA.
出处
《计算机工程与应用》
CSCD
北大核心
2009年第31期37-39,共3页
Computer Engineering and Applications
基金
国家自然科学基金No.2003AA1Z2320
山东省科技攻关计划No.2005GG4201009~~
关键词
文化算法
广义信念空间
调度问题
NP完全难
cultural algorithm
generalized belief space
scheduling problem
NP-complete hard
