作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2025, Vol. 51 ›› Issue (9): 362-372. doi: 10.19678/j.issn.1000-3428.0069376

• 开发研究与工程应用 • 上一篇    下一篇

基于策略搜索算法的出口集装箱翻箱作业优化

陈逸飞1,2,*(), 韩晓龙1, 牛雅凡1,2   

  1. 1. 上海海事大学物流科学与工程研究院, 上海 201306
    2. 上海铁路集装箱中心站, 上海 201308
  • 收稿日期:2024-02-19 修回日期:2024-04-22 出版日期:2025-09-15 发布日期:2025-09-26
  • 通讯作者: 陈逸飞

Optimization of Export Container Relocation Operations Based on Policy Search Algorithm

CHEN Yifei1,2,*(), HAN Xiaolong1, NIU Yafan1,2   

  1. 1. Institute of Logistics Science & Engineering, Shanghai Maritime University, Shanghai 201306, China
    2. Shanghai Railway Container Terminal Development Co., Ltd., Shanghai 201308, China
  • Received:2024-02-19 Revised:2024-04-22 Online:2025-09-15 Published:2025-09-26
  • Contact: CHEN Yifei

摘要:

随着港口物流在集装箱码头的高速发展, 在自动化集装箱码头中, 堆场出口集装箱贝位翻箱问题备受关注。考虑堆场出口集装箱贝位翻箱问题, 设计不同集装箱分布下的启发式翻箱规则, 并在处理空栈与特殊栈时进行细致的优化, 提出基于策略的快速求解算法。基于该算法引入规则得分, 构建基于规则排序的分支定界算法和定向搜索算法, 分支定界算法可求得该问题最优解, 而定向搜索算法可在较短时间内求得较优可行解。算例结果表明, 基于规则排序的分支定界算法与定向搜索算法在小规模算例上均能高效求解, 并且在大规模算例中, 通过与现有研究求解算法对比, 基于规则排序的分支定界算法与定向搜索算法求解效率提升近47.78%和56.59%。

关键词: 翻箱问题, 启发式算法, 分支定界算法, 定向搜索算法, 自动化集装箱码头

Abstract:

With the rapid development of port logistics and the increasing prevalence of automated container terminals, the issue of relocating export containers at specific locations in yard bays has garnered significant attention. This study addresses the container bay relocation problem by designing heuristic relocation rules under various container distributions and meticulously optimizes the handling of empty and special stacks. Moreover, it proposes a policy-based fast solution algorithm. Building on this algorithm, this study introduces a rule scoring system to develop a rule-based ordered branch and bound algorithm and a directed search algorithm. The branch and bound algorithm can obtain the optimal solution to a problem, whereas the directed search algorithm can achieve a superior feasible solution in a shorter time. Case study results demonstrate that both the rule-based ordered branch and bound algorithm and the directed search algorithm efficiently solve small-scale cases and achieve 47.78% and 56.59% improvements in solving efficiency for large-scale cases, respectively, compared with existing algorithms.

Key words: relocation problem, heuristic algorithm, branch and bound algorithm, directional search algorithm, automated container terminal