Berth allocation and scheduling at marine container terminals: A state-of-the-art review of solution approaches and relevant scheduling attributes

Author:

Li Bokang1ORCID,Elmi Zeinab1,Manske Ashley1,Jacobs Edwina1,Lau Yui-yip2,Chen Qiong3,Dulebenets Maxim A1ORCID

Affiliation:

1. Department of Civil & Environmental Engineering, Florida A&M University-Florida State University (FAMU-FSU) College of Engineering , 2035 E Paul Dirac Dr, Sliger Building, Suite 275, Tallahassee, FL 32310 , USA

2. Division of Business and Hospitality Management, College of Professional and Continuing Education, The Hong Kong Polytechnic University , 9 Hoi Ting Road, Yau Ma Tei, Kowloon, Hong Kong

3. Navigation College, Jimei University , Xiamen 361021 , China

Abstract

AbstractMarine container terminals play a significant role for international trade networks and global market. To cope with the rapid and steady growth of the seaborne trade market, marine container terminal operators must address the operational challenges with appropriate analytical methods to meet the needs of the market. The berth allocation and scheduling problem is one of the important decisions faced by operators during operations planning. The optimization of a berth schedule is strongly associated with the allocation of spatial and temporal resources. An optimal and robust berth schedule remarkably improves the productivity and competitiveness of a seaport. A significant number of berth allocation and scheduling studies have been conducted over the last years. Thus, there is an existing need for a comprehensive and critical literature survey to analyze the state-of-the-art research progress, developing tendencies, current shortcomings, and potential future research directions. Therefore, this study thoroughly selected scientific manuscripts dedicated to the berth allocation and scheduling problem. The identified studies were categorized based on spatial attributes, including discrete, continuous, and hybrid berth allocation and scheduling problems. A detailed review was performed for the identified study categories. A representative mathematical formulation for each category was presented along with a detailed summary of various considerations and characteristics of every study. A specific emphasis was given to the solution methods adopted. The current research shortcomings and important research needs were outlined based on the review of the state-of-the-art. This study was conducted with the expectation of assisting the scientific community and relevant stakeholders with berth allocation and scheduling.

Publisher

Oxford University Press (OUP)

Subject

Computational Mathematics,Computer Graphics and Computer-Aided Design,Human-Computer Interaction,Engineering (miscellaneous),Modeling and Simulation,Computational Mechanics

Reference145 articles.

1. An integrated queueing-inventory-routing problem in a green dual-channel supply chain considering pricing and delivery period: A case study of construction material supplier;Abbaspour;Journal of Computational Design and Engineering,2022

2. Distributionally robust optimization for the berth allocation problem under uncertainty;Agra;Transportation Research Part B: Methodological,2022

3. Parallelism and evolutionary algorithms;Alba;IEEE Transactions on Evolutionary Computation,2002

4. Optimal berth allocation under regular and emergent vessel arrivals;Al-Refaie;Proceedings of the Institution of Mechanical Engineers, Part M: Journal of Engineering for the Maritime Environment,2021

5. Optimal berth scheduling and sequencing under unexpected events;Al-Refaie;Journal of the Operational Research Society,2022

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3