Content area

Abstract

With the development of science and technology, industrial construction has entered the era of 4.0 intelligent construction, and various algorithms have been widely applied in the modularization of production products. This study focuses on the modular optimization problem of complex products and establishes a hybrid genetic algorithm based on the ant colony algorithm framework. The new algorithm incorporates visibility analysis of the genetic algorithm, using the obtained solution as the pheromone source for the new algorithm to quickly obtain the optimal solution. The results showed that the algorithm could quickly achieve modularization of complex industrial products, adapt to products with a large number of parts and complex compositions, and obtain the optimal solution. The new algorithm reduced the running time of modular complex products by 35.06% compared to the particle swarm optimization algorithm. The new algorithm optimized the product design process for core components, reducing production costs by 23.46% and increasing production efficiency by 39.20%. Consequently, the novel algorithm modularizes complex products, thereby enhancing production efficiency and providing a novel intelligent method for the design process of complex products.

Details

1009240
Title
Modular Analysis of Complex Products Based on Hybrid Genetic Ant Colony Optimization in the Context of Industry 4.0
Author
Volume
16
Issue
2
Publication year
2025
Publication date
2025
Publisher
Science and Information (SAI) Organization Limited
Place of publication
West Yorkshire
Country of publication
United Kingdom
ISSN
2158107X
e-ISSN
21565570
Source type
Scholarly Journal
Language of publication
English
Document type
Journal Article
ProQuest document ID
3180200311
Document URL
https://www.proquest.com/scholarly-journals/modular-analysis-complex-products-based-on-hybrid/docview/3180200311/se-2?accountid=208611
Copyright
© 2025. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Last updated
2025-03-26
Database
ProQuest One Academic