时间窗限制下泊位分配问题的约束规划模型_韩晓龙.pdfVIP

33 7 2014 7 Vol.33 No.7 Journal of Liaoning Technical UniversityNatural Science Jul. 2014 1008-0562(2014)07-0983-05 doi:10.3969/j.issn.1008-0562.2014.07.025 时间窗限制下泊位分配问题的约束规划模型 （上海海事大学物流研究中心，上海 201306 ） 针对集装箱港口中船舶服务及作业时间在时间窗约束下的泊位分配问题，考虑船舶载重不同而产生的优 先级，并把这种优先级反映到在港时间上，分别以最小化卸船完工时间为目标建立了约束规划模型和混合整数规 划模型.研究结果表明：约束规划技术在求解时收敛速度快.通过数据试验证实了约束规划在港口调度如泊位分配 问题中的可行性和有效性. 集装箱港口；泊位分配；时间窗；约束规划；混合整数规划 U 691.3 A Modeling and solving berth allocation problem of time window constraints based on constraint programming HAN Xiaolong, ZHAO ShuJie （Logistics Research Center, Shanghai Maritime University, Shanghai 201306, China ） Abstract: According to the berth allocation problem of time window constraints and ship service sequence, this paper applied the constraint programming technology to establish the model of aiming at minimizing the completion time. This study also compared the result of mixed integer programming to the CP model’s. The result shows that the CP model is faster than MIP model in solving this problem. It fully proves that constraint programming technology has the superiority and effectiveness as the disposal of dispatch problem such as BAP. This conclusion provides an effective guideline to enhance the level of port management. Key words: container ports; berth allocation; time window; constraint programming; mixed integer programming 文献中，Lai和Shih[1]针对港口的泊位利用率问题提 0 出了启发式算法，采用了先到先服务（FCFS ）的分 配策略，忽视了港口客户中所存在的2/8原则.Imai[2] 港口不仅是水运货物的集散地，也是远洋运输 等提出了集装箱港口的动态到达泊位分配问题，以