利用计算智能优化多码头组合泊位和码头起重机分配

IF 2.7 3区 地球科学 Q1 ENGINEERING, MARINE
Sheraz Aslam, Michalis P. Michaelides, Herodotos Herodotou
{"title":"利用计算智能优化多码头组合泊位和码头起重机分配","authors":"Sheraz Aslam, Michalis P. Michaelides, Herodotos Herodotou","doi":"10.3390/jmse12091567","DOIUrl":null,"url":null,"abstract":"The significant increase in international seaborne trade volumes over the last several years is pushing port operators to improve the efficiency of terminal processes and reduce vessel turnaround time. Toward this direction, this study investigates and solves the combined berth allocation problem (BAP) and quay crane allocation problem (QCAP) in a multi-quay (MQ) setting using computational intelligence (CI) approaches. First, the study develops a mathematical model representing a real port environment and then adapts the cuckoo search algorithm (CSA) for the first time in this setup. The CSA is inspired by nature by following the basic rules of breeding parasitism of some cuckoo species that lay eggs in other birds’ nests. For comparison purposes, we implement two baseline approaches, first come first serve and exact MILP, and two CI approaches, particle swarm optimization (PSO) and genetic algorithm (GA), that are typically used to solve such complex or NP-hard problems. Performance assessment is carried out via a comprehensive series of experiments using real-world data. Experimental findings show that the MILP method can address the problems only when a small dataset is employed. In contrast, the newly adapted CSA can solve larger instances of MQ BAP and QCAP within significantly reduced computation times.","PeriodicalId":16168,"journal":{"name":"Journal of Marine Science and Engineering","volume":null,"pages":null},"PeriodicalIF":2.7000,"publicationDate":"2024-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimizing Multi-Quay Combined Berth and Quay Crane Allocation Using Computational Intelligence\",\"authors\":\"Sheraz Aslam, Michalis P. Michaelides, Herodotos Herodotou\",\"doi\":\"10.3390/jmse12091567\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The significant increase in international seaborne trade volumes over the last several years is pushing port operators to improve the efficiency of terminal processes and reduce vessel turnaround time. Toward this direction, this study investigates and solves the combined berth allocation problem (BAP) and quay crane allocation problem (QCAP) in a multi-quay (MQ) setting using computational intelligence (CI) approaches. First, the study develops a mathematical model representing a real port environment and then adapts the cuckoo search algorithm (CSA) for the first time in this setup. The CSA is inspired by nature by following the basic rules of breeding parasitism of some cuckoo species that lay eggs in other birds’ nests. For comparison purposes, we implement two baseline approaches, first come first serve and exact MILP, and two CI approaches, particle swarm optimization (PSO) and genetic algorithm (GA), that are typically used to solve such complex or NP-hard problems. Performance assessment is carried out via a comprehensive series of experiments using real-world data. Experimental findings show that the MILP method can address the problems only when a small dataset is employed. In contrast, the newly adapted CSA can solve larger instances of MQ BAP and QCAP within significantly reduced computation times.\",\"PeriodicalId\":16168,\"journal\":{\"name\":\"Journal of Marine Science and Engineering\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.7000,\"publicationDate\":\"2024-09-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Marine Science and Engineering\",\"FirstCategoryId\":\"89\",\"ListUrlMain\":\"https://doi.org/10.3390/jmse12091567\",\"RegionNum\":3,\"RegionCategory\":\"地球科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, MARINE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Marine Science and Engineering","FirstCategoryId":"89","ListUrlMain":"https://doi.org/10.3390/jmse12091567","RegionNum":3,"RegionCategory":"地球科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MARINE","Score":null,"Total":0}
引用次数: 0

摘要

过去几年来,国际海运贸易量大幅增长,推动港口运营商提高码头流程效率,缩短船舶周转时间。为此,本研究采用计算智能 (CI) 方法研究并解决了多码头 (MQ) 环境下的泊位分配问题 (BAP) 和码头起重机分配问题 (QCAP)。首先,该研究建立了一个代表真实港口环境的数学模型,然后首次在此设置中采用了布谷鸟搜索算法(CSA)。布谷鸟搜索算法的灵感来源于自然界,它遵循一些布谷鸟物种在其他鸟类巢中产卵的基本繁殖寄生规则。为了进行比较,我们采用了两种基准方法--先到先得和精确 MILP,以及两种 CI 方法--粒子群优化(PSO)和遗传算法(GA),这两种方法通常用于解决此类复杂或 NP-困难问题。性能评估是通过一系列使用真实世界数据的综合实验进行的。实验结果表明,MILP 方法只有在使用小数据集时才能解决问题。相比之下,新调整的 CSA 可以在显著缩短的计算时间内解决 MQ BAP 和 QCAP 的较大实例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimizing Multi-Quay Combined Berth and Quay Crane Allocation Using Computational Intelligence
The significant increase in international seaborne trade volumes over the last several years is pushing port operators to improve the efficiency of terminal processes and reduce vessel turnaround time. Toward this direction, this study investigates and solves the combined berth allocation problem (BAP) and quay crane allocation problem (QCAP) in a multi-quay (MQ) setting using computational intelligence (CI) approaches. First, the study develops a mathematical model representing a real port environment and then adapts the cuckoo search algorithm (CSA) for the first time in this setup. The CSA is inspired by nature by following the basic rules of breeding parasitism of some cuckoo species that lay eggs in other birds’ nests. For comparison purposes, we implement two baseline approaches, first come first serve and exact MILP, and two CI approaches, particle swarm optimization (PSO) and genetic algorithm (GA), that are typically used to solve such complex or NP-hard problems. Performance assessment is carried out via a comprehensive series of experiments using real-world data. Experimental findings show that the MILP method can address the problems only when a small dataset is employed. In contrast, the newly adapted CSA can solve larger instances of MQ BAP and QCAP within significantly reduced computation times.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Marine Science and Engineering
Journal of Marine Science and Engineering Engineering-Ocean Engineering
CiteScore
4.40
自引率
20.70%
发文量
1640
审稿时长
18.09 days
期刊介绍: Journal of Marine Science and Engineering (JMSE; ISSN 2077-1312) is an international, peer-reviewed open access journal which provides an advanced forum for studies related to marine science and engineering. It publishes reviews, research papers and communications. Our aim is to encourage scientists to publish their experimental and theoretical results in as much detail as possible. There is no restriction on the length of the papers. The full experimental details must be provided so that the results can be reproduced. Electronic files and software regarding the full details of the calculation or experimental procedure, if unable to be published in a normal way, can be deposited as supplementary electronic material.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信