Optimization of inland shipping
Optimization of inland shipping
复制标题
DOI：
10.1007/s10951-013-0364-7
复制
发表时间：
2014-08
影响因子：
2
通讯作者：
J. Hermans
中科院分区：
文献类型：
--
作者：
J. Hermans
在这篇文章中，我们探索了与内河航运中使用的船闸优化有关的问题和算法。我们定义了几个与内河航运相关的优化问题。我们证明了，如果允许多艘船通过同一船闸作业，则船闸调度问题是NP-难的。然而，单船闸优化问题可以在多项式时间内求解，本文提出了一种新的求解该问题的确定性调度算法。
In this paper, we explore problems and algorithms related to the optimisation of locks, as used in inland shipping. We define several optimisation problems associated with inland shipping. We prove that the problem of scheduling a lock is NP-hard if one allows multiple ships to go through in the same lock operation. The single-ship lock optimization problem can, however, be solved in polynomial time and a novel deterministic scheduling algorithm for solving this problem is presented in this paper.