Inventory Parameter Optimization for Power Plant Management Based on MOEA/DD Algorithm

The optimization of spare parts inventory parameters is a crucial challenge in power plant management. Based on historical usage data of spare parts, this paper first constructs an innovative multi-dimensional classification system to categorize spare parts into four classes based on their importance towards power plant. For the characteristics of different categories of spare parts, differentiated target functions for fill rate and Spare Parts Inventory cost are established, and the advanced MOEA/DD multi-objective optimization algorithm is employed to solve the problem, ultimately obtaining a set of Pareto optimal solutions. To facilitate practical procurement decisions, this paper further introduces a single-objective optimization method to select the reorder point parameters with the best performance from the optimal solution set. Experimental results demonstrate that the proposed MOEA/DD-based optimization algorithm can formulate differentiated inventory strategies for spare parts of varying importance levels. Under the strict premise of meeting the fill rate requirements for all categories of spare parts, it achieves the minimization of operational costs. Moreover, compared to the traditional NSGA-III algorithm, the MOEA/DD algorithm exhibits superior convergence performance when handling high-dimensional, multi-objective optimization problems with complex constraints.

Authors

Institutions

Publication Details

Published
2025-05-23
DOI
https://doi.org/10.1109/icaibd64986.2025.11081971
Primary Topic
Advanced Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Inventory Parameter Optimization for Power Plant Management Based on MOEA/DD Algorithm

Gecheng Chen, Biwei Liu, Shu‐Hui Liu, Hongzhi Xie et al.
1 links
Advanced Algorithms and Applications
article

Inventory Parameter Optimization for Power Plant Management Based on MOEA/DD Algorithm

Gecheng Chen, Biwei Liu, Shu‐Hui Liu, Hongzhi Xie, Chen Bai, Yaxue Li
article en

Abstract

The optimization of spare parts inventory parameters is a crucial challenge in power plant management. Based on historical usage data of spare parts, this paper first constructs an innovative multi-dimensional classification system to categorize spare parts into four classes based on their importance towards power plant. For the characteristics of different categories of spare parts, differentiated target functions for fill rate and Spare Parts Inventory cost are established, and the advanced MOEA/DD multi-objective optimization algorithm is employed to solve the problem, ultimately obtaining a set of Pareto optimal solutions. To facilitate practical procurement decisions, this paper further introduces a single-objective optimization method to select the reorder point parameters with the best performance from the optimal solution set. Experimental results demonstrate that the proposed MOEA/DD-based optimization algorithm can formulate differentiated inventory strategies for spare parts of varying importance levels. Under the strict premise of meeting the fill rate requirements for all categories of spare parts, it achieves the minimization of operational costs. Moreover, compared to the traditional NSGA-III algorithm, the MOEA/DD algorithm exhibits superior convergence performance when handling high-dimensional, multi-objective optimization problems with complex constraints.

China General Nuclear Power Corporation (China) (CN), Shenzhen Technology University (CN)
Openalex Percentile: Top 79%
Advanced Algorithms and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.