期刊文献+

全自适应遗传算法求解柔性作业车间调度问题 被引量:1

下载PDF
导出
摘要 本文提出一种基于自适应遗传算法(AGA)的FJSP求解方法。研究了基于迭代次数优化和适应度分布分析的自适应遗传算法,也即综合两者优点的全自适应遗传算法。该方法利用FJSP本身的特点,克服了传统GA进化初期早熟和中后期随机搜索速度慢的自身局限。求解精度和搜索效率提高的同时,既能避免陷入局部最优,又使收敛过程加速。
出处 《牡丹江大学学报》 2014年第3期151-153,共3页 Journal of Mudanjiang University
基金 大连海洋大学博士启动基金(SYBS201205) 国家科技支撑计划"大连市制造业信息化科技示范工程"(2013BAF02B03-2)
  • 相关文献

参考文献6

  • 1Ying Pan, Wei Sun, Xiao-Hong Lu. An Adaptive Genetic Algorithm for the Flexible Job-shop Scheduling Problem[C]. Proceedings 2011 IEEE International Conference on Computer Science and Automation Engineering, 2011: 405-409.
  • 2张超勇,饶运清,李培根,邵新宇.柔性作业车间调度问题的两级遗传算法[J].机械工程学报,2007,43(4):119-124. 被引量:105
  • 3Kacem I,Hammadi S,Bome P.Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems[C].The Proceeding of IEEE Transactions on Systems, Man and Cybernetics, 2002,32(1): 408-419.
  • 4Paulli J A. Hierarchical approach for the FMS scheduling problem[J]. European Journal of Operational Research, 1995, 86(1):32-42.
  • 5Chen H,Ihlow J,Lehmann C. A Genetic algorithm for flexible Job-shop scheduling[C]. IEEE international conference on robotics and automation, 1994,24(4):656-667.
  • 6Zhang H P, Gen M.Multistage-based genetic algorithm for flexible job-shop scheduling problem[J].Complexity International,2005,11 (1): 223-232.

二级参考文献11

  • 1张超勇,饶运清,刘向军,李培根.基于POX交叉的遗传算法求解Job-Shop调度问题[J].中国机械工程,2004,15(23):2149-2153. 被引量:107
  • 2DE JONG K A. An analysis of the behavior of a class of genetic adaptive systems[D]. Michigan: University of Michigan, 1975.
  • 3GOLDBERG D E, DEB K. A comparative analysis of selection schemes used in genetic algorithms[C]//RAWLINS G, ed. Foundations of Genetic Algorithms, Morgan Kaufmann, 1991.
  • 4KACEM I, HAMMADI S, BORNE P. Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems[J]. IEEE Transactions on Systems, Man. and Cybernetics, Part C, 2002,32(1): 408-419.
  • 5BLAZEWICZ J, FINKE G, HAOPT G. New trends in machine SCHEDULING[J].European Journal of Operational Research, 1988, 37:303-317.
  • 6MONTAZERI M, VAN WASSENHOVE L N. Analyses of scheduling rules for an FMS[J]. Int. J. Prod. Res., 1990,28: 785-802.
  • 7ZHANG H P, GEN M. Multistage-based genetic algorithm for flexible job-shop scheduling problem[J]. Complexity International, 2005, 11 : 223-232.
  • 8MESGHOUNI K, HAMMADI S, BORNE P. Hybrid representation for genetic algorithm to solve flexible job shop scheduling[C]//Proceedings of 15th IMACS, Berlin,Germany, 1997: 433-438.
  • 9MASTROLILLI M, GAMBARDELLA L M. Effective neighbourhood functions for the flexible job shop problem[J].Journal of Schecluling, 2000, 3(1): 3-20.
  • 10ZHU Z W, HEADY R B. Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach[J]. Computers & Industrial Engineering, 2000, 38: 297-315.

共引文献104

同被引文献4

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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