不确定性集装箱码头泊位与岸桥分配问题  

Berth and Quay Crane Allocation Problem of the Uncertain Container Port

作　　者：刘慧莲[1] 曹瑾鑫[2] 

机构地区：[1]内蒙古大学数学科学学院,呼和浩特010021 [2]内蒙古大学交通学院,呼和浩特010070

出　　处：《内蒙古大学学报（自然科学版）》2016年第3期312-320,共9页Journal of Inner Mongolia University：Natural Science Edition

基　　金：国家自然科学基金资助(71262008);教育部留学回国人员科研启动基金资助(教外司留[2012]1707号);内蒙古自治区高等学校"青年科技英才计划"项目(NJYT-13-B02)

摘　　要：泊位和岸桥是集装箱码头至关重要的战略资源,如何合理有效地分配泊位和岸桥资源,受到了研究者的重视.文章对不确定环境下的泊位分配和岸桥分配的联合鲁棒调度问题进行了研究,在传统泊位分配和岸桥分配模型的基础上建立了该模型的鲁棒对应式,并将其转化为鲁棒优化模型.针对模型特点设计了分支定界算法,最后通过具体算例,给出了分支定界算法的求解结果,分析了得到的泊位与岸桥调度计划的鲁棒性.实验结果说明,本文所建立的鲁棒性泊位与岸桥调度模型可以通过调节保护水平参数控制解的鲁棒性,具有很强的实际意义.Berths and quay cranes are known as the two most important resources in container terminals.The researchers have been paying more and more attentions to the issues how to reasonably and effectively allocate berth and quay crane resources.A robust optimization model of berth allocation and quay crane scheduling problem is constructed.A algorithm of branch and bound is developed to this model.In the final part,some computational experiments are given by the branch and bound algorithm,and the robustness of berth and quay crane schedules is analyzed.Based on the results of experiments and the analysis,it is concluded that the proposed robust optimization model can control the robustness of the solution by adjusting the parameters of protective level and thus it is of great practical value.

关 键 词：泊位分配 岸桥调度 鲁棒优化 分支定界算法 

分 类 号：U651[交通运输工程—港口、海岸及近海工程]