Accurate time prediction is critical to the success of ship block manufacturing. However, the emergence of new ship types with limited historical data poses challenges to existing prediction methods. In response, this paper proposes a novel framework for ship block manufacturing time prediction, integrating clustering and the transfer learning algorithm. Firstly, the concept of distributed centroids was innovatively adopted to achieve the clustering of categorical attribute features. Secondly, abundant historical data from other types of blocks (source domain) were incorporated into the neural network model to explore the effects of block features on manufacturing time, and the model was further transferred to blocks with limited data (target domain). Leveraging the similarities and differences between source and target domain blocks, actions involving freezing and fine-tuning parameters were adopted for the predictive model development. Despite a small sample size of only 80, our proposed block time prediction method achieves an impressive mean absolute percentage error (MAPE) of 8.62%. In contrast, the MAPE for the predictive model without a transfer learning algorithm is notably higher at 14.97%. Experimental validation demonstrates the superior performance of our approach compared to alternative methods in scenarios with small sample datasets. This research addresses a critical gap in ship block manufacturing time prediction.

In recent years, twin stacker crane units have been increasingly integrated into large automated storage and retrieval systems (AS/RSs) in shipyards to enhance operational efficiency. These common rail units often encounter conflicts, and the additional time costs incurred during collision avoidance significantly diminish AS/RS efficiency. Therefore, addressing the twin stacker cranes’ scheduling problem (TSSP) with a collision-free constraint is essential. This paper presents a novel approach to identifying and avoiding collisions by approximating the stacker crane’s trip trajectory as a triangular envelope. Utilizing the collision identification equation derived from this method, we express the collision-free constraint within the TSSP and formulate a mixed-integer programming model. Recognizing the multimodal characteristics of the TSSP objective function, we introduce the dung beetle optimizer (DBO), which excels in multimodal test functions, as the foundational framework for a heuristic optimizer aimed at large-scale TSSPs that are challenging for exact algorithms. To adapt the optimizer for bi-level programming problems like TSSPs, we propose a double-layer code mechanism and innovatively design a binary DBO for the binary layer. Additionally, we incorporate several components, including a hybrid initialization strategy, a Cauchy–Gaussian mixture distribution neighborhood search strategy, and a velocity revision strategy based on continuous space discretization, into the improved dung beetle optimizer (IDBO) to further enhance its performance. To validate the efficacy of the IDBO, we established a numerical experimental environment and generated a series of instances based on actual environmental parameters and operational conditions from an advanced AS/RS in southeastern China. Extensive comparative experiments on various scales and distributions demonstrate that the components of the IDBO significantly improve algorithm performance, yielding stable advantages over classical algorithms in solving TSSPs, with improvements exceeding 10%.

In the context of increasingly competitive shipbuilding, the flexible multi-level picking system, composed of high-rise shelves, Automated Guided Vehicles (AGVs), and picking stations, has been of gradual interest because of its advantages in operation efficiency, system flexibility, and system robustness. Compared with other simple-level systems, the flexible multi-level picking system has a more complex coupling temporal relationship, which makes the scheduling optimization of shipbuilding automated collaborative order picking (SACOP) extremely difficult. In order to avoid the dilemma of finding a feasible and optimal collaborative scheduling scheme under the constraints of a complex temporal relationship, this paper proposed a multi-AGV-driven pallet-picking scheduling optimization (MADPSO) method, which takes the AGV scheduling scheme as the direct solution and modifies it to a feasible solution under the reasonably designed interaction strategy of stacker, AGV, and the interaction strategy of picking station, AGV. Furthermore, taking the minimum energy consumption and operation time as the optimization objectives, a multi-objective optimization mathematical model was established to describe MADPSO, and an improved NSGA-III algorithm was designed to solve the problem. Finally, several experiments were conducted in various scenarios and verified that using MADPSO can achieve a comprehensive optimization index improvement of 52.02–75.66% compared with traditional picking methods, which has a certain reference significance for shipyards.

Prefabricated cabin modular units (PMCUs) are a widespread type of intermediate products used during ship or offshore platform construction. This paper focuses on the scheduling problem of PMCU assembly flow shops, which is summarized as a multi-objective, fuzzy-blocking hybrid flow-shop-scheduling problem based on learning and fatigue effects (FB-HFSP-LF) to minimize the maximum fuzzy makespan and maximize the average fuzzy due-date agreement index. This paper proposes a multi-objective non-dominated sorting gravitational search algorithm (MONSGSA) to solve it. In the proposed MONSGSA, the ranked-order value is used to convert continuous solutions to discrete solutions. Multi-dimensional Latin hypercube sampling is used to enhance initial population diversity. Setting up an external archive to maintain non-dominated solutions while introducing an adaptive inertia factor and a trap avoidance operator to guide individual positional updates. The results of multiple sets of experiments show that Pareto solutions of MONSGSA have better distribution and convergence compared to other competitors. Finally, the instance of PMCU manufacturer is used for validation, and the results show that MONSGSA has better applicability to practical problems.

Neural network models, such as BP, LSTM, etc., support only numerical inputs, so data preprocessing needs to be carried out on the categorical variables to convert them into numerical data. For unordered multi-categorical variables, existing encoding methods may produce dimensional catastrophes and may also introduce additional order misrepresentation and distance bias in neural network computation. To solve the above problems, this paper proposes an unordered multi-categorical variable encoding method O-AE using orthogonal matrix for encoding and encoding representation learning and dimensionality reduction via an autoencoder. Bayesian optimization is used for hyperparameter optimization of the autoencoder. Finally, seven experiments were designed with the basic O-AE, Bayesian optimization of the hyperparameters of the autoencoder for O-AE, and other encoding methods to encode unordered multi-categorical variables in five datasets, and they were input into a BP neural network to carry out target prediction experiments. The results show that the experiments using O-AE and O-AE-b have better prediction results, proving that the method proposed in this paper is highly feasible and applicable and can be an optional method for the data processing of unordered multi-categorical variables.

In the construction of large cruise ships, the restricted deck space and dense obstacles create a strongly coupled problem between path planning and sequence optimization during prefabricated cabin boarding operations, significantly impairing overall installation efficiency. To coordinately optimize the boarding sequence of multiple cabins and minimize operational conflicts, this study proposes a dual-layer coordinated planning methodology. The lower layer generates feasible paths satisfying kinematic and contour-based obstacle avoidance constraints through optimal control theory, while the upper layer introduces a dynamic priority evaluation mechanism based on grid mapping and an “enclosure factor”, combined with a reverse planning strategy to dynamically adjust the cabin boarding sequence. Through iterative feedback between path feasibility and sequence efficiency, the proposed method effectively resolves the strong coupling between sequencing and path planning. Case validation demonstrates that the proposed approach significantly reduces total installation time compared to conventional sequence planning methods, proving its effectiveness and practical value in enhancing the efficiency of coordinated multi-cabin installation.