Geodesic
The Dynamic Berth Allocation Problem: A linearized formulation
Simrin, Ahmed1 ; Diabat, Ali1
1 Department of Engineering Systems & Management, Masdar Institute of Science & Technology, Abu Dhabi, United Arab Emirates.
RAIRO - Operations Research - Recherche Opérationnelle, Tome 49 (2015) no. 3, pp. 473-494

Voir la notice de l'article provenant de la source Numdam

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). In this paper, a new formulation is proposed for the dynamic berth allocation problem (DBAP). Initially the problem was formulated as a non-linear mixed integer program, followed by incorporating techniques to present an equivalent mixed integer program (MIP). A genetic algorithm (GA) heuristic was developed and applied to different instances of the problems, and through computational experiments the best, average, and worst case performances were analyzed to determine the efficiency of the algorithms.

Reçu le :
Accepté le :
DOI : 10.1051/ro/2014039
Classification : 90Bxx
Keywords: Container terminal, linear program, non-linear program, dynamic berth allocation

Simrin, Ahmed 1 ; Diabat, Ali 1

1 Department of Engineering Systems & Management, Masdar Institute of Science & Technology, Abu Dhabi, United Arab Emirates. 
@article{RO_2015__49_3_473_0,
     author = {Simrin, Ahmed and Diabat, Ali},
     title = {The {Dynamic} {Berth} {Allocation} {Problem:} {A} linearized formulation},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {473--494},
     publisher = {EDP-Sciences},
     volume = {49},
     number = {3},
     year = {2015},
     doi = {10.1051/ro/2014039},
     mrnumber = {3349130},
     zbl = {1322.90022},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2014039/}
}
TY  - JOUR
AU  - Simrin, Ahmed
AU  - Diabat, Ali
TI  - The Dynamic Berth Allocation Problem: A linearized formulation
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2015
SP  - 473
EP  - 494
VL  - 49
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ro/2014039/
DO  - 10.1051/ro/2014039
LA  - en
ID  - RO_2015__49_3_473_0
ER  - 
%0 Journal Article
%A Simrin, Ahmed
%A Diabat, Ali
%T The Dynamic Berth Allocation Problem: A linearized formulation
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2015
%P 473-494
%V 49
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ro/2014039/
%R 10.1051/ro/2014039
%G en
%F RO_2015__49_3_473_0
Simrin, Ahmed; Diabat, Ali. The Dynamic Berth Allocation Problem: A linearized formulation. RAIRO - Operations Research - Recherche Opérationnelle, Tome 49 (2015) no. 3, pp. 473-494. doi: 10.1051/ro/2014039

Cité par Sources :