返回
Improved sequential insertion heuristics for berth allocation problems
DOI:10.1111/itor.13369.png)
摘要
En 中文
Berth allocation decisions affect all subsequent decisions in port terminals. Thus assigning berthing positions and berthing times to vessels-known as the berth allocation problem (BAP)-is one of the most important problems in port terminals. Because this is an NP-hard problem, most of the solution methods proposed for solving it are heuristics. Although very different, some heuristics applied to the continuous BAP share a common step usually performed several times: the insertion of vessels from an insertion sequence in the time-space diagram that represents a BAP solution. This process is frequently done by using minimum cost sequential insertion heuristics such as bottom-left-based heuristics. Although fast and simple, these heuristics may not lead to high-quality solutions. In this paper, we propose improved sequential insertion heuristics that generally outperform the traditional ones and keep their simplicity and speed. The proposed heuristics are tested on a large set of instances of BAPs with different optimization objectives, and the obtained results show that they can lead to solutions up to 70% better than those obtained by traditional sequential insertion heuristics.
Keyword:
bottom-left heuristic
berth allocation problem
insertion heuristic
insertion sequence
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
Exact and heuristic methods for the berth allocation problem with multiple continuous quays in tidal bulk terminals潮汐散货码头多个连续码头泊位分配问题的精确和启发式方法
A blockchain-based framework to optimize shipping container flows in the hinterland一个基于区块链的框架来优化腹地的航运集装箱流量
The effect of 3-nitropropionic acid on behavioral dysfunction, neuron loss and gliosis in the brain of adult male rats: The case of prefrontal cortex, hippocampus and the cerebellum
Toxicon
IF0

