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%.

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.

More extensive enterprise cooperation is an effective means to increase the competitiveness of shipbuilding companies in the current distributed manufacturing environment. Most cross-enterprise collaborative processes for shipbuilding projects have been widely concerned. However, the symmetry and cooperativity among the order decision-making process is rarely involved. A key issue for decision makers is to balance the interests of each symmetric participant and realize the consistent decision-making for the order. Existing order decision-making methods in the shipbuilding industry are low efficiency. The aim of this paper is to provide an assistant decision-making method to support effective order decision-making and multi-party cooperation for the multi-wining negotiation objectives. To solve this problem, a collaborative order decision-making framework based on decision support system (DSS) and multi-agent system (MAS) theory is presented, simulating the collaborative order decision-making process, and bridging the order decision-making with production scheduling. Then, a multi-stage negotiation method is provided to solve the distributed and symmetric order decision-making problem, and an illustrative example is conducted to demonstrate the effectiveness and rationality of the methods. Finally, an application case using a prototype system will be reported as a result.

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.