Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/98350
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studiesen_US
dc.creatorZhen, Len_US
dc.creatorWang, Sen_US
dc.creatorZhuge, Den_US
dc.date.accessioned2023-04-27T01:04:58Z-
dc.date.available2023-04-27T01:04:58Z-
dc.identifier.issn1366-5545en_US
dc.identifier.urihttp://hdl.handle.net/10397/98350-
dc.language.isoenen_US
dc.publisherPergamon Pressen_US
dc.rights© 2017 Elsevier Ltd. All rights reserved.en_US
dc.rights© 2017. 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 Zhen, L., Wang, S., & Zhuge, D. (2017). Dynamic programming for optimal ship refueling decision. Transportation Research Part E: Logistics and Transportation Review, 100, 63-74 is available at https://doi.org/10.1016/j.tre.2016.12.013.en_US
dc.subjectDynamic programmingen_US
dc.subjectLiner shippingen_US
dc.subjectMaritime transportationen_US
dc.subjectOptimal controlen_US
dc.titleDynamic programming for optimal ship refueling decisionen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage63en_US
dc.identifier.epage74en_US
dc.identifier.volume100en_US
dc.identifier.doi10.1016/j.tre.2016.12.013en_US
dcterms.abstractThis study investigates an optimal control policy for a liner ship to decide at which ports and how much fuel the liner ship should be refueled under stochastic fuel consumption in each leg and stochastic fuel price at each port. Based on some properties proved in this study, a dynamic programming algorithm is then designed to obtain some important threshold values, which are used in the optimal control policy for ship refueling decision. Extensive experiments show that the proposed method can obtain the optimal decision within a reasonable time (about 170 s) for various scales of problem instances (up to 30 ports) as well as various settings of probability distributions. In addition, some comparative experiments also show that the proposed optimal decision policy can save at least 8% fuel consumption cost by comparing with some relatively simple rules and save about 1% cost on average by comparing with some brilliantly-designed rules.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationTransportation research. Part E, Logistics and transportation review, Apr. 2017, v. 100, p. 63-74en_US
dcterms.isPartOfTransportation research. Part E, Logistics and transportation reviewen_US
dcterms.issued2017-04-
dc.identifier.scopus2-s2.0-85013278387-
dc.identifier.eissn1878-5794en_US
dc.description.validate202304 bckwen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberLMS-0414-
dc.description.fundingSourceOthersen_US
dc.description.fundingTextNational Natural Science Foundation of China; Program for Professor of Special Appointment (Eastern Scholar) at Shanghai Institutions of Higher Learning; Shanghai Social Science Research Programen_US
dc.description.pubStatusPublisheden_US
dc.identifier.OPUS6724337-
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Wang_Dynamic_Programming_Optimal.pdfPre-Published version1.11 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

71
Citations as of Apr 14, 2025

Downloads

153
Citations as of Apr 14, 2025

SCOPUSTM   
Citations

33
Citations as of Dec 19, 2025

WEB OF SCIENCETM
Citations

21
Citations as of Oct 10, 2024

Google ScholarTM

Check

Altmetric


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