An efficient approach for solving yard crane scheduling in a container terminal

An efcient approach for yard crane（YC）scheduling is proposed in this paper.The definition of task group for YC scheduling is proposed.A mixed integer programming（MIP）model is developed.In the model,objective functions are subject to the minimization of the total delay of complete time for all task groups and the minimization of block-to-block movements of YCs.Due to the computational scale of the non-deterministic polynomial（NP）complete problem regarding YC scheduling,a rolling-horizon decision-making strategy is employed to solve this problem,by converting the MIP model into another MIP model in the scheduling of each rolling period.Afterwards,a heuristic algorithm based on modified A＊search is developed to solve the converted model and obtain near optimal solution.Finally,the computational experiments are used to examine the performance of the proposed approach for YC scheduling.     

资源紧缺型集装箱码头多类型场桥配置问题研究

针对资源紧缺型集装箱码头场桥配置特点,探索堆场场桥配置问题.使用运筹 学线性规划方法,建立集装箱码头堆场场桥配置混合整数规划模型,模型能够处理码头 多类型场桥配置问题.数值实验部分,结合港口实际情况设计算例验证模型的有效性,同 时对模型进行较为完整的场景分析,包括初始场桥分配、场桥作业性能及场桥资源数量, 指出其对实际堆场管理的意义.实验结果显示,本文建立的场桥配置问题能够较好地解决 资源紧缺型集装箱码头场桥配置问题,为实际港口操作提供决策支持.