An Assembly Sequence Planning Method Based on Multiple Optimal Solutions Genetic Algorithm
Xin Wan,
Kun Liu (),
Weijian Qiu and
Zhenhang Kang
Additional contact information
Xin Wan: School of Naval Architecture and Ocean Engineering, Jiangsu University of Science and Technology, Zhenjiang 212003, China
Kun Liu: School of Naval Architecture and Ocean Engineering, Jiangsu University of Science and Technology, Zhenjiang 212003, China
Weijian Qiu: School of Naval Architecture and Ocean Engineering, Jiangsu University of Science and Technology, Zhenjiang 212003, China
Zhenhang Kang: School of Naval Architecture and Ocean Engineering, Jiangsu University of Science and Technology, Zhenjiang 212003, China
Mathematics, 2024, vol. 12, issue 4, 1-26
Abstract:
Assembly sequence planning (ASP) is an indispensable and important step in the intelligent assembly process, and aims to solve the optimal assembly sequence with the shortest assembly time as its optimization goal. This paper focuses on modular cabin construction for large cruise ships, tackling the complexities and challenges of part assembly during the process, based on real engineering problems. It introduces the multiple optimal solutions genetic algorithm (MOSGA). The MOSGA analyzes product constraints and establishes a mathematical model. Firstly, the traditional genetic algorithm (GA) is improved in the case of falling into the local optimum when facing complex problems, so that it can jump out of the local optimum under the condition of satisfying the processing constraints and achieve the global search effect. Secondly, the problem whereby the traditional search algorithm converges to the unique optimal solution is solved, and multiple unique optimal solutions that are more suitable for the actual assembly problem are solved. Thirdly, for a variety of restrictions and emergencies that may occur during the assembly process, the assembly sequence flexible planning (ASFP) method is introduced so that each assembly can be flexibly adjusted. Finally, an example is used to verify the feasibility and effectiveness of the method. This method improves the assembly efficiency and the diversity of assembly sequence selection, and can flexibly adjust the assembly sequence, which has important guiding significance for the ASP problem.
Keywords: assembly sequence planning; multiple unique optimal solutions; multi-objective optimization; flexible planning (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
https://www.mdpi.com/2227-7390/12/4/574/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/4/574/ (text/html)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:4:p:574-:d:1338666
Access Statistics for this article
Mathematics is currently edited by Ms. Emma He
More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().