Journal Article10.3390/coatings14030368
A Decomposition-Based Multi-Objective Evolutionary Algorithm for Solving Low-Carbon Scheduling of Ship Segment Painting
1
TL;DR: A decomposition-based multi-objective evolutionary algorithm for solving low-carbon scheduling of ship segment painting effectively reduces carbon emissions and improves painting efficiency.
read more
Abstract: Ship painting, as one of the three pillars of the shipping industry, runs through the whole process of ship construction. However, there are low scheduling efficiency and excessive carbon emissions in the segmental painting process, and optimizing the scheduling method is an important means to achieve the sustainable development of the ship manufacturing industry. To this end, firstly, a low-carbon scheduling mathematical model for the segmented painting workshop is proposed, aiming to reduce carbon emissions and improve the painting efficiency of the segmented painting workshop. Second, an artificial bee colony algorithm designed based on a decomposition strategy (MD/ABC) is proposed to solve the model. In the first stage, five neighborhood switching methods are designed to achieve the global search employed for each solution. In the second stage, the Technique of Ordering the Ideal Solutions (TOPSIS) improves the competition mechanism through the co-evolution between neighboring subproblems and designs the angle to define the relationship between neighboring subproblems to enhance the localized search and improve population quality. The solution exchange strategy is used in the third stage to improve the efficiency of the algorithm. In addition, a two-stage coding method is designed according to the characteristics of the scheduling problem. Finally, the algorithm before and after the improvement and with other algorithms is analyzed using comparative numerical experiments. The experimental results show the effectiveness of the algorithm in solving the low-carbon scheduling problem of ship segmental painting and can provide reliable guidance for the scheduling program of segmented painting workshops in shipyards.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Correction: Bu et al. A Decomposition-Based Multi-Objective Evolutionary Algorithm for Solving Low-Carbon Scheduling of Ship Segment Painting. Coatings 2024, 14, 368
Abstract: In the original publication [...]
References
A fast and elitist multiobjective genetic algorithm: NSGA-II
TL;DR: This paper suggests a non-dominated sorting-based MOEA, called NSGA-II (Non-dominated Sorting Genetic Algorithm II), which alleviates all of the above three difficulties, and modify the definition of dominance in order to solve constrained multi-objective problems efficiently.
An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive Approach
Himanshu Jain,Kalyanmoy Deb +1 more
TL;DR: This paper extends NSGA-III to solve generic constrained many-objective optimization problems and suggests three types of constrained test problems that are scalable to any number of objectives and provide different types of challenges to a many- objective optimizer.
An Evolutionary Many-Objective Optimization Algorithm Based on Dominance and Decomposition
TL;DR: A unified paradigm, which combines dominance- and decomposition-based approaches, for many-objective optimization, is suggested, which shows highly competitive performance on all the constrained optimization problems.
1.1K
Performance indicators in multiobjective optimization
Charles Audet,Jean Bigeon,Dominique Cartier,Sébastien Le Digabel,Ludovic Salomon,Ludovic Salomon +5 more
TL;DR: A review of a total of 63 performance indicators partitioned into four groups according to their properties: cardinality, convergence, distribution and spread is proposed.
371
Efficient multi-objective optimization algorithm for hybrid flow shop scheduling problems with setup energy consumptions
TL;DR: An energy-aware multi-objective optimization algorithm for solving the hybrid flow shop (HFS) scheduling problem with consideration of the setup energy consumptions with the highly effective proposed EA-MOA algorithm compared with several efficient algorithms from the literature.
284