Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/66527
Title: A polynomial-time algorithm for sailing speed optimization with containership resource sharing
Authors: Wang, SA 
Wang, XC
Keywords: Bi-section search
Containership
Sailing speed
Bunker fuel
Transit time
Polynomial-time algorithm
Issue Date: 2016
Publisher: Pergamon Press
Source: Transportation research. Part B, Methodological, Nov. 2016, v. 94, part A, p. 394-405 How to cite?
Journal: Transportation research. Part B, Methodological 
Abstract: The sailing speed optimization problem aims to determine the optimal cruising speeds of ships by balancing the number of ships required on services, the fuel consumption, and the level of service provided for customers. The level of service can be incorporated into a sailing speed optimization model from the perspective of supply chain management or from the perspective of shipping lines. We design a polynomial-time algorithm workable to solve the two models based on bi-section search methods. The novelties of the algorithm include constructing a new parameter on which the bi-section search will be executed and deriving a near-optimal solution by taking advantage of the problem structure. We also provide theoretical results that guarantee the validity of the polynomial-time algorithm.
URI: http://hdl.handle.net/10397/66527
ISSN: 0191-2615
EISSN: 1879-2367
DOI: 10.1016/j.trb.2016.08.003
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

1
Citations as of Nov 17, 2017

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
Citations as of Nov 16, 2017

Page view(s)

33
Checked on Nov 12, 2017

Google ScholarTM

Check

Altmetric



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