期刊文献+

重启进化提高较大搜索规模时柔性作业解质量

Improving performance of Coevolutionary algorithm for flexible job-shop scheduling problem
下载PDF
导出
摘要 种群多样性下降导致的早熟收敛限制了进化算法的求解质量与搜索效率。为应对收敛,提高较大搜索规模时的求解质量,引入随机算法中重启策略。种群收敛时,利用算法前期搜索结果(优势元素)和新产生的随机元素重新构造新种群继续进化。提高柔性作业车间调度问题解质量对实际工业生产有重要的现实意义。将重构思想应用于协同进化算法求解复杂柔性作业调度问题并跟踪种群进化状态。仿真实验结果表明,改进算法在进化过程中维持了较好的种群多样性,大幅提高了算法求解复杂柔性作业调度的搜索性能,并可以简单通过扩大搜索规模提高作业调度解质量。 Reduction of population diversity during evolution process leads to premature convergence, which limits search capability and computational efficiency of evolutionary algorithm. To deal with premature convergence, Restart Strategy(RS)is introduced into coevolutionary algorithm. When evolution loses search capability and efficiency, novel population is constructed with elite candidates and new randomly reproduced candidates, then it continues search process. The improved strategy is introduced to symbiotic evolutionary algorithm for a complex flexible job-shop scheduling prob-lem. Compared with the widely used traditional evolutionary algorithm, solution quality and computational efficiency are improved markedly for different search scale especially for complicated problems. Solution quality can be improved by enlarging search scale with the new strategy.
出处 《计算机工程与应用》 CSCD 2014年第14期245-250,共6页 Computer Engineering and Applications
基金 山东省中青年科学家奖励基金项目(No.2011BSB01183)
关键词 协同进化算法 重启 柔性作业调度 coevolutionary algorithm restart strategy flexible job-shop scheduling
  • 相关文献

参考文献4

二级参考文献63

  • 1张超勇,饶运清,刘向军,李培根.基于POX交叉的遗传算法求解Job-Shop调度问题[J].中国机械工程,2004,15(23):2149-2153. 被引量:108
  • 2吴秀丽,孙树栋,余建军,张红芳.多目标柔性作业车间调度优化研究[J].计算机集成制造系统,2006,12(5):731-736. 被引量:59
  • 3雷德明,吴智铭.Pareto档案多目标粒子群优化[J].模式识别与人工智能,2006,19(4):475-480. 被引量:25
  • 4朱洪 陈增武 等.算法设计与分析[M].上海:上海科学技术文献出版社,1989.119-120.
  • 5BRUCKER P, SCHHE R. Job Shop scheduling with multi- purpose machines[J]. Computing,1990,45(4) :369 375.
  • 6BRANDIMARTE P. Routing and scheduling in a flexible Joh Shop by taboo search[J]. Annals ol Operations Research, 1993,22(2) :157-183.
  • 7KACEM I, HAMMADI S, BORNE P. Approach by localiza- tion and multiobjective evolutionary optimization for flexible Job-Shop scheduling problems[J]. IEEE Transactions on Sys- tems, Man and Cybernetics,2002,32(1) :1-13.
  • 8XING Lining, CHEN Yingwu, YANG Kewei. Multi objective flexible Job Shop schedule:design and evaluation by simulation modeling[J]. Applied Soft Computing, 2009,9 (1) : 362-376.
  • 9NHU B H, JOC C T, EDMUND M. An effective architecture for learning and evolving flexible Job-Shop schedules[J]. Eu ropean Journal of Operational Research, 2007, 179 (2): 316-333.
  • 10VINCENT T, NICOLAS M, FABRICE T. An ant colony op timizaiton algorithm to sovle a 2-machine bicriteria flowshop scheduling prohlem[J]. European Journal of Operational Re- search, 2002,142(2) : 250 257.

共引文献167

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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