Decomposition based multiobjective evolutionary algorithm with adaptive resource allocation for energy-aware welding shop scheduling problem

被引:13
|
作者
Wang, Ling [1 ]
Wang, Jing-jing [1 ]
Jiang, Enda [1 ]
机构
[1] Tsinghua Univ, Dept Automat, Beijing 100084, Peoples R China
基金
中国国家自然科学基金;
关键词
Welding shop scheduling; Decomposition; Energy-aware; Multiobjective optimization; SETUP; TRANSPORTATION; MOEA/D; MACHINE;
D O I
10.1016/j.cie.2021.107778
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Welding is an important industrial process that consumes a huge amount of energy. This paper addresses the energy-aware welding shop scheduling problem (EAWSSP) to minimize both makespan and energy consumption. A mathematical model is presented and a multiobjective evolutionary algorithm based on decomposition with adaptive resource allocation (MOEA/D-ARA) is proposed. Two initialization heuristics are designed to generate an initial population with certain quality and diversity. To effectively improve solutions located in different objective spaces, several objective-oriented search operators are designed. A cooperative search and a problemspecific local intensification are represented to balance the exploration and exploitation. An adaptive resource allocation strategy is developed to improve the computational efficiency of the algorithm. Computational experiments demonstrate the effectiveness of the adaptive resource allocation strategy, and statistical comparisons to the existing algorithms demonstrate the superiority of MOEA/D-ARA to solve EAWSSP. In addition, the application of MOEA/D-ARA to a real-world case also verifies the effectiveness of the proposed algorithm to minimize makespan and energy consumption of the EAWSSP.
引用
收藏
页数:11
相关论文
共 50 条
  • [1] A cooperative memetic algorithm for energy-aware distributed welding shop scheduling problem
    Wang, Jing-jing
    Wang, Ling
    Xiu, Xia
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 120
  • [2] Efficient Approaches for Solving a Multiobjective Energy-aware Job Shop Scheduling Problem
    Gonzalez, Miguel A.
    Oddi, Angelo
    Rasconi, Riccardo
    [J]. FUNDAMENTA INFORMATICAE, 2019, 167 (1-2) : 93 - 132
  • [3] A species based multiobjective evolutionary algorithm for multiobjective flow shop scheduling problem
    Wang, Hongfeng
    Fu, Yaping
    Huang, Min
    [J]. 2015 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2015, : 3243 - 3247
  • [4] A multi-objective evolutionary algorithm based on adaptive clustering for energy-aware batch scheduling problem
    Qian, Si-yuan
    Jia, Zhao-hong
    Li, Kai
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2020, 113 : 441 - 453
  • [5] A decomposition-based hybrid multiobjective evolutionary algorithm with dynamic resource allocation
    Mashwani, Wali Khan
    Salhi, Abdellah
    [J]. APPLIED SOFT COMPUTING, 2012, 12 (09) : 2765 - 2780
  • [6] Multi-Objective Evolutionary Algorithm Based on Decomposition for Energy-aware Scheduling in Heterogeneous Computing Systems
    Yuan, Sisi
    Deng, Gaoshan
    Feng, Quanxi
    Zheng, Pan
    Song, Tao
    [J]. JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2017, 23 (07) : 636 - 651
  • [7] Energy-aware grid resource scheduling: model and algorithm
    Li, Chunlin
    Li, FangYun
    Li, Layuan
    [J]. INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY, 2010, 37 (01) : 39 - 47
  • [8] Energy-Aware Scheduling and Resource Allocation for Periodic Traffic Demands
    Chen, Ying
    Jaekel, Arunita
    [J]. JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, 2013, 5 (04) : 261 - 270
  • [9] An adaptive multiobjective evolutionary algorithm for dynamic multiobjective flexible scheduling problem
    Yu, Weiwei
    Zhang, Li
    Ge, Ning
    [J]. INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 2022, 37 (12) : 12335 - 12366
  • [10] Multiobjective Local Search Algorithm-Based Decomposition for Multiobjective Permutation Flow Shop Scheduling Problem
    Li, Xiangtao
    Li, Mingjie
    [J]. IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT, 2015, 62 (04) : 544 - 557