考虑船舶服务优先权的泊位-岸桥分配  

Berth-Quay Crane Allocation Based on the Ships' Service Priority

作　　者：张迪[1] 严南南[1] 

机构地区：[1]上海海事大学信息工程学院,上海201306

出　　处：《现代计算机（中旬刊）》2015年第5期45-49,59,共6页Modern Computer

摘　　要：为了解决泊位与岸桥的分配问题,将船舶服务优先权作为影响因子,建立以最小化船舶等待时间,作业时间以及延迟时间为目标的优化模型,以此进一步提高集装箱码头的服务质量与客户满意度。为求解此模型,设计一种遗传算法,此算法将泊位-岸桥集成分配问题分解转化为对泊位的岸桥分配主问题和船舶调度的子问题。并且通过试验算例表明,该遗传算法是有效的,并且能够相对减少船舶总的在港时间,从而提高码头作业效率。To solve the berth-quay crane allocation problem, formulates the mode with ships＇ service priority which aims to improve the service quality of container terminal and customers＇ satisfaction. And adopts the genetic algorithm with the heuristic algorithm for quay crane allo- cation for solving the problem, including the quay crane allocation and the corresponding vessel schedule in each berth. The results show that the algorithm is feasible and the turnaround time of vessels at port is less. In this connection, the efficiency of terminal operation is improved.

关 键 词：泊位-岸桥分配 遗传算法 服务优先权 船舶调度 

分 类 号：O224[理学—运筹学与控制论]