Dynamic group transit scheme for corridor transit

O. Vanek, M. Pechoucek
{"title":"Dynamic group transit scheme for corridor transit","authors":"O. Vanek, M. Pechoucek","doi":"10.1109/ICMSAO.2013.6552597","DOIUrl":null,"url":null,"abstract":"Contemporary maritime piracy around the Horn of Africa presents a serious threat to the global shipping industry. A number of countermeasures were deployed to minimize the probability of a successful hijack, one of them being the establishment of the International Recommended Transit Corridor (IRTC). Currently, all ships transiting the Gulf of Aden are strongly recommended to follow the IRTC and take part in group transit schemes-prescribed schedules stating time of arrival to the beginning of the corridor and speed at which to sail through the corridor. These schedules are fixed in advance and do not take into account speeds and constraints of arriving ships. We propose dynamic grouping schemes, customized schedules for a group of arriving ships, which take into account speeds as well as positions of arriving ships. The problem of finding optimum grouping scheme for a group of arriving ships is formulated as a bi-objective mixed integer program, weighting the delay caused by the grouping scheme and the risk taken when sailing alone. We look for a set of Pareto optimal solutions and compare the dynamic grouping scheme with currently deployed fixed scheme. Results show an improvement over current grouping scheme with respect to the number of ships grouped as well as time saved.","PeriodicalId":339666,"journal":{"name":"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)","volume":"198 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMSAO.2013.6552597","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Contemporary maritime piracy around the Horn of Africa presents a serious threat to the global shipping industry. A number of countermeasures were deployed to minimize the probability of a successful hijack, one of them being the establishment of the International Recommended Transit Corridor (IRTC). Currently, all ships transiting the Gulf of Aden are strongly recommended to follow the IRTC and take part in group transit schemes-prescribed schedules stating time of arrival to the beginning of the corridor and speed at which to sail through the corridor. These schedules are fixed in advance and do not take into account speeds and constraints of arriving ships. We propose dynamic grouping schemes, customized schedules for a group of arriving ships, which take into account speeds as well as positions of arriving ships. The problem of finding optimum grouping scheme for a group of arriving ships is formulated as a bi-objective mixed integer program, weighting the delay caused by the grouping scheme and the risk taken when sailing alone. We look for a set of Pareto optimal solutions and compare the dynamic grouping scheme with currently deployed fixed scheme. Results show an improvement over current grouping scheme with respect to the number of ships grouped as well as time saved.
走廊运输的动态群运方案
当代非洲之角一带的海盗活动对全球航运业构成严重威胁。为尽量减少成功劫机的可能性,采取了若干对策,其中之一是建立国际建议过境走廊。目前,强烈建议所有通过亚丁湾的船只遵循IRTC并参加集体过境计划- -规定的时间表,说明到达走廊起点的时间和通过走廊的速度。这些时间表是事先确定的,没有考虑到到达船只的速度和限制。我们提出了动态分组方案,为一组到达的船舶定制时间表,该计划考虑到到达船舶的速度和位置。将一群到达的船舶寻找最优分组方案的问题表述为一个双目标混合整数规划问题,并对分组方案造成的延误和单独航行时所承担的风险进行加权。我们寻找一组Pareto最优解,并将动态分组方案与现有的固定方案进行比较。结果表明,与现有的分组方案相比,该方案在分组船舶数量和节省时间方面有所改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信