摘要
基于出口箱的堆场操作实务,考虑堆场起重机取箱作业的现实约束,以作业过程中翻箱次数最少为目标,对堆场作业调度问题进行建模,提出了两阶段混合动态规划算法,将启发式规则嵌入动态规划算法中,以避免出现状态数"组合爆炸"增长的情况.通过仿真算例,并与实际调度规则及现有研究方法所得调度方案进行对比,验证了模型以及优化算法的有效性与实用性.结果表明,所提出的模型和算法可以在较短的求解时间内获得多组装船方案,且其翻箱次数显著降低.
. This paper presented a two-phase hybrid dynamic algorithm aiming at obtaining an optimized container retrieving sequence for a crane to retrieve all the containers from a given yard to the ship. The optimization goal was to minimize the number of container relocation operations. The two phases of the proposed dynamic procedure are as follows; in the first phase, a heuristic algorithm was developed to retrieve the containers which needed no relocation directly onto the ship; in the second phase, a dynamic pro gramming within heuristic rules was used to solve the retrieving sequences problem for the rest of the con tainers. Computational experiments showed that the model and the hybrid dynamic algorithm could solve the retrieving problem of container terminals efficiently.
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
2014年第1期146-153,共8页
Journal of Shanghai Jiaotong University
基金
国家自然科学基金(71172108
71302044)
大连市科技计划(2012A17GX125)
教育部高等学校博士学科点专项科研基金(20122125110009
20132125120009)资助项目
关键词
取箱作业调度
翻箱
启发式规则
动态规划
混合优化算法
yard crane scheduling
relocation containers
heuristic rules
dynamic programming
hybrid optimization algorithm
