[1]姜强强,张其亮.置换流水车间调度问题的水波化学反应算法[J].计算机技术与发展,2019,29(06):1-6.[doi:10. 3969 / j. issn. 1673-629X. 2019. 06. 001]
　JIANG Qiang-qiang,ZHANG Qi-liang.Hybrid Wave Chemical Reaction Optimization for Permutation Flow-shop Scheduling Problem[J].,2019,29(06):1-6.[doi:10. 3969 / j. issn. 1673-629X. 2019. 06. 001]
点击复制

置换流水车间调度问题的水波化学反应算法()
分享到：

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
29
期数:
2019年06期
页码:
1-6
栏目:
智能、算法、系统工程
出版日期:
2019-06-10

文章信息/Info

Title:
Hybrid Wave Chemical Reaction Optimization for Permutation Flow-shop Scheduling Problem
文章编号:
1673-629X(2019)06-0001-06
作者:
姜强强1; 2 ; 张其亮2
1. 浙江大学 软件学院,浙江 宁波 315048; 2. 江苏科技大学 电气与信息工程学院,江苏 张家港 215600
Author(s):
JIANG Qiang-qiang1; 2 ; ZHANG Qi-liang2
1. School of Software,Zhejiang University,Ningbo 315048,China;2. School of Electrical &Information Engineering,Jiangsu University of Science &Technology, Zhangjiagang 215600,China
关键词:
置换流水车间调度问题; 化学反应优化; 水波优化; 混合算法
Keywords:
permutation flow-shop scheduling problem; water wave optimization; chemical reaction optimization; hybrid algorithm
分类号:
TP301.6
DOI:
10. 3969 / j. issn. 1673-629X. 2019. 06. 001
摘要:
流水车间调度问题广泛存在于工程应用中,优化调度不仅可以提高企业的生产效率、降低生成成本,还能提高资源的利用率。 基于以最小化最大完工时间为目标的置换流水车间调度问题,提出一种新的混合水波化学反应优化算法。将原始的水波优化算法与化学反应优化算法进行了混合,在新的算法中去除了化学反应优化算法的合成与分解反应,保留撞墙和互撞反应,使用中央缓冲能量为分子及时补充动能并对分子进行突变操作,以保持全局搜索能力;对水波优化算法进行了离散化处理,利用迭代贪婪重构传播算子、路径重连重构折射算子、局部搜索重构碎浪算子,同时引入淘汰劣解策略,离散的水波优化算法改善了局部搜索能力和收敛速度。 通过标准实例测试,验证了所提算法的有效性。
Abstract:
The flow shop scheduling problem is widely used in engineering application. Optimal scheduling can not only improve the production efficiency and reduce the cost,but also improve the utilization rate of the resources. Based on the permutation flow-shop scheduling problem (PFSP) with the goal of minimizing the makespan,we propose a new algorithm mixing water wave optimization(WWO) and chemical reaction optimization (CRO). In the new algorithm,the synthesis and decomposition reaction in CRO areremoved while on-wall ineffective collision and intermolecular ineffective collision are preserved. Meanwhile,it will replenish kineticenergy for molecules in time with the help of central buffer energy and actuate molecular mutation operations to maintain global searchingcapability. By reconstructing propagation operator based on iterative greedy, reconstructing the refraction operator based on path relinking,reconstructing breaking operator based on the local search,and introducing the strategy of ruling out inferior solution,the proposed discrete WWO is to improve the local search and convergence speed. Then,the effectiveness of the proposed algorithm isvalidated through sufficient experiments.
更新日期/Last Update: 2019-06-10