东北大学学报(自然科学版) ›› 2008, Vol. 29 ›› Issue (7): 936-939.DOI: -

• 论著 • 上一篇    下一篇

求解柔性作业车间调度问题的免疫遗传算法

马佳;高立群;石刚;李丹;   

  1. 东北大学信息科学与工程学院;东北大学信息科学与工程学院;东北大学信息科学与工程学院;东北大学信息科学与工程学院 辽宁沈阳110004;辽宁沈阳110004;辽宁沈阳110004;辽宁沈阳110004
  • 收稿日期:2013-06-22 修回日期:2013-06-22 出版日期:2008-07-15 发布日期:2013-06-22
  • 通讯作者: Ma, J.
  • 作者简介:-
  • 基金资助:
    国家高技术研究发展计划项目(2003AA414032)

Immune genetic algorithm the flexible job-shop scheduling problem

Ma, Jia (1); Gao, Li-Qun (1); Shi, Gang (1); Li, Dan (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-22 Revised:2013-06-22 Online:2008-07-15 Published:2013-06-22
  • Contact: Ma, J.
  • About author:-
  • Supported by:
    -

摘要: 通过对柔性作业车间调度问题(FJSP)进行分析,借鉴生物免疫机理提出一种求解柔性作业车间调度问题的免疫遗传算法(IGA).该算法在保留基本遗传算法(SGA)随机全局搜索能力的基础上,通过抽取疫苗和接种疫苗等免疫机制,有效改善基本遗传算法的未成熟收敛和局部搜索能力差的不足,显著提高了基本遗传算法对全局最优解的搜索能力和收敛速度.仿真实例表明,免疫遗传算法能有效解决柔性作业车间调度问题.

关键词: 柔性作业车间调度问题, 资源约束, 免疫遗传算法, 免疫算子, 疫苗

Abstract: Analyzing the model of the flexible job-shop scheduling problem (FJSP), an immune genetic algorithm (IGA) is proposed to solve the problem. This algorithm preserves the random global search ability of simple genetic algorithm (SGA), and introduces the immune mechanism by which the necessary vaccine may be extracted with the scheduling vacinated so as to improve efficiently SGA's low ability for global search because of immature convergency and low local search ability. Thus, the IGA proposed can provide such ability and convergence rate that will implement the global optimum solution. Experimental results showed that the IGA can solve the FJSP effectively.

中图分类号: