Results 11 to 20 of about 825 (213)
Simulation-Optimization Models for the Dynamic Berth Allocation Problem [PDF]
Container terminals are designed to provide support for the continuous changes in container ships. The most common schemes used for dock management are based on discrete and continuous locations. In view of the steadily growing trend in increasing container ship size, more flexible berth allocation planning is ...
Carlos Arango +3 more
openaire +5 more sources
Integrated Laycan and Berth Allocation Problem [PDF]
Handling vessels within the agreed time limits at a port with an optimal exploitation of its quays plays an important role in the improvement of port effectiveness as it reduces the stay time of vessels and avoids the payment of contractual penalties to shipowners due to the overrun of laytimes.
Bouzekri, Hamza +2 more
openaire +3 more sources
Modeling and solving the Tactical Berth Allocation Problem [PDF]
In this paper we integrate at the tactical level two decision problems arising in container terminals: the berth allocation problem, which consists of assigning and scheduling incom- ing ships to berthing positions, and the quay crane assignment problem, which assigns to incoming ships a certain quay crane profile (i.e.
GIALLOMBARDO, Giovanni +3 more
openaire +5 more sources
Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem [PDF]
Decision makers must face the dynamism and uncertainty of real‐world environments when they need to solve the scheduling problems. Different incidences or breakdowns, for example, initial data could change or some resources could become unavailable, may eventually cause the infeasibility of the obtained schedule.
Rodríguez Molins, Mario +2 more
openaire +5 more sources
Priority control of berth allocation problem in container terminals [PDF]
AbstractThis paper presents a decision support system for the core problem of berth allocation decision in a container terminal. The allocation of berths to the calling vessels is complex with the fact that different service level requirements are required for different vessels. Terminal managers demand for effective decision support systems that would
Ursavas, Evrim, Evrim Ursavas
openaire +3 more sources
Algorithm Design for an Online Berth Allocation Problem
In this paper, we investigate an online berth allocation problem, where vessels arrive one by one and their information is revealed upon arrival. Our objective is to design online algorithms to minimize the maximum load of all berths (makespan). We first
Cong Chen +4 more
doaj +2 more sources
Enhanced Ant Colony Algorithm for Discrete Dynamic Berth Allocation in a Case Container Terminal
Berth allocation is a critical concern in container terminal port logistics, involving the precise determination of where and when arriving vessels should dock along a quay.
Meng Yu +3 more
doaj +1 more source
An Efficient Procedure for Inserting Buffers to Generate Robust Berth Plans in Container Terminals
Uncertainty is an inevitable aspect of seaside operations in container terminals. Operators therefore need to find robust plans that can resist the impact of uncertainties.
Yangcan Wu, Lixin Miao
doaj +1 more source
In this paper, we study the static discrete berth allocation problems (BAPs) for large-scale time-critical marine-loading scenarios. The objective is to allocate the vessels to different types of berths so that all the vessels can be loaded within the ...
Dong Yin +3 more
doaj +1 more source
Berths and yards are the most critical parts of container terminals. Their efficiency directly influences the terminal operation efficiency. The multi-period coordinated optimization on berth allocation and yard assignment has been studied considering a ...
Wenwen Guo, Mingjun Ji, Huiling Zhu
doaj +1 more source

