Managing Navigation Channel Traffic and Anchorage Area Utilization of a Container Port

Shuai Jia, Chung-Lun Li, Zhou Xu
{"title":"Managing Navigation Channel Traffic and Anchorage Area Utilization of a Container Port","authors":"Shuai Jia, Chung-Lun Li, Zhou Xu","doi":"10.1287/TRSC.2018.0879","DOIUrl":null,"url":null,"abstract":"Navigation channels are fairways for vessels to travel in and out of the terminal basin of a container port. The capacity of a navigation channel is restricted by the number of traffic lanes and safety clearance of vessels, and the availability of a navigation channel is usually affected by tides. The limited capacity and availability of a navigation channel could lead to congestion in the terminal basin. When the navigation channels run out of capacity, the anchorage areas in the terminal basin could serve as a buffer. This paper aims to develop a mathematical model that simultaneously optimizes the navigation channel traffic and anchorage area utilization. We provide a mixed integer programming formulation of the problem, analyze its complexity, and propose a Lagrangian relaxation heuristic in which the relaxed problem is decomposed into two asymmetric assignment problems. Computational performance of the Lagrangian relaxation heuristic is tested on problem instances generated based on the operational data of a port in Shanghai. Computational results show that the proposed heuristic is able to achieve satisfactory performance within a reasonable computation time. Data files and the online appendix are available at https://doi.org/10.1287/trsc.2018.0879 .","PeriodicalId":243859,"journal":{"name":"Logistics eJournal","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"46","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Logistics eJournal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/TRSC.2018.0879","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 46

Abstract

Navigation channels are fairways for vessels to travel in and out of the terminal basin of a container port. The capacity of a navigation channel is restricted by the number of traffic lanes and safety clearance of vessels, and the availability of a navigation channel is usually affected by tides. The limited capacity and availability of a navigation channel could lead to congestion in the terminal basin. When the navigation channels run out of capacity, the anchorage areas in the terminal basin could serve as a buffer. This paper aims to develop a mathematical model that simultaneously optimizes the navigation channel traffic and anchorage area utilization. We provide a mixed integer programming formulation of the problem, analyze its complexity, and propose a Lagrangian relaxation heuristic in which the relaxed problem is decomposed into two asymmetric assignment problems. Computational performance of the Lagrangian relaxation heuristic is tested on problem instances generated based on the operational data of a port in Shanghai. Computational results show that the proposed heuristic is able to achieve satisfactory performance within a reasonable computation time. Data files and the online appendix are available at https://doi.org/10.1287/trsc.2018.0879 .
集装箱港口航道交通管理与锚地利用
航道是船舶进出集装箱港口码头池的航道。航道的容量受航道数目和船只安全过关的限制,而航道的可用性通常受潮汐的影响。航道的容量和可用性有限,可能导致终端池的拥塞。当航道容量不足时,码头流域的锚地可以起到缓冲作用。本文旨在建立同时优化航道交通和锚地利用的数学模型。给出了该问题的混合整数规划形式,分析了其复杂性,提出了一种拉格朗日松弛启发式方法,将松弛问题分解为两个不对称分配问题。以上海某港口运行数据为例,对拉格朗日松弛启发式算法的计算性能进行了测试。计算结果表明,所提出的启发式算法能够在合理的计算时间内获得满意的性能。数据文件和在线附录可在https://doi.org/10.1287/trsc.2018.0879上获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信