Results 181 to 190 of about 6,996,313 (215)
Some of the next articles are maybe not open access.
Selecting algorithms for large berth allocation problems
European Journal of Operational Research, 2020This paper considers algorithm selection for the berth allocation problem (BAP) under algorithmruntime limits. BAP consists in scheduling ships on berths subject to ship ready times and sizeconstraints, for a certain objective function. For the purposes of strategic port capacity planning,BAP must be solved many times in extensive simulations, needed ...
Jakub Wawrzyniak +2 more
openaire +2 more sources
POPMUSIC as a matheuristic for the berth allocation problem
Annals of Mathematics and Artificial Intelligence, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eduardo Lalla-Ruiz, Stefan Voß 0001
openaire +4 more sources
Models and Tabu Search Heuristics for the Berth-Allocation Problem
Transportation Science, 2005In the berth-allocation problem (BAP) the aim is to optimally schedule and assign ships to berthing areas along a quay. The objective is the minimization of the total (weighted) service time for all ships, defined as the time elapsed between the arrival in the harbor and the completion of handling.
Pasquale Legato +2 more
exaly +5 more sources
Fuzziness in the Berth Allocation Problem
2018The berth allocation problem (BAP) in a marine terminal container is defined as the feasible berth allocation to the incoming vessels. In this work, we present two models of fuzzy optimization for the continuous and dynamic BAP. The arrival time of vessels are assumed to be imprecise, meaning that the vessel can be late or early up to a threshold ...
Flabio Gutiérrez +3 more
openaire +2 more sources
A stochastic beam search for the berth allocation problem
Decision Support Systems, 2007In this paper, the optimization of the Berth Allocation Problem (BAP) is transformed into a multiple stage decision making procedure and a new multiple stage search method, namely stochastic beam search algorithm, is proposed to solve it. New techniques such as an improved beam search scheme, a two-phase node goodness estimation, and a stochastic node ...
Fan Wang 0003, Andrew Lim 0001
openaire +2 more sources
Particle Swarm Optimization Algorithm for the Berth Allocation Problem
Expert Systems With Applications, 2014The berth allocation is one of the major container port optimization problems. In both port operator's and ocean carriers' perspective, the minimization of the time a ship at the berth may be considered as an objective with respect to port operations. This paper focuses on the discrete and dynamic berth allocation problem (BAP), which assigns ships to ...
Kun-Chih Wu, Ching-Jung Ting
exaly +3 more sources
The berth allocation problem: models and solution methods
OR Spectrum, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guan, YP, Cheung, RK
openaire +2 more sources
Towards a Matheuristic Approach for the Berth Allocation Problem
2014The Berth Allocation Problem aims at assigning and scheduling incoming vessels to berthing positions along the quay of a container terminal. This problem is a well-known optimization problem within maritime shipping. For solving it, we propose two POPMUSIC (Partial Optimization Metaheuristic Under Special Intensification Conditions) approaches that ...
Eduardo Aníbal Lalla-Ruiz +1 more
openaire +2 more sources
Improved sequential insertion heuristics for berth allocation problems
International Transactions in Operational Research, 2023AbstractBerth 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.
openaire +3 more sources
The discrete and dynamic berth allocation problem in bulk port
2019 6th International Conference on Control, Decision and Information Technologies (CoDIT), 2019The berth allocation problem (BAP) is one of the key decision problems at port terminals. It has been widely studied by many of research works. In this paper, the dynamic and discrete case of the BAP in a bulk port was studied, a mathematical model was proposed and solved using Cplex whose the objective is to minimize the total service time of berthed ...
Rokaya Lassoued, Abdelkarim Elloumi
openaire +2 more sources

