New hybrid genetic algorithms to solve dynamic berth allocation problem

ET Bacalhau, L Casacio, AT de Azevedo - Expert Systems with Applications, 2021 - Elsevier
Berth allocation problem (BAP) is concerned to assign ships to port terminal positions,
seeking to minimize the total service time and maximize the quay occupation. A dynamic …

A novel mathematical formulation for solving the dynamic and discrete berth allocation problem by using the Bee Colony Optimisation algorithm

LP Prencipe, M Marinelli - Applied Intelligence, 2021 - Springer
Berth allocation is one of the crucial points for efficient management of ports. This problem is
complex due to all possible combinations for assigning ships to available compatible berths …

Improved sequential insertion heuristics for berth allocation problems

F Rodrigues - International Transactions in Operational …, 2024 - Wiley Online Library
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 …

Minimum cost berth allocation problem in maritime logistics: new mixed integer programming models

BC Jos, M Harimanikandan, C Rajendran, H Ziegler - Sādhanā, 2019 - Springer
The berth allocation problem (BAP) involves decisions on how to allocate the berth space
and to sequence maritime vessels that are to be loaded and unloaded at a container …

[PDF][PDF] Variable neighborhood search methods for the dynamic minimum cost hybrid berth allocation problem

N Kovač, T Davidović, Z Stanimirović - Information Technology and Control, 2018 - itc.ktu.lt
This study considers the Dynamic Minimum Cost Hybrid Berth Allocation Problem
(DMCHBAP) with fixed handling times of vessels. The objective function to be minimized …

An Evaluation of First-Come, First-Served Scheduling in a Geometrically-Constrained Wet Bulk Terminal

HE Eisen, JE Van der Lei, J Zuidema, T Koch… - Frontiers in Future …, 2021 - frontiersin.org
In 2022, a new sea lock at IJmuiden is expected to open, permitting an increase in marine
traffic of larger ships from the sea to the port. In the interest of facilitating operations, we …

Metaheuristic approaches for the minimum cost hybrid berth allocation problem

N Kovač, Z Stanimirović, T Davidović - Modeling, computing and data …, 2018 - Springer
Abstract The Minimum Cost Hybrid Berth Allocation problem is defined as follows: for a
given list of vessels with fixed handling times, the appropriate intervals in berth and time …

[PDF][PDF] Stochastic simulation of an oil terminal to reduce the turnaround time of tankers through pipeline operability improvements

LR Leal - Proceedings of the Brazilian symposium on operations …, 2018 - researchgate.net
The amount of time oil tankers spend at offshore oil terminals is significant in the oil and gas
industry. As a consequence, associated costs are normally relevant. Hence, interventions in …

Population-based Metaheuristics for the Dynamic Minimum Cost Hybrid Berth Allocation Problem

N Kovač, T Davidović, Z Stanimirović - International Journal on …, 2021 - World Scientific
This study considers the Dynamic Minimum Cost Hybrid Berth Allocation Problem
(DMCHBAP) with fixed handling times of vessels. The objective function to be minimized …

[图书][B] Berth Scheduling at Seaports: Meta-Heuristics and Simulation

R Wang - 2018 - search.proquest.com
This research aims to develop realistic solutions to enhance the efficiency of port operations.
By conducting a comprehensive literature review on logistic problems at seaports, some …