柔性流水车间排产问题的一种协同进化CGA求解方法
A co-evolution CGA solution for the flexible flow shop scheduling problem
查看参考文献17篇
|
文摘
|
为了解决柔性流水车间排产优化问题(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. |
|
来源
|
智能系统学报
,2015,10(4):562-568 【核心库】
|
|
DOI
|
10.3969/j.issn.1673-4785.201503045
|
|
关键词
|
双概率模型
;
动态协同进化
;
最优个体继承策略
;
紧致遗传算法
;
柔性流水车间
|
|
地址
|
1.
中国科学院沈阳自动化研究所, 中国科学院网络化控制系统重点实验室, 辽宁, 沈阳, 110016
2.
沈阳建筑大学信息与控制工程学院, 辽宁, 沈阳, 110168
|
|
语种
|
中文 |
|
文献类型
|
研究性论文 |
|
ISSN
|
1673-4785 |
|
学科
|
机械、仪表工业 |
|
基金
|
中科院重点实验室开放课题资助
;
国家重大科技专项
|
|
文献收藏号
|
CSCD:5487223
|
参考文献 共
17
共1页
|
|
1.
Ruiz R. The hybrid flow shop scheduling problem.
European Journal of Operational Research,2010,205(1):1-18
|
被引
48
次
|
|
|
|
|
2.
Johnson S M. Optimal two-and three-stage production schedules with setup times included.
Naval Research Logistics Quarterly,1954,1(1):61-68
|
被引
81
次
|
|
|
|
|
3.
Hoogeveen J A. Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard.
European Journal of Operational Research,1996,89(1):172-175
|
被引
24
次
|
|
|
|
|
4.
Sriskandarajah C. Scheduling algorithms for flexible flowshops: worst and average case performance.
European Journal of Operational Research,1989,43(2):143-160
|
被引
6
次
|
|
|
|
|
5.
Engin O. An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems.
Applied Soft Computing,2011,11(3):3056-3065
|
被引
12
次
|
|
|
|
|
6.
Singh M R. A swarm optimization approach for flexible flow shop scheduling with multiprocessor tasks.
The International Journal of Advanced Manufacturing Technology,2012,62(1/2/3/4):267-277
|
被引
3
次
|
|
|
|
|
7.
Xu Y. An effective immune algorithm based on novel dispatching rules for the flexible flow-shop scheduling problem with multiprocessor tasks.
The International Journal of Advanced Manufacturing Technology,2013,67(1/2/3/4):121-135
|
被引
3
次
|
|
|
|
|
8.
王圣尧. 求解相同并行机混合流水线车间调度问题的分布估计算法.
计算机集成制造系统,2013,19(6):1304-1312
|
被引
14
次
|
|
|
|
|
9.
王圣尧. 分布估计算法研究进展.
控制与决策,2012,27(7):961-966,974
|
被引
45
次
|
|
|
|
|
10.
Harik G R. The compact genetic algorithm.
IEEE Transactions on Evolutionary Computation,1999,3(4):287-297
|
被引
37
次
|
|
|
|
|
11.
Delaossa L. Avoiding premature convergence in estimation of distribution algorithms.
IEEE Congress on Evolutionary Computation, 2009,2009:455-462
|
被引
1
次
|
|
|
|
|
12.
Lee J Y. Compact Genetic Algorithms using belief vectors.
Applied Soft Computing,2011,11(4):3385-3401
|
被引
2
次
|
|
|
|
|
13.
Gallagher J C. A family of compact genetic algorithms for intrinsic evolvable hardware.
IEEE Transactions on Evolutionary Computation,2004,8(2):111-126
|
被引
3
次
|
|
|
|
|
14.
Moreno-Armendariz M A. Hardware implementation of the elitist compact Genetic Algorithm using Cellular Automata pseudo-random number generator.
Computers & Electrical Engineering,2013,39(4):1367-1379
|
被引
1
次
|
|
|
|
|
15.
Nakata M. Simple compact genetic algorithm for XCS.
2013 IEEE Congress on Evolutionary Computation (CEC),2013:1718-1723
|
被引
1
次
|
|
|
|
|
16.
刘昶. 求解混合流水生产线调度问题的变量相关EDA算法.
计算机集成制造系统,2014(1):15-18
|
被引
1
次
|
|
|
|
|
17.
Carlier J. An exact method for solving the multi-processor flow-shop.
RAIRO-Operations Research,2000,34(1):1-25
|
被引
19
次
|
|
|
|
|
了解气象卫星更多信息，请访问