帮助 关于我们

返回检索结果

基于改进紧致遗传算法的柔性流水车间组批排产优化问题研究
Study for the flexible flow shop scheduling problem with batch process machines based on an advanced compact genetic algorithm

查看参考文献19篇

韩忠华 1   朱一行 2 *   史海波 3   董晓婷 4  
文摘 为了解决柔性流水车间组批排产优化问题(flexible flow shop scheduling problem with batch process machines, FFSP-BPM),对组批加工环节中工件加工方式的变化以及工件的组批方式进行了分析,建立了 FFSP-BPM的数学规划模型,并在标准紧致遗传算法的基础上,加入了基于汉明距离的个体选择机制,双个体概率模型更新机制和基于进化停滞代数的自适应精英继承策略三处改进,提出一种自适应协同进化紧致遗传算法(self-adaptive co-evolution compact genetic algorithm, SCCGA)作为全局优化算法.设计仿真实验,对算法中新引入的参数进行分析和探讨,确定了最佳参数值,最后通过实例测试,并与其他算法进行对比研究,验证了本算法对于解决实际生产中FFSP-BPM这类排产问题的有效性.
其他语种文摘 In order to solve the flexible flow shop scheduling problem with batch process machines (FFSP-PBM),both the change of jobs' processing methods and how jobs will be grouped in the batching process stages are analyzed, the FFSP-BPM's mathematical model is constructed, and a self-adaptive co-evolution compact genetic algorithm (SCCGA) which contains three modifications including the individual selection strategy in terms of Hanming distance, the probabilistic model updating mechanism with two individuals and the self-adaptive elite inherence strategy over the standard compact genetic algorithm, is proposed as the global optimizing tool. Furthermore, the best parameters are set after some relative tests. Results of the controlled trial in the last show the efficiency of our proposed SCCGA in solving the FFSP-BPM in the realistic production.
来源 系统工程理论与实践 ,2016,36(6):1616-1624 【核心库】
DOI 10.12011/1000-6788(2016)06-1616-09
关键词 柔性流水车间 ; 组批加工 ; 紧致遗传算法 ; 汉明距离 ; 双个体概率模型
地址

1. 沈阳建筑大学信息与控制工程学院, 中国科学院网络化控制系统重点实验室, 沈阳, 110168  

2. 鲁汶大学工程与技术学院, 根特, 9000  

3. 中囯科学院沈阳自动化研究所数字工厂研究室, 中国科学院网络化控制系统重点实验室, 沈阳, 110016  

4. 四川建筑职业技术学院电气工程系, 德阳, 618000

语种 中文
文献类型 研究性论文
ISSN 1000-6788
学科 机械、仪表工业
基金 国家重大科技专项 ;  中科院网络化控制系统重点实验室开放课题
文献收藏号 CSCD:5742005

参考文献 共 19 共1页

1.  Gupta J N D. Two-stage, hybrid flowshop scheduling problem. Journal of the Operational Research Society,1988:359-364 被引 58    
2.  Hoogeveen J A. Preemptive scheduling in a twostage multiprocessor flow shop is NP-hard. European Journal of Operational Research,1996,89(1):172-175 被引 24    
3.  Ikura Y. Efficient scheduling algorithms for a single batch processing machine. Operations Research Letters,1986,5(2):61-65 被引 20    
4.  梁静. 基于双层蚂蚁算法的半导体炉管制程批调度研究. 。系统工程理论与实践,2005,25(12):96-101 被引 5    
5.  Wang H. Scheduling batch and continuous process production based on an improved differential evolution algorithm. Systems Engineering - Theory & Practice,2009,29(11):157-167 被引 1    
6.  Damodaran P. Particle swarm optimization for scheduling batch processing machines in a permutation flowshop. The International Journal of Advanced Manufacturing Technology,2013,64(5/8):989-1000 被引 5    
7.  Chen H. A hybrid differential evolution algorithm for a two-stage flow shop on batch processing machines with arbitrary release times and blocking. International Journal of Production Research,2014,52(19):5714-5734 被引 1    
8.  黎展滔. 具有后成组约束的两阶段柔性流水作业计划制订的启发式算法. 机械工程学报,2013,49(12):183-192 被引 3    
9.  Zandieh M. Robust metaheuristics for group scheduling with sequence-dependent setup times in hybrid flexible flow shops. The International Journal of Advanced Manufacturing Technology,2009,43(7/8):767-778 被引 3    
10.  Shahvari O. An efficient tabu search algorithm for flexible flow shop sequence-dependent group scheduling problems. International Journal of Production Research,2012,50(15):4237-4254 被引 4    
11.  Pedro L. Estimation of distribution algorithms: A new tool for evolutionary computation,2002 被引 1    
12.  王圣尧. 分布估计算法研究进展. 控制与决策,2012,27(7):961-966 被引 45    
13.  Harik G R. The compact genetic algorithm. IEEE Transactions on Evolutionary Computation,1999,3(4):287-297 被引 37    
14.  Chen S H. Guidelines for developing effective estimation of distribution algorithms in solving single machine scheduling problems. Expert Systems with Applications,2010,37(9):6441-6451 被引 7    
15.  Lee J Y. Compact genetic algorithms using belief vectors. Applied Soft Computing,2011,11(4):3385-3401 被引 2    
16.  Rimcharoen S. Updating strategy in compact genetic algorithm using moving average approach. IEEE Conference on Cybernetics and Intelligent Systems,2006:1-6 被引 1    
17.  Ahn C W. Elitism-based compact genetic algorithms. IEEE Transactions on Evolutionary Computation,2003,7(4):367-385 被引 11    
18.  Da Silva R R. Template matching in digital images using a compact genetic algorithm with elitism and mutation. Journal of Circuits, Systems, and Computers,2010,19(1):91-106 被引 1    
19.  Gallagher J C. A family of compact genetic algorithms for intrinsic evolvable hardware. IEEE Transactions on Evolutionary Computation,2004,8(2):111-126 被引 3    
引证文献 4

1 徐艳艳 基于自适应遗传算法的超平面分类及遥感应用 系统工程理论与实践,2017,37(3):773-781
被引 2

2 韩忠华 基于改进ICA算法的LBFFSP问题研究 信息与控制,2017,46(4):474-482
被引 4

显示所有4篇文献

论文科学数据集
PlumX Metrics
相关文献

 作者相关
 关键词相关
 参考文献相关

版权所有 ©2008 中国科学院文献情报中心 制作维护:中国科学院文献情报中心
地址:北京中关村北四环西路33号 邮政编码:100190 联系电话:(010)82627496 E-mail:cscd@mail.las.ac.cn 京ICP备05002861号-4 | 京公网安备11010802043238号