Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/113286
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studiesen_US
dc.creatorZhang, Ten_US
dc.creatorWang, Sen_US
dc.creatorXin, Xen_US
dc.date.accessioned2025-06-02T06:57:26Z-
dc.date.available2025-06-02T06:57:26Z-
dc.identifier.issn0191-2615en_US
dc.identifier.urihttp://hdl.handle.net/10397/113286-
dc.language.isoenen_US
dc.publisherPergamon Pressen_US
dc.rights© 2025 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).en_US
dc.rightsThe following publication Zhang, T., Wang, S., & Xin, X. (2025). Liner fleet deployment and slot allocation problem: A distributionally robust optimization model with joint chance constraints. Transportation Research Part B: Methodological, 197, 103236 is available at https://doi.org/10.1016/j.trb.2025.103236.en_US
dc.subjectDistributionally robust optimizationen_US
dc.subjectJoint chance constraintsen_US
dc.subjectLiner fleet planningen_US
dc.subjectOuter approximation algorithmen_US
dc.subjectSlot allocationen_US
dc.subjectTwo-stage optimizationen_US
dc.subjectUncertain demanden_US
dc.titleLiner fleet deployment and slot allocation problem : a distributionally robust optimization model with joint chance constraintsen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.volume197en_US
dc.identifier.doi10.1016/j.trb.2025.103236en_US
dcterms.abstractIn this paper, we address the classical liner fleet deployment and slot allocation joint optimization problem in the maritime field with uncertain container transportation demand. We relax the assumption in existing studies that the demand distribution function is known because container transportation demand is deeply affected by the world's economic and political landscape. With the help of advances in distributionally robust optimization theory, we develop a two-stage data-driven robust chance-constrained model. This distribution-free model requires only limited historical demand data as input and jointly optimizes the class (i.e., capacity) and number of liners assigned on each route and the scheme for allocating containers on each leg to maximize the profit (container transportation revenue minus fleet operating costs, voyage costs, and capital costs) of the liner company. The joint chance constraint in the model requires that the transportation demand of the contract shipper be satisfied with a pre-determined probability. We then reformulate the model as a second-order cone programming and design a customized algorithm to explore the global optimal solution based on the outer approximation algorithm framework. This paper can serve as a baseline distribution-free model for solving liner fleet deployment and slot allocation joint optimization problems.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationTransportation research. Part B, Methodological, July 2025, v. 197, 103236en_US
dcterms.isPartOfTransportation research. Part B, Methodologicalen_US
dcterms.issued2025-07-
dc.identifier.scopus2-s2.0-105004662061-
dc.identifier.eissn1879-2367en_US
dc.identifier.artn103236en_US
dc.description.validate202505 bchyen_US
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_TA-
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextNational Natural Science Foundation of Chinaen_US
dc.description.pubStatusPublisheden_US
dc.description.TAElsevier (2025)en_US
dc.description.oaCategoryTAen_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
1-s2.0-S0191261525000852-main.pdf2.33 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Google ScholarTM

Check

Altmetric


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