期刊文献+

生产调度优化问题文化进化算法研究 被引量:1

Research on Cultural Evolutionary Algorithms applied to scheduling optimization problems
下载PDF
导出
摘要 许多生产调度优化问题属于NP-hard问题,其求解通常采用智能启发式算法。基于文化算法及文化进化思想设计的文化进化算法,通过上层文化空间的经验知识指导下层个体进化搜索的方向及步长,通过模拟人类社会文化进化的机制实现文化空间的进化与更新,最后将算法应用到置换Flow shop问题的求解,用Matlab编程仿真测试,结果表明此算法解决生产调度优化问题是可行的,而且其全局搜索性能优于一种改进的GA算法。 Most of scheduling optimization problems are NP-hard problems,many heuristic algorithms are developed in the search of best results.Cultural Evolutionary Algorithms,based on the mechanism of cultural evolution and Cultural Algorithms,guide the direction and step of individuals in the search,by using the knowledge of cultural space.At the same time,the top cultural space is evolving and updating.Then CEA are applied to Flow shop problems.The algorithm is tested with Matlab simulation,and the re- sult shows that CEA are effective in scheduling optimization problems and much better than GA.
出处 《计算机工程与应用》 CSCD 北大核心 2007年第36期55-57,123,共4页 Computer Engineering and Applications
基金 上海市重点学科建设项目资助(No.T0502)
关键词 调度优化问题 文化进化算法 FLOW shop调度问题 scheduling optimization problems Cultural Evolutionary Algorithms(CEA) Flow shop problem
  • 相关文献

参考文献10

  • 1Reynolds R G.An introduction to cultural algorithms[C]//Proceedings of 3rd Annual Conference on Evolutionary. Programming,Sebald A,Fogel L, 1994, 131-139.
  • 2Reynolds R G,Chung C J.A self-adaptive approach to representation shifts in cultural algorithms[C]//Proceedings of IEEE International Conference on Evolutionary Computati on,Nagoya,Japan, 1996 , 94-99.
  • 3Reynolds R G,Michalewicz Z,Cavaretta M.Using cultural algorithms for constraint handling in GENOCOP[C]//Proceedings of the Fourth Annual Conference on Evolutionary Programming,1995,298-305.
  • 4Chung C J,Reynolds R G.Knowledge-based self-adaptation in evolutionary search [J].International Journal of Pattern Recognition and Artificial Intelligence, 2000, 14( 1 ) : 19-33.
  • 5杨海英,黄皓,窦全胜.基于文化算法的负载均衡自适应机制[J].计算机工程与应用,2005,41(21):146-148. 被引量:8
  • 6刘纯青,杨莘元,张颖.基于文化算法的聚类分析[J].计算机应用,2006,26(12):2953-2955. 被引量:14
  • 7蒙祖强,蔡自兴.一种新的计算方法:粒度进化计算[J].计算机工程与应用,2006,42(1):5-8. 被引量:10
  • 8托马斯·哈定.文化与进化[M].杭州:浙江人民出版社,1987..
  • 9王小平 曹立明.遗传算法-理论、应用与软件实现[M].西安:西安交通大学出版社,2001..
  • 10王磊,黄文奇.求解置换Flow shop调度问题的一种启发式算法[J].计算机工程与应用,2004,40(19):31-32. 被引量:3

二级参考文献33

  • 1刘靖明,韩丽川,侯立文.基于粒子群的K均值聚类算法[J].系统工程理论与实践,2005,25(6):54-58. 被引量:122
  • 2吴汝康.对人类进化全过程的思索[J].人类学学报,1995,14(4):285-296. 被引量:19
  • 3T.杜布赞斯基.进化的未来[J].生物科学动态,1984,(3).
  • 4克莱德·伍兹著 施惟迭 胡华生译.文化变迁[M](第1版)[M].云南教育出版社,1989-07..
  • 5Yao Y Y.Stratified rough sets and granular computing[C].In:Dave, RN,Sudkamp T Eds.Proceedings of the 18th International Conference of the North American Fuzzy Information Processing Society, New York,USA,IEEE Press, 1999:800-804.
  • 6Zadeh L A.Some reflections on soft computing,granular computing and their roles in the conception, design and utilization of information/intelligent systems[J].Soft Computing, 1998 ; 2 ( 1 ) : 23-25.
  • 7Reeves C R.A genetic algorithm for flow shop sequencing[J].Computers and Operations Research,1995;22(1):5~13
  • 8Osman I H,Potts C N.Simulated annealing for permutation flow-shop scheduling[J].Omega,1989;17(6):551~557
  • 9Nowicki E,Smutnieki C.A fast tabu search algorithm for the permutation flow-shop problem[J].European Journal of Operational Research,1996 ;91(2):160~175
  • 10Ben-Daya M,A1-Fawzan M.A tabu search approach for the flow shop scheduling problem[J].European Journal of Operational Research,1998;109(1):88~95

共引文献49

同被引文献6

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部