计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (31): 37-39.DOI: 10.3778/j.issn.1002-8331.2009.31.012

• 研究、探讨 • 上一篇    下一篇

求解优化调度问题的仿真计算新方法

王静莲1,刘 弘2,柳新华1,李少辉2   

  1. 1.鲁东大学 现代教育技术教学部,山东 烟台 264025
    2.山东师范大学 信息科学与工程学院,济南 250014
  • 收稿日期:2008-11-12 修回日期:2009-05-14 出版日期:2009-11-01 发布日期:2009-11-01
  • 通讯作者: 王静莲

New simulation-calculation method of solving optimized scheduling problem

WANG Jing-lian1,LIU Hong2,LIU Xin-hua1,LI Shao-hui2   

  1. 1.Teaching Department of Modern Education Technology,Ludong University,Yantai,Shandong 264025,China
    2.School of Information Management,Shandong Normal University,Jinan 250014,China
  • Received:2008-11-12 Revised:2009-05-14 Online:2009-11-01 Published:2009-11-01
  • Contact: WANG Jing-lian

摘要: 优化调度问题是计算机领域的NP完全难问题,论文探讨了求解该问题的改进文化算法仿真计算。用数学模型形式化该问题。基于三个主要遗传算子,创新地采用可对应N维解空间广义信念空间定义的文化算法求解问题。大量仿真实验结果表明了算法的可行性、正确性和较传统GA的优越性。

关键词: 文化算法, 广义信念空间, 调度问题, NP完全难

Abstract: 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.

Key words: cultural algorithm, generalized belief space, scheduling problem, NP-complete hard

中图分类号: