Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/98350
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Logistics and Maritime Studies | en_US |
| dc.creator | Zhen, L | en_US |
| dc.creator | Wang, S | en_US |
| dc.creator | Zhuge, D | en_US |
| dc.date.accessioned | 2023-04-27T01:04:58Z | - |
| dc.date.available | 2023-04-27T01:04:58Z | - |
| dc.identifier.issn | 1366-5545 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10397/98350 | - |
| dc.language.iso | en | en_US |
| dc.publisher | Pergamon Press | en_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.rights | The 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.subject | Dynamic programming | en_US |
| dc.subject | Liner shipping | en_US |
| dc.subject | Maritime transportation | en_US |
| dc.subject | Optimal control | en_US |
| dc.title | Dynamic programming for optimal ship refueling decision | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.spage | 63 | en_US |
| dc.identifier.epage | 74 | en_US |
| dc.identifier.volume | 100 | en_US |
| dc.identifier.doi | 10.1016/j.tre.2016.12.013 | en_US |
| dcterms.abstract | This 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.accessRights | open access | en_US |
| dcterms.bibliographicCitation | Transportation research. Part E, Logistics and transportation review, Apr. 2017, v. 100, p. 63-74 | en_US |
| dcterms.isPartOf | Transportation research. Part E, Logistics and transportation review | en_US |
| dcterms.issued | 2017-04 | - |
| dc.identifier.scopus | 2-s2.0-85013278387 | - |
| dc.identifier.eissn | 1878-5794 | en_US |
| dc.description.validate | 202304 bckw | en_US |
| dc.description.oa | Accepted Manuscript | en_US |
| dc.identifier.FolderNumber | LMS-0414 | - |
| dc.description.fundingSource | Others | en_US |
| dc.description.fundingText | National Natural Science Foundation of China; Program for Professor of Special Appointment (Eastern Scholar) at Shanghai Institutions of Higher Learning; Shanghai Social Science Research Program | en_US |
| dc.description.pubStatus | Published | en_US |
| dc.identifier.OPUS | 6724337 | - |
| dc.description.oaCategory | Green (AAM) | en_US |
| Appears in Collections: | Journal/Magazine Article | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Wang_Dynamic_Programming_Optimal.pdf | Pre-Published version | 1.11 MB | Adobe PDF | View/Open |
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.



