考虑电池电动船的航运船队规模与构成问题的凸规划
Convex Formulation of the Maritime Fleet Size and Mix Problem Considering Battery Electric Ships
AI总结:
本文提出了一种考虑电池电动船的航运船队规模与构成问题的凸规划方法,通过直接建模非线性特性,实现了更低的船队成本和更短的求解时间。
摘要:
本文聚焦于确定给定航运运营的最小成本电池电动船船队的问题。该问题具有强烈的非线性特征,并包含整数变量决策变量,这使得大多数实际案例难以处理。文献中的传统方法是通过限制可用船型为少量预设替代方案来构建线性近似。与传统线性化方法相反,本文直接建模非线性特性。我们证明该问题具有隐藏的凸结构,通过变量变换得以揭示。计算实验显示,我们的凸规划在平均船队成本上降低了15.1%,并且相比线性规划将求解时间减少了至少10倍。求解时间的优势归因于消除了与船型选择相关的二进制变量。我们的实现可在https://users.aalto.fi/~aritari/convex_ESFSMP.html获取。
英文摘要:
This paper focuses on the problem of determining a minimum-cost fleet of battery electric ships for a given liner shipping operation. The problem is strongly nonlinear and includes integer-valued decision variables, which make it intractable for most real-world instances. The conventional approach in the literature is to formulate a linear approximation by restricting available ship types to a small number of predetermined alternatives. Contrary to the conventional linearization approach, this paper models the nonlinearities directly. We show that the problem exhibits a hidden convex structure uncovered by changes of variables. Computational experiments show that our convex formulation achieves 15.1\% lower fleet cost on average and reduces the solve time by at least 10x compared to the linear formulation. The solve time advantage is attributed to the elimination of binary variables associated with ship type selection. Our implementation is available at https://users.aalto.fi/~aritari/convex_ESFSMP.html.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。