跳到主要导航 跳到搜索 跳到主要内容

Energy-Efficient Shop Scheduling Using Space-Cooperation Multi-Objective Optimization

  • Jiepin Ding
  • , Jun Xia
  • , Yaning Yang
  • , Junlong Zhou
  • , Mingsong Chen*
  • , Keqin Li
  • *此作品的通讯作者
  • East China Normal University
  • Ningxia Normal University
  • Nanjing University of Science and Technology
  • SUNY New Paltz

科研成果: 期刊稿件文章同行评审

摘要

Since Industry 5.0 emphasizes that manufacturing enterprises should raise awareness of social contribution to achieve sustainable development, more and more meta-heuristic algorithms are investigated to save energy in manufacturing systems. Although non-dominated sorting-based meta-heuristics have been recognized as promising multi-objective optimization methods for solving the energy-efficient flexible job shop scheduling problem (EFJSP), it is hard to guarantee the quality of the Pareto front (e.g., total energy consumption, makespan) due to the lack of population diversity. This is mainly because an improper individual comparison inevitably reduces population diversity, thus limiting exploration and exploitation abilities during population updates. To achieve efficient population evolution, this paper introduces a novel space-cooperation multi-objective optimization (SCMO) method that can effectively solve EFJSP to obtain scheduling schemes with better trade-offs. By cooperatively evaluating the similarity among individuals in both the decision space and objective space, we propose a space-cooperation population update method based on a three-vector representation that can accurately eliminate repetitive individuals to derive higher-quality Pareto solutions. To further improve search efficiency, we propose a difference-driven local search, which selectively changes the positions of operations with higher differences to search for neighbors effectively. Based on the Taguchi method, we conduct experiments to obtain a suitable parameter combination of SCMO. Comprehensive experimental results show that, compared to state-of-the-art methods, our SCMO method achieves the highest HV and NR and the lowest IGD, with an average of 0.990, 0.952, and 0.001, respectively. Meanwhile, compared to traditional local search approaches, our difference-driven local search obtains twice the HV on instance Mk12 and reduces the solving time from 1521 s to 475 s.

源语言英语
页(从-至)601-615
页数15
期刊IEEE Transactions on Sustainable Computing
10
3
DOI
出版状态已出版 - 2025

联合国可持续发展目标

此成果有助于实现下列可持续发展目标:

  1. 可持续发展目标 7 - 经济适用的清洁能源
    可持续发展目标 7 经济适用的清洁能源

指纹

探究 'Energy-Efficient Shop Scheduling Using Space-Cooperation Multi-Objective Optimization' 的科研主题。它们共同构成独一无二的指纹。

引用此