Results 171 to 180 of about 825 (213)

Value of using artificial intelligence derived clusters by health and social care need in Primary Care: A qualitative interview study

open access: yes
Holt S   +9 more
europepmc   +1 more source

On the Berth Allocation Problem [PDF]

open access: yesRAIRO - Operations Research, 2016
Summary: The rapid growth of the maritime industry has created a need for improvement in container terminal operations, by effectively utilizing the available resources. One of the most important seaside planning problems that has received considerable attention in the literature is the assignment of quay space to vessels, commonly referred to as the ...
Shaikha Ahmed Jumaa Alzaabi, Ali Diabat
openaire   +3 more sources

The Dynamic Berth Allocation Problem: A linearized formulation [PDF]

open access: yesRAIRO - Operations Research, 2015
Summary: International shipping is a multi-billion dollar business which has undergone significant growth during the last decade. Considerable benefits could be gained by improving and optimizing container terminal operations. One specific challenge facing container terminals is the berth allocation problem, referred to as (BAP).
Ahmed S. Simrin, Ali H. Diabat
openaire   +3 more sources

Clustering Search for the Berth Allocation Problem

Expert Systems With Applications, 2012
This work presents a new approach to the Berth Allocation Problem (BAP) for ships in ports. Due to the increasing demand for ships carrying containers, the BAP can be considered as a major optimization problem in marine terminals. In this paper, the BAP is considered as dynamic and modeled in discrete case and we propose a new alternative to solve it ...
Rudinei Martins De Oliveira   +2 more
exaly   +2 more sources

Models and Tabu Search Heuristics for the Berth-Allocation Problem

Transportation Science, 2005
In 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.
Jean-François Cordeau   +2 more
exaly   +4 more sources

Particle swarm optimization algorithm for the berth allocation problem

Expert Systems With Applications, 2014
The 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 ...
Ching-Jung Ting, Kun-Chih Wu
exaly   +2 more sources

The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach

Transportation Science, 2007
The berth allocation problem is one of the most relevant logistics problems arising in the management of container ports. Depending on assumptions made on the berthing location policy, two classes of the berth allocation problem have been considered in literature: the discrete case and the continuous case. In this paper, the properties of the discrete
Maria Flavia Monaco, Marcello Sammarra
exaly   +2 more sources

Models for the discrete berth allocation problem: A computational comparison

open access: yesTransportation Research, Part E: Logistics and Transportation Review, 2011
In this paper we consider the problem of allocating arriving ships to discrete berth locations at container terminals. This problem is recognized as one of the most important processes for any container terminal.
Stefan Ropke   +2 more
exaly   +2 more sources

Policy Optimization for Berth Allocation Problems

2021 International Joint Conference on Neural Networks (IJCNN), 2021
This paper investigates the policy optimization paradigm, where a learning model is trained to find the solution of complex Markov decision problems, as a tool to address the berth allocation problem in multimodal terminals. To this purpose, we drop the typical formulation of the latter as a mixed-integer static scheduling one, and we model it instead ...
C Cervellera, M Gaggero, D Maccio
openaire   +2 more sources

Selecting algorithms for large berth allocation problems

European Journal of Operational Research, 2020
This 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

Home - About - Disclaimer - Privacy