期刊文献+

柔性流水车间排产问题的一种协同进化CGA求解方法 被引量:5

A co-evolution CGA solution for the flexible flow shop scheduling problem
下载PDF
导出
摘要 为了解决柔性流水车间排产优化问题(flexible flow shop scheduling problem,FFSP),设计了一种动态协同进化紧致遗传算法(dynamic co-evolution compact genetic algorithm,DCCGA)作为全局优化算法。DCCGA算法基于FFSP特点,构建了描述问题解空间分布的概率模型,并对标准紧致遗传算法(compact genetic algorithm,CGA)的进化机制以及个体选择方式进行了改进。在其进化过程中,2个概率模型结合最优个体继承策略协同进化,并以一定的频率进行种群基因分布信息的交流,提高了算法进化过程中的种群基因信息多样性,增强了优良进化趋势的稳定性以及算法持续进化的能力。设计实验对DCCGA算法中新引入的重要参数进行了分析和探讨,确定了最佳参数值。最后,采用不同规模的FFSP实例对DCCGA算法进行测试,与已有算法进行对比分析,验证了DCCGA算法对于解决FFSP的有效性。 In order to solve the flexible flow shop scheduling problem( FFSP),a dynamic co-evolution compact genetic algorithm( DCCGA) is designed as the global optimization algorithm. In DCCGA,a probabilistic model is constructed to describe the distribution of solutions of the problem,and two modifications are incorporated in the standard compact genetic algorithm( CGA) for improving the evolutionary mechanism and individual selection method. DCCGA's evolutionary process is led by two probabilistic models,which contains the optimal individual inheritance strategy,and communicates with each other at a certain frequency with the population genetic information. Hence,the diversity of the population genetic information is improved during the process,and also the stability of good evolutionary trend and the capacity of continuous evolution are greatly strengthened at the same time. Moreover,the suitable parameter value is suggested based on relative experiments. And,DCCGA is measured by the benchmark problems with comparison of several effective algorithm s. The results show that DCCGA is feasible for solving FFSP.
出处 《智能系统学报》 CSCD 北大核心 2015年第4期562-568,共7页 CAAI Transactions on Intelligent Systems
基金 中科院重点实验室开放课题资助 国家重大科技专项资助项目(2011ZX02601-005)
关键词 双概率模型 动态协同进化 最优个体继承策略 紧致遗传算法 柔性流水车间 bi-probabilistic models dynamic co-evolution optimal individual inheritance strategy compact genetic algorithm flexible flow shop
  • 相关文献

参考文献17

  • 1RUIZ R, V,~ZQUEZ-ROI)R[GUEZ J A. The hybrid flow shop scheduling problem [ J 1. European Journal of Opera- tional Research, 2010, 205( 1 ) : 1-18.
  • 2JOHNSON S M. Optimal two-and three-stage production schedules with setup times included [ J 1. Naval Research Logistics Quarterly, 1954, 1 ( 1 ) : 61-68.
  • 3HOOGEVEEN J A, LENSTRA J K, VELTMAN B. Preemp- tive scheduling in a two-stage muhiprocessor flow shop is NP-hard [ J ]. European Journal of Operational Research, 1996, 89( I ) : 172-175.
  • 4SRISKANDARAJAH C, SETHI S P. Scheduling algorithms fnr flexible flowshops: worst and average ease performance [J]. European Journal of Operational Research, 1989, 43 (2) : 143-160.
  • 5ENG1N O, CERAN G, YII,MAZ M K. An efficient genetic algorithm fin" hybrid flow shop scheduling with muhiproees- sor task problems [ J 1- Applied Soft Computing, 2011 , 11 ( 3 ) : 3056-3065.
  • 6SINGH M R, MAHAPATRA S S. A swarm optimization ap- proach for flexible flow shop scheduling with muhiproeessor tasks[J1. The International Journal of Advanced Manufac- turing Technology, 2012, 62(1/2/3/4) : 267-277.
  • 7XU Y, WANG L, WANG S Y, et al. An effective immune algorithm based on novel dispatching rules for the flexible flow-shop scheduling problem with muhiproeessor tasks[ J l. The International Journal of Advanced Manufacturing Tech- nology, 2013, 67(1/2/3/4) : 121-135.
  • 8王圣尧,王凌,许烨.求解相同并行机混合流水线车间调度问题的分布估计算法[J].计算机集成制造系统,2013,19(6):1304-1312. 被引量:27
  • 9王圣尧,王凌,方晨,许烨.分布估计算法研究进展[J].控制与决策,2012,27(7):961-966. 被引量:70
  • 10HARIK G R, LOBO F G, GOLDBERG 1) E. Tile compaet genetic algorithm [ J ]. IEEE Transactions on Evolutionary Computation, 1999, 3 (4) : 287-297.

二级参考文献19

共引文献94

同被引文献34

引证文献5

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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