Computer Engineering and Applications ›› 2023, Vol. 59 ›› Issue (16): 262-284.DOI: 10.3778/j.issn.1002-8331.2304-0278

• Engineering and Applications • Previous Articles     Next Articles

Multi-Container Terminal Berth Allocation Based on Computational Logistics and Swarm Intelligence

LI Bin, TANG Zhibin   

  1. 1.School of Mechanical and Automotive Engineering, Fujian University of Technology, Fuzhou 350118, China
    2.Fujian Provincial Key Laboratory of Big Data Mining and Applications, Fujian University of Technology, Fuzhou 350118, China
    3.School of Transportation, Fujian University of Technology, Fuzhou 350118, China
  • Online:2023-08-15 Published:2023-08-15

基于计算物流和群集智能的多集装箱码头泊位分配

李斌,唐志斌   

  1. 1.福建理工大学 机械与汽车工程学院,福州 350118
    2.福建理工大学 福建省大数据挖掘与应用重点实验室,福州 350118
    3.福建理工大学 交通运输学院,福州 350118

Abstract: Based on the integration and synergy of multiple container terminal operating space resources by port operators, this paper makes an in-depth discussion on the multi-terminal dynamic and continuous berth allocation problem(MDC-BAP) by considering berth depth constraint and export container transferable operations. The MDC-BAP is abstracted as a heterogeneous multiple knapsack problem for operation modelling by computational logistics, and then a mixed integer linear programming model is established to minimize the total running cost of both sides of port and shipping. Subsequently, a kind of two-stage improved imperialist competitive algorithm(TSI-ICA) is designed to solve the MDC-BAP model by the integration of computational logistics and swarm intelligence. Finally, the numerical experiments of twelve large-scale MDC-BAP examples in three planning periods are executed intensively, and the comprehensive solving performance of diversiform improved imperialist competitive algorithms and multifarious heuristic rules on the MDC-BAP model are compared and analyzed. The computing framework of “meta-heuristic algorithm + heuristic rule” designed by TSI-ICA is obviously superior to the resource allocation mode of “heuristic rule + heuristic rule” on large-scale examples. Moreover, it illustrates that multi-terminal cooperative production is superior to single-terminal independent service mode from two aspects of operating costs and running toughness. Consequently, it provides a favorable intelligent decision support solution for collaborative berth allocation of multiple container terminals.

Key words: multiple container terminal, berth allocation problem, joint production and operation, heterogeneous multiple knapsack problem, computational logistics, imperialist competitive algorithm, queuing theory

摘要: 以港口运营方统一整合多集装箱码头作业空间资源为背景,探讨了考虑泊位水深约束和出口集装箱可转港作业的多码头动态连续泊位分配问题(multi-terminal dynamic and continuous berth allocation problem,MDC-BAP)。基于计算物流将MDC-BAP抽象为异构多背包问题进行运筹建模,建立了同时考虑港航双方作业总成本最小化的混合整数规划模型,进而设计了一类融合计算物流和群集智能的二阶段改进帝国竞争算法(two-stage improved imperialist competitive algorithm,TSI-ICA)对模型进行求解。采用三种计划周期12个大规模MDC-BAP算例执行数值实验,比较了多种改进帝国竞争算法和多种启发式规则在MDC-BAP模型上的综合求解性能,TSI-ICA设计的“元启发式算法+启发式规则”框架在大规模算例上的表现明显优于“启发式规则+启发式规则”的资源分配模式,并从运作成本和运营韧性两方面阐明了多码头协同生产优于单码头独立作业模式,从而为多集装箱码头泊位协同分配提供了较好的智能决策支持解决方案。

关键词: 多集装箱码头, 泊位分配问题, 联合生产运营, 异构多背包问题, 计算物流, 帝国竞争算法, 排队论