Please wait a minute...
 首页  期刊介绍 期刊订阅 联系我们 横山亮次奖 百年刊庆
 
最新录用  |  预出版  |  当期目录  |  过刊浏览  |  阅读排行  |  下载排行  |  引用排行  |  横山亮次奖  |  百年刊庆
清华大学学报(自然科学版)  2015, Vol. 55 Issue (10): 1150-1156    DOI: 10.16511/j.cnki.qhdxxb.2015.22.001
  物流与管理 本期目录 | 过刊浏览 | 高级检索 |
集装箱场地箱位分配问题
张灿荣, 钟明, 缪立新
清华大学 深圳研究生院, 深圳 518055
Location assignments for outbound containers in container terminals
ZHANG Canrong, ZHONG Ming, MIAO Lixin
Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China
全文: PDF(1292 KB)  
输出: BibTeX | EndNote (RIS)      
摘要 为减少集装箱在装船时的翻倒箱次数, 针对出口集装箱在堆场贝内箱位分配问题进行研究。以往的研究假设集装箱的重量概率分布在整个集港过程中保持不变, 由于该假设与实际情况不相符合, 该文考虑了集装箱的重量概率分布随堆存状况可变的情形, 使其更加符合实际情况, 并构建了一个带约束的随机动态规划模型。在求解算法方面, 小规模算例可直接通过动态规划模型求得最优解。针对大规模算例, 提出了两阶段的启发式算法: 第一阶段基于邻域搜索的启发式算法, 设计出各重量组的集装箱在不同堆垛形态下的优先堆放次序; 第二阶段设计了基于翻滚策略的箱位堆放局部优化算法。数值计算结果表明: 适用于小规模算例的动态规划算法和适用于大规模算例的两阶段启发式算法都能显著改善解质量, 减少翻倒箱次数。
服务
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章
张灿荣
钟明
缪立新
关键词 集装箱箱位分配动态规划启发式算法    
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.
Key wordscontainer    location assignment    dynamic programming    heuristic algorithm
收稿日期: 2013-06-21      出版日期: 2015-11-16
ZTFLH:  U169.65  
  O221.3  
基金资助:国家自然科学基金项目(71102011,71472108)
通讯作者: 缪立新,教授,E-mail:lxmiao@tsinghua.edu.cn     E-mail: lxmiao@tsinghua.edu.cn
作者简介: 张灿荣(1982-),男(汉),福建,副教授。
引用本文:   
张灿荣, 钟明, 缪立新. 集装箱场地箱位分配问题[J]. 清华大学学报(自然科学版), 2015, 55(10): 1150-1156.
ZHANG Canrong, ZHONG Ming, MIAO Lixin. Location assignments for outbound containers in container terminals. Journal of Tsinghua University(Science and Technology), 2015, 55(10): 1150-1156.
链接本文:  
http://jst.tsinghuajournals.com/CN/10.16511/j.cnki.qhdxxb.2015.22.001  或          http://jst.tsinghuajournals.com/CN/Y2015/V55/I10/1150
  图1 初始模型堆垛状态表述
  图2 动态规划模型决策过程
  图3 改进模型堆垛状态表述
  表1 集装箱预估与实际重量概率调整矩阵[10]
  表2 各模型累计翻倒箱次数对比
  图4 两阶段启发式算法架构图
  图5 基于邻域搜索的启发式算法流程图
  图6 3层高堆垛可能堆放的状态
  图7 贝内堆垛结构与解示例
  图8 候选解产生规则
  图9 基于翻滚策略的局部优化算法流程图
  图10 顺序堆放与按重量组堆放方式
  表3 不同贝位结构算法对比分析
[1] Kim K H, Park K T. A note on a dynamic space-allocation method for outbound containers [J]. European Journal of Operational Research, 2003, 148(1): 92-101.
[2] Zhang C, Liu J, Wan Y, et al. Storage space allocation in container terminals [J]. Transportation Research Part B, 2003, 37(10): 883-903.
[3] Lee L, Chew E, Tan K, et al. An optimization model for storage yard management in transshipment hubs [J]. OR Spectrum, 2006, 28(4): 539-561.
[4] Han Y, Lee L, Chew E, et al. A yard storage strategy for minimizing traffic congestion in a marine container transshipment hub [J]. OR Spectrum, 2008, 30(4): 697-720.
[5] Zhang C, Zhang Z, Zheng L, et al. A decision support system for the allocation of yard cranes and blocks in container terminals [J]. Asia-Pacific Journal of Operational Research, 2011, 28(6): 803-829.
[6] Kozan E, Preston P. Mathematical modelling of container transfers and storage locations at seaport terminals [J]. OR Spectrum, 2006, 28(4): 519-537.
[7] Zhu W, Qin H, Lim A, et al. Iterative deepening A* algorithms for the container relocation problem [J]. IEEE Transactions on Automation Science and Engineering, 2012, 9(4): 710-722.
[8] Chen L, Lu Z. The storage location assignment problem for outbound containers in a maritime terminal [J]. International Journal of Production Economics, 2012, 135(1): 73-80.
[9] Dekker R, Voogd P, Eelco V A. Advanced methods for container stacking [J]. OR Spectrum, 2006, 28(4): 563-586.
[10] Kang J, Ryu K, Kim K. Deriving stacking strategies for export containers with uncertain weight information [J]. Journal of Intelligent Manufacturing, 2006, 17(4): 399-410.
[11] Kim K H, Park Y M, Ryu K R. Deriving decision rules to locate export containers in container yards [J]. European Journal of Operational Research, 2000, 124(1): 89-101.
[12] Zhang C, Chen W, Shi L, et al. A note on deriving decision rules to locate export containers in container yards [J]. European Journal of Operational Research, 2010, 205(2): 483-485.
[1] 陈东辉, 陈岭, 王俊凯, 吴勇, 王敬昌. 不确定性数据上聚合查询的近似算法[J]. 清华大学学报(自然科学版), 2018, 58(3): 231-236.
[2] 秦兆博, 罗禹贡, 张东好, 陈龙, 李克强. 液压混合动力履带推土机行星齿轮传动系统的设计[J]. 清华大学学报(自然科学版), 2017, 57(5): 497-503.
[3] 朱锐,李云洲,王京. 基于能量收割的认知无线电预编码优化[J]. 清华大学学报(自然科学版), 2014, 54(4): 407-412.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
版权所有 © 《清华大学学报(自然科学版)》编辑部
本系统由北京玛格泰克科技发展有限公司设计开发 技术支持:support@magtech.com.cn