Berth Allocation Considering Multiple Quays: A Practical Approach Using Cuckoo Search Optimization

布谷鸟搜索 计算机科学 元启发式 运筹学 粒子群优化 整数规划 端口(电路理论) 线性规划 数学优化 遗传算法 海洋工程 工程类 算法 数学 电气工程 机器学习
作者
Sheraz Aslam,Michalis P. Michaelides,Herodotos Herodotou
出处
期刊:Journal of Marine Science and Engineering [Multidisciplinary Digital Publishing Institute]
卷期号:11 (7): 1280-1280 被引量:9
标识
DOI:10.3390/jmse11071280
摘要

Maritime container terminals (MCTs) play a fundamental role in international maritime trade, handling inbound, outbound, and transshipped containers. The increasing number of ships and containers creates several challenges to MCTs, such as congestion, long waiting times before ships dock, delayed departures, and high service costs. The berth allocation problem (BAP) concerns allocating berthing positions to arriving ships to reduce total service cost, waiting times, and delays in vessels’ departures. In this work, we extend the study of continuous BAP, which considers a single quay (straight line) for berthing ships, to multiple quays, as found in many ports around the globe. Multi-Quay BAP (MQ-BAP) adds the additional dimension of assigning a preferred quay to each arriving ship, rather than just specifying the berthing position and time. In this study, we address MQ-BAP with the objective of minimizing the total service cost, which includes minimizing the waiting times and delays in the departure of ships. MQ-BAP is first formulated as a mixed-integer linear problem and then solved using the cuckoo search algorithm (CSA), a computational intelligence (CI)-based approach. In addition, the exact mixed-integer linear programming (MILP) method, two other state-of-the-art metaheuristic approaches, namely the genetic algorithm (GA) and particle swarm optimization (PSO), as well as a first come first serve (FCFS) approach, are also implemented for comparison purposes. Several experiments are conducted using both randomly generated and real data from the Port of Limassol, Cyprus, which has five quays serving commercial vessel traffic. The comparative analysis and experimental results show that the CSA-based method achieves the best overall results in affordable time as compared to the other CI-based methods, for all considered scenarios.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
Orange应助Yesir采纳,获得10
1秒前
1秒前
爆米花应助猹尔斯采纳,获得10
1秒前
不安太阳发布了新的文献求助10
2秒前
xiaogui发布了新的文献求助10
2秒前
3秒前
4秒前
共享精神应助彪yu采纳,获得10
4秒前
tochege完成签到,获得积分10
5秒前
Orange应助骑着火车撵火箭采纳,获得10
5秒前
lcj2022发布了新的文献求助10
6秒前
Owen应助LOONG采纳,获得10
6秒前
6秒前
6秒前
喵喵发布了新的文献求助10
6秒前
6秒前
找论文的牛马完成签到,获得积分10
7秒前
香蕉觅云应助自信放光芒采纳,获得10
7秒前
小竹笋完成签到,获得积分10
7秒前
7秒前
whn发布了新的文献求助10
8秒前
SYLH应助unite 小丘采纳,获得10
8秒前
Emily应助ling采纳,获得10
8秒前
是真的发布了新的文献求助10
9秒前
gfi关注了科研通微信公众号
9秒前
9秒前
帅气书文完成签到,获得积分10
10秒前
无语的弱发布了新的文献求助10
11秒前
gk发布了新的文献求助10
12秒前
lcj2022完成签到,获得积分20
13秒前
WANGCHU发布了新的文献求助10
13秒前
14秒前
14秒前
狮子座完成签到,获得积分10
14秒前
凌儿响叮当完成签到 ,获得积分10
16秒前
lmgj完成签到,获得积分10
16秒前
量子星尘发布了新的文献求助10
16秒前
16秒前
喻嘟嘟发布了新的文献求助10
17秒前
薯愿完成签到,获得积分10
18秒前
高分求助中
Picture Books with Same-sex Parented Families: Unintentional Censorship 700
ACSM’s Guidelines for Exercise Testing and Prescription, 12th edition 500
Nucleophilic substitution in azasydnone-modified dinitroanisoles 500
不知道标题是什么 500
Indomethacinのヒトにおける経皮吸収 400
Phylogenetic study of the order Polydesmida (Myriapoda: Diplopoda) 370
Effective Learning and Mental Wellbeing 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3974463
求助须知:如何正确求助?哪些是违规求助? 3518823
关于积分的说明 11196212
捐赠科研通 3255008
什么是DOI,文献DOI怎么找? 1797655
邀请新用户注册赠送积分活动 877052
科研通“疑难数据库(出版商)”最低求助积分说明 806130