Abstract: To change the status of depending on experience and lacking effective scheduling approach for block storage yard scheduling of shipbuilding, a shortest-path model which included yard information as well as block access sequence was constructed and optimized. By taking the scheduling of blocks as research object, the minimum movement amount of temporary blocks and traveled distance of platform cars as optimization objectives, the optimal parking position and access path of block storage yard were determined. The application of a shipyard’s actual data to proposed model on yard scheduling problem showed that the model could obtain the better yard operation plan and improve the utilization of yard resources.

Key words: shortest-path algorithm, block storage yard, scheduling, shipbuilding

摘要： 为了改变船厂分段移动计划调度主要依赖经验和缺乏有效调度方法的现状，构建了考虑堆场信息、分段进出场次序等因素的最短路模型并对其进行优化。模型以分段在堆场中的调度为研究对象，以最小化临时分段移动量和平板车在堆场中的行驶距离为优化目标，确定分段在堆场中的最优停放位置和进出场路径。利用某船厂的实际数据对模型在堆场调度问题中的应用进行了实例验证，结果表明，该模型可得出较优的堆场作业计划，并提高堆场资源的利用率。

关键词: 最短路算法, 分段堆场, 调度, 造船