A Strengthened Dominance Relation NSGA-III Algorithm Based on Differential Evolution to Solve Job Shop Scheduling Problem

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-d...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computers, materials & continua Ročník 78; číslo 1; s. 375 - 392
Hlavní autori: Zeng, Liang, Shi, Junyang, Li, Yanyan, Wang, Shanshan, Li, Weigang
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Henderson Tech Science Press 2024
Predmet:
Algorithms
Combinatorial analysis
Convergence
Decoding
Effectiveness
Evolutionary computation
Genetic algorithms
Job shop scheduling
Job shops
Multiple objective analysis
Optimization
Performance enhancement
Scheduling
Sorting algorithms
ISSN:1546-2226, 1546-2218, 1546-2226
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 III (NSGA-III) 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-III algorithm based on differential evolution (NSGA-III-SD). By incorporating constrained differential evolution and simulated binary crossover genetic operators, this algorithm effectively improves NSGA-III’s global search capability while mitigating premature convergence issues. Furthermore, it introduces a reinforced dominance relation to address the trade-off between convergence and diversity in NSGA-III. 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-III-SD is extensively compared with other advanced multi-objective optimization algorithms using 20 job shop scheduling test instances. The experimental results demonstrate that NSGA-III-SD achieves better solution quality and diversity, proving its effectiveness in solving the multi-objective job shop scheduling problem.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1546-2226
1546-2218
1546-2226
DOI:10.32604/cmc.2023.045803