Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/90639
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | en_US |
dc.contributor | Chinese Mainland Affairs Office | en_US |
dc.creator | Wu, L | en_US |
dc.creator | Pan, K | en_US |
dc.creator | Wang, S | en_US |
dc.creator | Yang, D | en_US |
dc.date.accessioned | 2021-08-09T01:55:44Z | - |
dc.date.available | 2021-08-09T01:55:44Z | - |
dc.identifier.issn | 0191-2615 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/90639 | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_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 http://creativecommons.org/licenses/by-nc-nd/4.0/. | en_US |
dc.rights | The following publication Wu, L., Pan, K., Wang, S., & Yang, D. (2018). Bulk ship scheduling in industrial shipping with stochastic backhaul canvassing demand. Transportation Research Part B: Methodological, 117, 117-136 is available at https://doi.org/10.1016/j.trb.2018.08.016. | en_US |
dc.subject | Industrial shipping | en_US |
dc.subject | Bulk ship scheduling | en_US |
dc.subject | Stochastic optimization | en_US |
dc.subject | Dynamic programming | en_US |
dc.subject | Benders decomposition | en_US |
dc.title | Bulk ship scheduling in industrial shipping with stochastic backhaul canvassing demand | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 117 | en_US |
dc.identifier.epage | 136 | en_US |
dc.identifier.volume | 117 | en_US |
dc.identifier.doi | 10.1016/j.trb.2018.08.016 | en_US |
dcterms.abstract | This paper studies a ship scheduling problem for an industrial corporation that manages a fleet of bulk ships under stochastic environments. The considered problem is an integration of three interconnected sub-problems from different planning levels: the strategic fleet sizing and mix problem, the tactical voyage planning problem, and the operational stochastic backhaul cargo canvassing problem. To obtain the optimal solution of the problem, this paper provides a two-step algorithmic scheme. In the first step, the stochastic backhaul cargo canvassing problem is solved by a dynamic programming (DP) algorithm, leading to optimal canvassing strategies for all feasible voyages of all ships. In the second step, a mixed-integer programming (MIP) model that jointly solves the fleet sizing and mix problem and the voyage planning problem is formulated using the results from the first step. To efficiently solve the proposed MIP model, this paper develops a tailored Benders decomposition method. Finally, extensive numerical experiments are conducted to demonstrate the applicability and efficiency of the proposed models and solution methods for practical instances. | en_US |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Transportation research. Part B, Methodological, Nov. 2018, v. 117, pt. A, p. 117-136 | en_US |
dcterms.isPartOf | Transportation research. Part B, Methodological | en_US |
dcterms.issued | 2018-11 | - |
dc.identifier.eissn | 1879-2367 | en_US |
dc.description.validate | 202108 bcrc | en_US |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | a0791-n09 | - |
dc.identifier.SubFormID | 1694 | - |
dc.description.fundingSource | Others | en_US |
dc.description.fundingText | P0008706 | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
a0791-n09_1694.pdf | Pre-Published version | 1.14 MB | Adobe PDF | View/Open |
Page views
71
Last Week
1
1
Last month
Citations as of May 12, 2024
Downloads
72
Citations as of May 12, 2024
SCOPUSTM
Citations
9
Citations as of May 17, 2024
WEB OF SCIENCETM
Citations
8
Citations as of May 16, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.