A polynomial-time algorithm for sailing speed optimization with containership resource sharing

•We formulate the containership sailing speed optimization problem as a mathematical programming model from the perspective of shipping lines.•We develop a polynomial-time algorithm to solve the problem based on bi-section search methods.•We test our algorithm with numerical experiments. The sailing...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Transportation research. Part B: methodological Ročník 93; s. 394 - 405
Hlavní autori: Wang, Shuaian, Wang, Xinchang
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Oxford Elsevier Ltd 01.11.2016
Elsevier Science Ltd
Predmet:
Algorithms
Bi-section search
Bunker fuel
Cargo ships
Consumer goods
Consumption
Container ships
Containership
Customers
Fuel consumption
Fuels
Mathematical models
Optimization
Polynomial-time algorithm
Polynomials
Sailing
Sailing speed
Shipping
Ships
Supply chain management
Supply chains
Transit time
Transportation
Velocity
Polynomial-time algorithm
Sailing speed
Bunker fuel
Transit time
Containership
Bi-section search
ISSN:0191-2615, 1879-2367
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:•We formulate the containership sailing speed optimization problem as a mathematical programming model from the perspective of shipping lines.•We develop a polynomial-time algorithm to solve the problem based on bi-section search methods.•We test our algorithm with numerical experiments. 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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0191-2615
1879-2367
DOI:10.1016/j.trb.2016.08.003