计算机科学
数学优化
本德分解
码头
调度(生产过程)
约束规划
分解
元启发式
钥匙(锁)
作业车间调度
约束(计算机辅助设计)
任务(项目管理)
运筹学
工作(物理)
整数规划
局部搜索(优化)
搜索算法
程序设计范式
利用
混合算法(约束满足)
稳健优化
线路规划
时间限制
作者
Zheng Gao,Chao Dai,Liping Zhang,Zikai Zhang,Zixiang Li,Yu Zhang
标识
DOI:10.1080/00207543.2026.2702059
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI