Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/89969
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studiesen_US
dc.creatorJia, Sen_US
dc.creatorLi, CLen_US
dc.creatorXu, Zen_US
dc.date.accessioned2021-05-13T08:33:06Z-
dc.date.available2021-05-13T08:33:06Z-
dc.identifier.issn0041-1655en_US
dc.identifier.urihttp://hdl.handle.net/10397/89969-
dc.language.isoenen_US
dc.publisherInstitute for Operations Research and the Management Sciencesen_US
dc.rightsCopyright © 2019, INFORMSen_US
dc.subjectAnchorage areasen_US
dc.subjectLagrangian relaxationen_US
dc.subjectNavigation channelsen_US
dc.subjectPort operationsen_US
dc.subjectVessel traffic serviceen_US
dc.titleManaging navigation channel traffic and anchorage area utilization of a container porten_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage728en_US
dc.identifier.epage745en_US
dc.identifier.volume53en_US
dc.identifier.issue3en_US
dc.identifier.doi10.1287/trsc.2018.0879en_US
dcterms.abstractNavigation 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.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationTransportation science, May-June 2019, v. 53, no. 3, p. 728-745en_US
dcterms.isPartOfTransportation scienceen_US
dcterms.issued2019-05-
dc.identifier.scopus2-s2.0-85067912751-
dc.description.validate202105 bcvcen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumbera0831-n05, a0986-n01-
dc.identifier.SubFormID1941, 2345-
dc.description.fundingSourceOthersen_US
dc.description.fundingTextPolyU G-YBUGen_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
2345_87.pdfPre-Published version650.26 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

105
Last Week
0
Last month
Citations as of Apr 14, 2025

Downloads

108
Citations as of Apr 14, 2025

SCOPUSTM   
Citations

78
Citations as of Dec 19, 2025

WEB OF SCIENCETM
Citations

50
Citations as of Oct 10, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.