Answers are grounded in this paper and cite their sources.
Demonstrates improved maintenance scheduling in multi-ship docks, indicating enhanced efficiency.
Unreasonable allocation of dock resources can easily cause maintenance task blockage during ship maintenance operations. Moreover, uncertain ship arrival time due to external factors poses significant challenges for maintenance scheduling. Therefore, this work investigates a multi-ship co-dock maintenance scheduling problem with limited dock capacity and uncertain ship arrival time. To solve this problem efficiently, this work first employs chance-constrained programming to address uncertain ship arrival time. It is then integrated with a constraint programming (CP) model to generate a robust multi-ship co-dock maintenance schedule. Meanwhile, a PPO-driven matheuristic algorithm is further developed to improve the solution efficiency for larger instances. The PPO-driven matheuristic integrates proximal policy optimisation (PPO) and the CP decomposition model. PPO adaptively adjusts the search behaviour. Meanwhile, the CP decomposition model performs local refinements to further improve promising solutions. Finally, extensive experiments are conducted to verify the effectiveness of the proposed CP model and the PPO-driven matheuristic. The experimental results demonstrate the superiority of the CP model. Compared with the mixed-integer programming model, it delivers significantly better solving performance. The key components of the PPO-driven matheuristic algorithm contribute positively to algorithmic performance, and the proposed algorithm outperforms state-of-the-art metaheuristic algorithms.
No takes yet. Share an insight, caveat, or question.
Gao et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: