留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

基于IIGA的分布式装配置换流水车间调度

董海 王志彬

董海, 王志彬. 基于IIGA的分布式装配置换流水车间调度[J]. 制造技术与机床, 2022, (11): 169-176. doi: 10.19287/j.mtmt.1005-2402.2022.11.026
引用本文: 董海, 王志彬. 基于IIGA的分布式装配置换流水车间调度[J]. 制造技术与机床, 2022, (11): 169-176. doi: 10.19287/j.mtmt.1005-2402.2022.11.026
DONG Hai, WANG Zhibin. Distributed assembly permutation flowshop scheduling problem based on IIGA[J]. Manufacturing Technology & Machine Tool, 2022, (11): 169-176. doi: 10.19287/j.mtmt.1005-2402.2022.11.026
Citation: DONG Hai, WANG Zhibin. Distributed assembly permutation flowshop scheduling problem based on IIGA[J]. Manufacturing Technology & Machine Tool, 2022, (11): 169-176. doi: 10.19287/j.mtmt.1005-2402.2022.11.026

基于IIGA的分布式装配置换流水车间调度

doi: 10.19287/j.mtmt.1005-2402.2022.11.026
基金项目: 国家自然科学基金(71672117);中央引导地方科技发展资金计划(2021JH6/10500149)
详细信息
    作者简介:

    董海,男,1971年生,博士,教授,研究方向为网络化制造。E-mail:2395391039@qq.com

    通讯作者:

    王志彬,男,1996年生,硕士研究生,研究方向为生产运作模式。E-mail:2388099821@qq.com

  • 中图分类号: TB497, TP18

Distributed assembly permutation flowshop scheduling problem based on IIGA

  • 摘要: 针对分布式装配置换流水车间调度问题,提出一种改进的迭代贪婪算法进行求解。首先,以最小化总流经时间为优化目标建立数学模型,提出一种改进的迭代贪婪算法,采用结合CDS(campbell dudek smith)和NEH(nawaz-enscore-ham)的启发式方法以生成较高质量的初始解,提高种群的多样性;其次,针对可重构产品与作业设计破坏和重构过程,将移除的序列插入指定位置,采用本地搜索策略获得新的解决方案;最后,通过不同规模的仿真实验对本文所提算法与其他四种智能算法进行对比,实验结果表明改进的迭代贪婪算法在求解分布式装配置换流水车间调度方面具有高效性和稳定性。

     

  • 图  1  分布式装配置换流水车间调度

    图  2  两个阶段的调度甘特图示例

    图  3  初始解对比图

    图  4  破坏重构操作示意图

    图  5  改进IG算法流程图

    图  6  对比算法95%置信区间

    图  7  算法类型与m置信区间交互关系

    图  8  算法类型与f置信区间交互关系

    图  9  算法类型与s置信区间交互关系

    表  1  产品的处理时间和关系

    产品工作加工时间s/t
    机器1机器2装配线
    11579
    23555
    254
    633
    35785
    454
    下载: 导出CSV

    表  2  各算法ARD结果对比

    Numbern×m×f×sCMAHBBOHDIWOgILSIIGA
    ARD运行时间/sARD运行时间/sARD运行时间/sARD运行时间/sARD运行时间/s
    1100×5×4×300.1987.560.1578.320.0973.600.0655.360.0454.66
    2100×5×4×400.5390.320.4885.630.3283.220.2879.500.1875.98
    3100×5×4×500.6098.520.5089.500.3683.550.3274.200.2176.25
    4100×5×6×300.1285.630.0876.550.0570.650.0458.500.0253.85
    5100×5×6×400.3680.220.3175.600.2380.620.1962.540.1059.70
    6100×5×6×500.1787.320.1381.100.1176.110.0866.580.0262.46
    7100×5×8×300.0775.630.0573.550.0369.600.0260.100.0057.20
    8100×5×8×400.1377.660.0972.240.0668.500.0465.320.0455.35
    9100×5×8×500.1571.500.1272.660.0965.200.0559.110.0159.40
    10100×10×4×300.42185.560.36177.690.15179.430.11140.200.09133.86
    11100×10×4×400.75189.660.69187.400.35155.380.30136.270.12122.56
    12100×10×4×500.84185.660.78184.250.50167.500.45139.850.12135.74
    13100×10×6×300.31187.250.31177.600.11159.660.08129.400.06130.20
    14100×10×6×400.35189.500.33176.200.21171.500.16132.500.09130.41
    15100×10×6×500.41186.490.37174.550.33165.480.30133.700.11128.60
    16100×10×8×300.07178.550.07174.690.05168.250.04135.300.02130.22
    17100×10×8×400.16183.660.13179.500.07163.540.05140.870.03135.26
    18100×10×8×500.53190.650.48172.140.42171.520.33156.500.13148.55
    下载: 导出CSV
  • [1] Sara H, Rubén R, Carlos A R. The distributed assembly permutation flowshop scheduling problem[J]. International Journal of Production Research, 2013, 51(17): 5292-5308. doi: 10.1080/00207543.2013.807955
    [2] Lin J, Wang Z J, Li X D. A backtracking search hyper-heuristic for the distributed assembly flow-shop scheduling problem[J]. Swarm and Evolutionary Computation, 2017, 36: 124-135. doi: 10.1016/j.swevo.2017.04.007
    [3] Pan Q K, Gao L, Li X Y, et al. Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flowshop scheduling problem[J]. Applied Soft Computing Journal, 2019, 81: 105492. doi: 10.1016/j.asoc.2019.105492
    [4] 黄佳琳, 张丫丫, 顾幸生. 基于改进生物地理学优化算法的分布式装配置换流水车间调度问题[J]. 华东理工大学学报:自然科学版, 2020, 46(6): 758-769. doi: 10.14135/j.cnki.1006-3080.20190828001
    [5] Fernandez-Viagas V, Perez-Gonzalez P, Framinan J M. The distributed permutation flow shop to minimise the total flowtime[J]. Computers & Industrial Engineering, 2018, 118: 464-477.
    [6] Pan Q K, Gao L, Wang L, et al. Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem[J]. Expert Systems With Applications, 2019, 124: 309-324. doi: 10.1016/j.eswa.2019.01.062
    [7] Sang H Y, Pan Q K, Li J Q, et al. Effective invasive weed optimization algorithms for distributed assembly permutation flowshop problem with total flowtime criterion[J]. Swarm and Evolutionary Computation, 2019, 44: 64-73. doi: 10.1016/j.swevo.2018.12.001
    [8] 张梓琪, 钱斌, 胡蓉, 等. 基于多维EDA算法的低碳分布式装配流水车间调度[J/OL]. 控制与决策: 1-10[2022-03-11]. https://doi.org/ 10.13195/j.kzyjc.2020.1475.
    [9] Jacobs L W, Brusco M J. A local-search heuristic for large set-covering problems[J]. Naval Research Logistics, 1995, 42(7): 1129–1140.
    [10] Lin S W, Ying K C, Huang C Y Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm[J]. International Journal of Production Research, 2013, 51(16): 5029–5038.
    [11] Fernandez-Viagas V, Framinan J M. A bounded-searchiterated greedy algorithm for the distributed permutationflowshop scheduling problem[J]. International Journal ofProduction Research, 2015, 53(4): 1111-1123. doi: 10.1080/00207543.2014.948578
    [12] Huang Y Y, Pan Q K, Huang J P, et al. An improved iterated greedy algorithm for the distributed assembly permutation flowshop scheduling problem[J]. Computers & Industrial Engineering, 2021, 152: 107021.
    [13] 钱斌, 刘荻飞, 胡蓉, 等. 混合迭代贪婪算法求解准时生产分布式流水线调度问题[J/OL]. 控制与决策: 1-10[2021-10-05]. https://doi.org/ 10.13195/j.kzyjc.2021.0426.
    [14] 姚康, 唐秋华, 张子凯, 等. 考虑序列相关调整时间的多目标置换流水车间调度算法[J]. 武汉科技大学学报, 2021, 44(6): 452-458.
    [15] WANG S Y, WANG L. An estimation of distribution algorithm-based memetic algorithm for the distributed assembly permutation flow-shop scheduling problem[J]. IEEE Transactions on Systems, Man, and Cybernetics:Systems, 2016, 46(1): 139-149. doi: 10.1109/TSMC.2015.2416127
    [16] Deng J, Wang L, Wang S, et al. A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem[J]. International Journal of Production Research, 2016, 54(12): 3561-3577. doi: 10.1080/00207543.2015.1084063
    [17] Huang Y Y, Pan Q, Hu X L, et al. An iterated local search algorithm for distributed assembly permutation flowshop problem[C].2020 39th Chinese Control Conference (CCC). IEEE, 2020: 1548-1552.
  • 加载中
图(9) / 表(2)
计量
  • 文章访问数:  130
  • HTML全文浏览量:  20
  • PDF下载量:  21
  • 被引次数: 0
出版历程
  • 收稿日期:  2022-05-06

目录

    /

    返回文章
    返回

    重要提示

    1. 唯一官方网站:1951.mtmt.com.cn

    2. 本刊编辑部、工作人员邮箱后缀为@jcs.gt.cn

    3. 电话

    010-64739683/79(稿件、进度)

    010-64739685(缴费、录用证明)

    4. 作者服务QQ群:238874846

    注意以上信息,谨防冒名、被骗!

    《制造技术与机床》编辑部