Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/98286
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studiesen_US
dc.creatorLi, Fen_US
dc.creatorYang, Den_US
dc.creatorWang, Sen_US
dc.creatorWeng, Jen_US
dc.date.accessioned2023-04-27T01:04:32Z-
dc.date.available2023-04-27T01:04:32Z-
dc.identifier.issn1366-5545en_US
dc.identifier.urihttp://hdl.handle.net/10397/98286-
dc.language.isoenen_US
dc.publisherPergamon Pressen_US
dc.rights© 2018 Elsevier Ltd. All rights reserved.en_US
dc.rights© 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/.en_US
dc.rightsThe following publication Li, F., Yang, D., Wang, S., & Weng, J. (2019). Ship routing and scheduling problem for steel plants cluster alongside the Yangtze River. Transportation Research Part E: Logistics and Transportation Review, 122, 198-210 is available at https://doi.org/10.1016/j.tre.2018.12.001.en_US
dc.subjectBulk shippingen_US
dc.subjectDynamic programming algorithmen_US
dc.subjectScenario analysisen_US
dc.subjectShip routing and scheduling optimizationen_US
dc.titleShip routing and scheduling problem for steel plants cluster alongside the Yangtze Riveren_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage198en_US
dc.identifier.epage210en_US
dc.identifier.volume122en_US
dc.identifier.doi10.1016/j.tre.2018.12.001en_US
dcterms.abstractThis paper aims to provide an optimal shipping schedule for steel-manufacturing plants cluster alongside the Yangtze River by developing a mixed integer programming formulation. The model takes into account the multi-layer shipping network on the Yangtze River, the dynamic iron ore price and transportation costs, and the timely demands of steel plants over multiple periods. By applying the proposed model to a real-world case, several interesting findings are observed, leading to further useful managerial insights. We also propose an exact solution approach based on a dynamic programming algorithm to a special case of this problem motivated by real-world practice.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationTransportation research. Part E, Logistics and transportation review, Feb. 2019, v. 122, p. 198-210en_US
dcterms.isPartOfTransportation research. Part E, Logistics and transportation reviewen_US
dcterms.issued2019-02-
dc.identifier.scopus2-s2.0-85058547738-
dc.identifier.eissn1878-5794en_US
dc.description.validate202304 bckwen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberLMS-0239-
dc.description.fundingSourceOthersen_US
dc.description.fundingTextNational Natural Science Foundation of China; National Science Foundation for Young Scientists of China; Key Program of National Natural Science Foundation of China; Hong Kong Polytechnic Universityen_US
dc.description.pubStatusPublisheden_US
dc.identifier.OPUS24391155-
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Yang_Ship_Routing_Scheduling.pdfPre-Published version1.4 MBAdobe 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

66
Citations as of Apr 14, 2025

Downloads

75
Citations as of Apr 14, 2025

SCOPUSTM   
Citations

33
Citations as of Dec 19, 2025

WEB OF SCIENCETM
Citations

24
Citations as of Oct 10, 2024

Google ScholarTM

Check

Altmetric


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