A branch-and-price framework for the general double-cycling problem with internal-reshuffles
A branch-and-price framework for the general double-cycling problem with internal-reshuffles
复制标题
DOI：
10.1109/icnsc.2015.7116053
复制
发表时间：
2015-04
期刊：
影响因子：
--
通讯作者：
Ming Liu;Shijin Wang;C. Chu;Feifeng Zheng
中科院分区：
文献类型：
--
作者：
Ming Liu;Shijin Wang;C. Chu;Feifeng Zheng
在集装箱港口码头起重机调度实践中，提出了一台码头起重机在一个周期内同时装卸一个集装箱的双循环问题。由于集装箱船舶一般都装有舱口盖，这就产生了优先约束。针对舱盖的影响，本文提出了具有内部洗牌的一般双循环问题的模型和算法，其中允许洗牌容器直接从一个堆栈移动到另一个堆栈。由于内部洗牌的双循环问题没有精确的解决方案，我们提出了一个分支和价格框架来最优地解决它。
Double-cycling problem is motivated in quay crane scheduling practice at container ports, where a quay crane is enabled to simultaneously unload and load one container in a cycle. As container vessels are generally equipped with hatch covers, which induce precedence constraints. Regarding the impact of hatch covers, this paper proposes models and algorithm for the general double-cycling problem with internal-reshuffles, where reshuffle containers are allowed to move directly from one stack to another. As there is no exact solution to double-cycling problem with internal reshuffles, we present a branch-and-price framework to optimally solve it.