修船厂移泊作业优化方法研究

Optimization Research of Berth Shifting Operation of Ship-repairing Dock

船舶泊位调度是修船厂作业的重要组成部分,本文基于动态规划和图论的相关理论,对修船厂码头移泊调度问题进行了研究,阐述了移泊系统的马尔科夫特性,并将船厂码头移泊问题就转化为求解其所对应的赋权网络最优路问题,通过对问题网络结构图的逆向推进,把一个最优路径问题转化为多段决策问题,最终获得该问题的最优路径。最后用算例证明了本文研究的方法对于处理修船码头移泊问题,有着非常好的寻优性。

Ship berth adjustment is an important part of Ship-repairing dock operation. The berth shifting of ship-repairing dock is studied on the basis of dynamic programming and relevant content of graph theory. An introduction is given to markov property of berth shifting system, and the berth shifting problem is transformed into the solving process of the corresponding optimal path of empowerment network. Through the reverse propulsion of network structure, an optimal path problem is eventually converted into the multiple-stage decision problem so as to get the optimal path of the problem at last. The calculation example verifies that the above method can optimize the berth shifting process of ship-repairing dock well.