摘要
同贝同步装卸是集装箱码头提高装卸作业效率和资源利用率的有效途径和方法.其调度的复杂性体现在需要同时决策装、卸船两类集装箱在受堆场翻箱约束和舱口盖限制情况下的作业序列.针对该问题的柔性准备时间、成组调度和优先顺序约束等特点,本文建立了同贝同步装卸作业的整数规划模型.为求解模型,设计了基于遗传算法和贪婪规则的混合求解算法.最后,通过将算例实验结果与不考虑翻箱和舱口盖限制的简单下界进行比较,验证了模型与算法的有效性,说明所建立的模型有利于提高集装箱码头的装卸作业效率.
The quay crane dual-cycling, as an effective container terminal operation to improve the effi- ciency and utilization of terminal resources, involves a complicated process. Its complexity is determined by the restriction of yard reshuffles and hatch covers as well as integration of loading and unloading oper- ations in a same ship-bay. Considering setup time, scheduling with batching and precedence constraint, a formulation in quay crane dual-cycling operations is proposed as an integer programming model. An algo- rithm based on genetic algorithm and greedy strategy is introduced to the model. Finally, the effectiveness of the proposed approach is evaluated by a computation experiment. Results indicate that the proposed model can contribute to the operation efficiency in container terminals.
出处
《系统工程理论与实践》
EI
CSSCI
CSCD
北大核心
2016年第3期623-634,共12页
Systems Engineering-Theory & Practice
基金
国家自然科学基金(71272093
71371037)~~
关键词
集装箱码头
同贝同步装卸
调度模型
container terminal
dual-cycling operation
scheduling model
