返回
A polynomial-time algorithm for sailing speed optimization with containership resource sharing
DOI:10.1016/j.trb.2016.08.003.png)
摘要
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总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
3.6K
被引数:
1.9W
机构
引用论文
Ship speed optimization: Concepts, models and combined speed-routing scenarios船舶速度优化: 概念,模型和组合的速度-路线方案
Fundamental properties and pseudo-polynomial-time algorithm for network containership sailing speed optimization网络集装箱船航行速度优化的基本性质和伪多项式时间算法
An epsilon-optimal algorithm considering greenhouse gas emissions for the management of a ship's bunker fuel考虑温室气体排放的epsilon最优算法,用于船舶燃料的管理
A flexible and wearable energy harvester with an efficient and fast-converging analog MPPT一种灵活且可穿戴的能量采集器,具有高效且快速收敛的模拟MPPT

