The job shop scheduling problem is a classical combinatorial optimization challenge frequently encountered in manufacturing systems.It involves determining the optimal execution sequences for a set of jobs on various ...The job shop scheduling problem is a classical combinatorial optimization challenge frequently encountered in manufacturing systems.It involves determining the optimal execution sequences for a set of jobs on various machines to maximize production efficiency and meet multiple objectives.The Non-dominated Sorting Genetic Algorithm Ⅲ(NSGA-Ⅲ)is an effective approach for solving the multi-objective job shop scheduling problem.Nevertheless,it has some limitations in solving scheduling problems,including inadequate global search capability,susceptibility to premature convergence,and challenges in balancing convergence and diversity.To enhance its performance,this paper introduces a strengthened dominance relation NSGA-Ⅲ algorithm based on differential evolution(NSGA-Ⅲ-SD).By incorporating constrained differential evolution and simulated binary crossover genetic operators,this algorithm effectively improves NSGA-Ⅲ’s global search capability while mitigating pre-mature convergence issues.Furthermore,it introduces a reinforced dominance relation to address the trade-off between convergence and diversity in NSGA-Ⅲ.Additionally,effective encoding and decoding methods for discrete job shop scheduling are proposed,which can improve the overall performance of the algorithm without complex computation.To validate the algorithm’s effectiveness,NSGA-Ⅲ-SD is extensively compared with other advanced multi-objective optimization algorithms using 20 job shop scheduling test instances.The experimental results demonstrate that NSGA-Ⅲ-SD achieves better solution quality and diversity,proving its effectiveness in solving the multi-objective job shop scheduling problem.展开更多
Adaptive Cross-Generation Differential Evolution(ACGDE)is a recently-introduced algorithm for solving multiobjective problems with remarkable performance compared to other evolutionary algorithms(EAs).However,its conv...Adaptive Cross-Generation Differential Evolution(ACGDE)is a recently-introduced algorithm for solving multiobjective problems with remarkable performance compared to other evolutionary algorithms(EAs).However,its convergence and diversity are not satisfactory compared with the latest algorithms.In order to adapt to the current environment,ACGDE requires improvements in many aspects,such as its initialization and mutant operator.In this paper,an enhanced version is proposed,namely SIACGDE.It incorporates a strengthened initialization strategy and optimized parameters in contrast to its predecessor.These improvements make the direction of crossgeneration mutation more clearly and the ability of searching more efficiently.The experiments show that the new algorithm has better diversity and improves convergence to a certain extent.At the same time,SIACGDE outperforms other state-of-the-art algorithms on four metrics of 24 test problems.展开更多
基金in part supported by the Key Research and Development Project of Hubei Province(Nos.2020BAB1141,2023BAB094)the Key Project of Science and Technology Research ProgramofHubei Educational Committee(No.D20211402)+1 种基金the Teaching Research Project of Hubei University of Technology(No.XIAO2018001)the Project of Xiangyang Industrial Research Institute of Hubei University of Technology(No.XYYJ2022C04).
文摘The job shop scheduling problem is a classical combinatorial optimization challenge frequently encountered in manufacturing systems.It involves determining the optimal execution sequences for a set of jobs on various machines to maximize production efficiency and meet multiple objectives.The Non-dominated Sorting Genetic Algorithm Ⅲ(NSGA-Ⅲ)is an effective approach for solving the multi-objective job shop scheduling problem.Nevertheless,it has some limitations in solving scheduling problems,including inadequate global search capability,susceptibility to premature convergence,and challenges in balancing convergence and diversity.To enhance its performance,this paper introduces a strengthened dominance relation NSGA-Ⅲ algorithm based on differential evolution(NSGA-Ⅲ-SD).By incorporating constrained differential evolution and simulated binary crossover genetic operators,this algorithm effectively improves NSGA-Ⅲ’s global search capability while mitigating pre-mature convergence issues.Furthermore,it introduces a reinforced dominance relation to address the trade-off between convergence and diversity in NSGA-Ⅲ.Additionally,effective encoding and decoding methods for discrete job shop scheduling are proposed,which can improve the overall performance of the algorithm without complex computation.To validate the algorithm’s effectiveness,NSGA-Ⅲ-SD is extensively compared with other advanced multi-objective optimization algorithms using 20 job shop scheduling test instances.The experimental results demonstrate that NSGA-Ⅲ-SD achieves better solution quality and diversity,proving its effectiveness in solving the multi-objective job shop scheduling problem.
文摘Adaptive Cross-Generation Differential Evolution(ACGDE)is a recently-introduced algorithm for solving multiobjective problems with remarkable performance compared to other evolutionary algorithms(EAs).However,its convergence and diversity are not satisfactory compared with the latest algorithms.In order to adapt to the current environment,ACGDE requires improvements in many aspects,such as its initialization and mutant operator.In this paper,an enhanced version is proposed,namely SIACGDE.It incorporates a strengthened initialization strategy and optimized parameters in contrast to its predecessor.These improvements make the direction of crossgeneration mutation more clearly and the ability of searching more efficiently.The experiments show that the new algorithm has better diversity and improves convergence to a certain extent.At the same time,SIACGDE outperforms other state-of-the-art algorithms on four metrics of 24 test problems.
