摘要
在进口箱疏港过程中,服务于相同客户的若干集卡组成集卡组,具有相同的抵港时间,因此,外部集卡抵港提箱呈现分批到达的特点.集卡组内作业指派的优劣直接影响场桥的作业效率,存在较大的优化空间.对此,基于翻箱作业不能跨贝进行的现实约束,将场桥作业调度解构为场桥作业路径优化问题和贝内翻箱作业优化问题两部分并分别建立动态优化模型.针对场桥作业路径优化问题,提出一种多项式时间的精确算法并给以证明;针对贝内翻箱作业优化问题,设计一种基于MSA的双层启发式算法进行求解.一系列数值实验的结果显示了所提出优化模型及算法的有效性和鲁棒性.
In the configuration process of import containers, external trucks who serve the same customer own the same arrival time, therefore the trucks＇ arrival regularity present the characteristics of arrival in batch. The task assignment for trucks in the same batch will directly affect the operation efficiency of the corresponding yard crane, which implies the large optimization space. To solve this problem, based on the actual constraint that relocation operation can not be carried out across different bays, the yard crane scheduling is deconstructed into moving path scheduling and relocation scheduling.Accordingly, the mathematical optimization model for these two parts are formulated respectively. In order to get the optimal solution of the yard crane moving path optimization model, a polynomial time algorithm is developed and two auxiliary theorems are proved to support it. Meanwhile, a bi-level heuristic algorithm based on memory simulated annealing is developed to obtain satisfying solutions of the relocation optimization model. Experimental results show the effectiveness and robust of the optimization models and algorithms.
出处
《控制与决策》
EI
CSCD
北大核心
2016年第9期1654-1662,共9页
Control and Decision
基金
国家自然科学基金重点项目(71431001)
国家自然科学基金项目(71172108
71302044
71572023)
交通运输部应用基础项目(2014329225110)
教育部高等学校博士学科点专项科研基金项目(20122125110009
20132125120009)
中央高校基本科研业务费专项资金项目(3132013320
3132013076)
中国博士后基金项目(2013M530927)
辽宁省博士启动基金计划(20131007)
关键词
集装箱
分批到达
场桥作业调度
翻箱
container
batch arrival
yard crane scheduling
relocation
