考虑干涉和优先度的多目标岸桥调度策略  

Multi-objective Quay Crane Scheduling with Interference and Priority in Consideration

作　　者：丁玲[1] 梁承姬[1] 

机构地区：[1]上海海事大学物流研究中心,上海201306

出　　处：《武汉理工大学学报（信息与管理工程版）》2014年第3期360-364,共5页Journal of Wuhan University of Technology：Information & Management Engineering

基　　金：国家自然科学基金资助项目(71071093);上海市自然科学基金资助项目(10ZR1413300);上海市教委创新基金资助项目(11YZ136);上海市科委创新基金资助项目(09DZ2250400;9530708200;10190502500);上海市重点学科资助项目(J50604)

摘　　要：针对岸桥调度问题的特性,分析了岸桥支援对提高港口整体效率的影响,建立了包含任务之间优先关系和岸桥之间不可交叉性和安全等条件的多目标混合整数规划模型,提出了一种启发式求解算法,验证了在一定时间内,启发式算法可以得到较优的可行解。而QCSP单目标和多目标计算结果表明,减少岸桥等待和移动时间,有助于岸桥更好地支援邻近船舶,加快港口整体运作效率,提高港口竞争力。The influence of quay crane support on the overall efficiency of the port was analyzed .A multi-objective quay crane scheduling problem with interference and priority was mainly researched .The completion time of tasks was minimized as well as the quay crane ’ s moving time and waiting time was reduced .According to characteristics of quay crane scheduling , a multi-objective mixed integer programming model was established .And a heuristic algorithm was proposed to solve quay crane scheduling problem .It was verified that within a certain time , heuristic algorithms can obtain a better feasible solution .The comparison of calculation results of QCSP single objective and multi-objective illustrates that reducing quay crane waiting time and travel time can help to support other ships and increase the whole efficiency of the port .The competitive strength of the port could therefore be increased .

关 键 词：岸桥调度 等待时间 移动时间 混合整数规划 启发式算法 

分 类 号：U169.63[交通运输工程] N945.12[自然科学总论—系统科学]