%0 Journal Article
%T 集装箱场地箱位分配问题<br>Location assignments for outbound containers in container terminals
%A 张灿荣
%A 钟明
%A 缪立新
%J 清华大学学报（自然科学版）
%D 2015
%R 10.16511/j.cnki.qhdxxb.2015.22.001
%X 为减少集装箱在装船时的翻倒箱次数, 针对出口集装箱在堆场贝内箱位分配问题进行研究。以往的研究假设集装箱的重量概率分布在整个集港过程中保持不变, 由于该假设与实际情况不相符合, 该文考虑了集装箱的重量概率分布随堆存状况可变的情形, 使其更加符合实际情况, 并构建了一个带约束的随机动态规划模型。在求解算法方面, 小规模算例可直接通过动态规划模型求得最优解。针对大规模算例, 提出了两阶段的启发式算法: 第一阶段基于邻域搜索的启发式算法, 设计出各重量组的集装箱在不同堆垛形态下的优先堆放次序; 第二阶段设计了基于翻滚策略的箱位堆放局部优化算法。数值计算结果表明: 适用于小规模算例的动态规划算法和适用于大规模算例的两阶段启发式算法都能显著改善解质量, 减少翻倒箱次数。<br>Abstract：This study analyzes the location assignments for outbound containers in terminals to reduce the container re-handling during loading operations. Previous studies assumed that the container arrival probability for each weight group remained unchanged during the entire receiving process, which is not true in practice. This study adjusts the probability that the remaining containers have not yet arrived at the terminal. A constrained dynamic programming model is then constructed for this problem. Small-instances can be directly optimized by the dynamic programming model. Large-instances are solved with a two-stage heuristic algorithm. The first stage develops a heuristic to generate the precedence of the stacking patterns for each container weight group. The second stage uses a heuristic algorithm based on the rolling strategy. Numerical calculations show that the dynamic programming method for small-instances and the two-stage heuristic algorithm for large-instances both significantly improve the solution quality and reduce the container re-handling.
%K 集装箱
%K 箱位分配
%K 动态规划
%K 启发式算法
%K &lt
%K br&gt
%K container
%K location assignment
%K dynamic programming
%K heuristic algorithm
%U http://jst.tsinghuajournals.com/CN/Y2015/V55/I10/1150