考虑船货匹配的内河自动化矿石码头泊位分配优化  

Optimization of Berth Allocation for Inland Automated Ore Terminal Considering Vessel-cargo Matching

作　　者：高振迪 计明军 孔灵睿 侯馨皓 GAO Zhendi;JI Mingjun;KONG Lingrui;HOU Xinhao(School of Transportation Engineering,Dalian Maritime University,Dalian,Liaoning 116026,China)

机构地区：[1]大连海事大学交通运输工程学院,辽宁大连116026

出　　处：《工业工程与管理》2025年第1期75-81,共7页Industrial Engineering and Management

基　　金：国家自然科学基金资助项目(71971035)。

摘　　要：本文关注于自动化背景下内河矿石码头因新工艺形成的一类特殊泊位分配问题。此问题中,后序入泊船可借用具有相同货物需求的前序船的运输线路进行运货,以节省在泊等待时间。此工艺打破了船舶间的独立性,使码头在进行泊位分配时必须额外考虑不同船舶组合对码头效率和服务水平的综合影响。本文以船舶离泊时刻与船舶等待时间最小为目标,构建了混合整数规划模型,并设计了大规模邻域搜索算法求解。结果表明:算法可给出每艘船的泊位指派方案以及船舶(岸上设备)的前后序关系。调度优化方案可节约4.5%~18%的作业时间和50%左右的在泊等待时间,有效提升了码头的作业效率和服务质量,为内河自动化矿石码头的运营与建设提供了理论支持与方法支持。A unique berth allocation problem formed by new processes in automated inland river ore terminals was focused. In this problem, subsequent ships docking can borrow the transport route of preceding ships with the same cargo demand to minimize waiting time at the berth. This process broken the independence among ships, requiring the terminal to consider the combined impact of different ship combinations on terminal efficiency and service levels during berth allocation. The objective was to minimize ship departure times and waiting times, for which a mixed-integer programming model was constructed. A large-scale neighborhood search algorithm was developed to solve this problem. The experimental results show that the algorithm can provide berth assignment plans for each ship and the precedence relationship of ships(shore equipment). The optimized scheduling plan can save about 4.5%to 18% of operation time and approximately 50% of waiting time at the berth, effectively enhancing the terminal's operational efficiency and service quality. This provides theoretical and methodological support for the operation and construction of automated inland river ore terminals.

关 键 词：水路运输 自动化矿石码头集成调度 自适应大规模邻域搜索 自动化矿石码头 船货匹配 

分 类 号：U691.3[交通运输工程—港口、海岸及近海工程]