arrow
返回

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

delete2016-11-01
delete32
delete
OA
AI
S
Shuaian Wang
X
Xinchang Wang *
DOI:10.1016/j.trb.2016.08.003delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
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. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Bi-section search
Containership
Sailing speed
Bunker fuel
Transit time
Polynomial-time algorithm
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Transportation Research Part B-Methodological 封面图
Transportation Research Part B-Methodological
IF:
6.3
论文数:
3.6K
被引数:
1.9W

机构

H
hong kong polytechnic university
学者数:
3.0W
论文数: 4.1W
被引数: 921
M
mississippi state university
学者数:
7.4K
论文数: 6.9K
被引数: 70
引用论文

引用论文

err分享
err收藏
学者 查看更多内容