中文摘要：

针对船舶分段移动计划主要依靠经验以及缺乏有效调度的现状,研究建立以分段移动度最小为目标的优化模型,综合考虑了分段在堆场中的停放位置及进、出场路径.通过遗传算法选择分段在堆场中停放位置的最优方案,并构建启发式规则确定分段在堆场中的最优进、出场路径,从而实现对模型的求解.最后以某船厂实际数据为例,对模型在堆场调度问题中的应用进行了实例验证,结果表明,所研究方法可求解得出较优的堆场作业计划,并实现堆场资源的高效利用.

英文摘要：

This paper presented a mathematical model defined as the assignment and paths of the inbound and outbound objects to the shipping yard with the aim of minimizing the degree of movement of the blocks.A genetic algorithm was formulated to select the optimal parking positions for the inbound blocks.A heuristic rule was embedded in the algorithm to select the optimal moving paths for the blocks.Application data were obtained from a shipyard to validate the model,and the result showed that the proposed algorithm was effective to solve the scheduling problem in shipbuilding yards.