Reclaiming scheduling in dry bulk terminals considering blending during ship loading

Expand
  • (1. Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong Special Administrative Region,China;2. State Key Laboratory of Coastal and Offshore Engineering, Dalian University of Technology, Dalian 116024, China)


Online published: 2024-05-20

Abstract

The issue of reclaiming scheduling in dry bulk terminal yards was examined, with the objective of enhancing operational efficiency, minimizing delays, and optimizing the advantages of ship loading mixing operations. An optimization model was developed to schedule the reclaiming operations at a dry bulk terminal, considering the loading mixing process, in order to reduce delays. The integrated optimization of reclaiming scheme formulation, stacking position allocation, and reclaimer scheduling was conducted, by considering constraints such as dynamic yard storage of various goods, mutual interference of reclaimer operations, and proportional synchronous reclaiming of multiple stacking positions. Based on the characteristics of the problem and model, a heuristic algorithm was designed to efficiently solve large-scale problems by using adaptive large neighborhood search. The experimental results show that, compared to a general solver, the method proposed in this paper can obtain high-quality material retrieval scheduling schemes for large-scale cases within 1 hour. Compared with the squeaking wheel algorithm, the average improvement of the objective function value in solving large-scale cases is 19.9%. Meanwhile, this method comprehensively considers the integrated optimization of stacking allocation and reclaimer scheduling for mixed loading. Compared with the results obtained without considering mixed loading, the total delay of reclaimer operations reduced by an average of 28.35%,which can provide theoretical support for dry bulk terminals to allocate yard resources and plan operations when considering mixed loading process.

Cite this article

CAO Zhen, WANG Wenyuan, LIU Keke, XU Xinglu, GUO Zijian . Reclaiming scheduling in dry bulk terminals considering blending during ship loading[J]. Journal of Dalian Maritime University, 2024 , 50(4) : 67 -78 . DOI: 10.16411/j.cnki.issn1006-7736.2024.04.008

References

[1]SIRIMANNE S N, HOFFMANN J, ASARIOTIS R, et al. Review of maritime transport: towards a green and just transition[M]. New York : United Nations Conference on Trade and Development, 2023.

[2]吴立新, 于洋, 刘珊. 大型连续布置煤炭泊位装船能力影响因素分析[J]. 水运工程, 2016(10): 100-105. 
WU L X, YU Y, LIU S. Analysis on ship loading influence factors of continuous layout berths in large coal terminal[J]. Port & Waterway Engineering, 2016(10): 100-105. (in Chinese)
[3]刘志刚, 汪旭. 精配煤作业控制系统在港口的应用[J]. 港工技术, 2020,57(S2): 22-25. 
LIU Z G, WANG X. Application of fine coal blending process control system in port[J]. Port Engineering Technology, 2020,57(S2): 22-25. (in Chinese)
[4]吴立新, 曹震, 郭家琪, 等. 煤炭装船码头堆场通过能力优化[J]. 水运工程, 2021(10): 334-340. 
WU L X, CAO Z, GUO J Q, et al. Optimization of stockyard throughput capacity in coal export terminal[J].Port & Waterway Engineering, 2021(10): 334-340. (in Chinese)
[5]GUO J Q, JIANG Y, CAO Z, et al. A simulation-based approach for improving stockyard allocation in coal export terminals[J]. Asian Transport Studies, 2022,8: 100068.
[6]KALINOWSKI T, KAPOOR R, SAVELSBERGH M W P. Scheduling reclaimers serving a stock pad at a coal terminal[J]. Journal of Scheduling, 2017,20(1): 85-101.
[7]UNSAL O. Reclaimer scheduling in dry bulk terminals[J]. IEEE Access, 2020, 8: 96294-96303.
[8]BOLAND N, GULCZYNSKI D, SAVELSBERGH M. A stockyard planning problem[J]. EURO Journal on Transportation and Logistics, 2012,1(3): 197-236.
[9]ROBENEK T, UMANG N, BIERLAIRE M, et al. A branch and price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports[J]. European Journal of Operational Research, 2014,235(2): 399-411.
[10]PRATAP S, KUMAR B M, SAXENA D, et al. Integrated scheduling of rake and stockyard management with ship berthing: a block based evolutionary algorithm[J]. International Journal of Production Research, 2016,54(14): 4182-4204.

[11]MENEZES G C, MATEUS G R, RAVETTI M G. A hierarchical approach to solve a production planning and scheduling problem in bulk cargo terminal[J]. Computers & Industrial Engineering, 2016,97: 1-14.

[12]MENEZES G C, MATEUS G R, RAVETTI M G. A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports[J]. European Journal of Operational Research, 2017,258(3): 926-937.

[13]UNSAL O, OGUZ C. An exact algorithm for integrated planning of operations in dry bulk terminals[J]. Transportation Research Part E: Logistics and Transportation Review, 2019,126: 103-121.

[14]BURDETT R L, CORRY P, YARLAGADDA P K D V, et al. A flexible job shop scheduling approach with operators for coal export terminals[J]. Computers & Operations Research, 2019,104:15-36.

[15]BURDETT R L, CORRY P, EUSTACE C, et al. A flexible job shop scheduling approach with operators for coal export terminals a mature approach[J]. Computers & Operations Research, 2020,115: 104834.

[16]BURDETT R L, CORRY P, EUSTACE C. Stockpile scheduling with geometry constraints in dry bulk terminals[J]. Computers & Operations Research, 2021,130: 105224.
[17]田琦. 干散货港区装船作业系统运维与调度协同优化[D].大连:大连理工大学, 2022. 
TIAN Q. Collaborative optimization of maintenance and scheduling for ship loading operation system in dry bulk port[D].Dalian: Dalian University of Technology, 2022. (in Chinese)
[18]LI C G, WU S, LI Z, et al. Intelligent scheduling method for bulk cargo terminal loading process based on deep reinforcement learning[J]. Electronics, 2022,11:1390.
[19]夏僮, 唐昕, 郑澜波, 等. 基于多商品流的配煤港口资源协同计划研究[J]. 武汉理工大学学报, 2023,45(2): 35-43. 
XIA T, TANG X, ZHENG L B, et al. Research on resource collaborative planning of coal blending port based on multi-commodity flow[J]. Journal of Wuhan University of Technology, 2023,45(2): 35-43. (in Chinese)
[20]皮幺梅. 基于网络流理论的配煤港口协同调度计划研究[D].武汉:武汉理工大学, 2019. 
PI Y M. The integrated scheduling plan problem in coal blending port based on the theory of the network flow[D]. Wuhan: Wuhan University of Technology, 2019. (in Chinese)
[21]李伟. 配煤与装船协同调度优化研究[D].武汉:武汉理工大学, 2021.
LI W. Optimization on coordinated scheduling of coal blending and ship loading operations[D]. Wuhan: Wuhan University of Technology, 2021. (in Chinese) 
[22]CHEN S K, WANG H, MENG Q. Autonomous truck scheduling for container transshipment between two seaport terminals considering platooning and speed optimization[J]. Transportation Research Part B: Methodological, 2021,154: 289-315.
[23]ROPKE S, PISINGER D. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows[J]. Transportation Science, 2006,40(4): 455-472.
[24]SHAW P. Using constraint programming and local search methods to solve vehicle routing problems[C]//International Conference on Principles and Practice of Constraint Programming. Pisa: Springer Berlin Heidelberg, 1998: 417-431. 
[25]SINGH N, DANG Q, AKCAY A, et al. A matheuristic for AGV scheduling with battery constraints[J]. European Journal of Operational Research, 2022,298(3): 855-873.
[26]LI R, ZHANG X, JIANG L, et al. An adaptive heuristic algorithm based on reinforcement learning for ship scheduling optimization problem[J]. Ocean & Coastal Management, 2022,230: 106375.
[27]ZHEN L. Modeling of yard congestion and optimization of yard template in container ports[J]. Transportation Research Part B: Methodological, 2016,90: 83-104.


Outlines

/