Layout Optimization of Shipyard Block Assembly Site Based on SA-HC Hybrid Algorithm

View at publisher Summarise with VIRAT
Authors: Maopu Wu
Cited by: 0
References: 1

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Aiming at the problems of low space utilization, high transportation costs, and frequent process conflicts caused by the reliance on empirical planning in shipyard block assembly site layout, as well as the defects of single intelligent algorithms in layout optimization such as slow convergence or proneness to falling into local optima, a hybrid optimization method combining Simulated Annealing (SA) and Hill Climbing (HC) is proposed. Firstly, site data, block assembly modules, and constraint parameters are collected to establish a multi-objective optimization model with the objectives of maximizing space utilization, minimizing transportation costs, and minimizing process conflicts, incorporating three types of constraints: physical, safety, and process constraints. Secondly, a two-stage solution strategy of "SA global search + HC local refinement" is designed — the SA stage escapes local optima through a probabilistic acceptance mechanism, and the HC stage improves solution accuracy via local neighborhood search. Finally, a domestic shipyard is taken as the experimental object to verify the effectiveness of the method. The results show that compared with the traditional empirical layout, the proposed method increases the site space utilization by 18.3%, reduces transportation costs by 27.6%, and lowers the secondary handling rate to below 5%.

Fields of Study & Subjects

Advanced Manufacturing and Logistics Optimization Scheduling and Optimization Algorithms Maritime Ports and Logistics

Publication details

Journal / source
IEEE International Conference on Power, Electronics and Green Energy (ICPEGE)
Pages
109–113
Publication date
28 January 2026
Language
EN