The Dynamic Berth Allocation Problem: A linearized formulation
RAIRO-Oper. Res., 49 3 (2015) 473-494
Published online: 2015-02-06
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
A survey on computational intelligence approaches for intelligent marine terminal operations
Sheraz Aslam, Michalis P. Michaelides and Herodotos HerodotouIET Intelligent Transport Systems 18 (5) 755 (2024)
https://doi.org/10.1049/itr2.12469
An improved genetic algorithm for the berth scheduling with ship-to-ship transshipment operations integrated model
Marwa Al Samrout, Abdelkader Sbihi and Adnan YassineComputers & Operations Research 161 106409 (2024)
https://doi.org/10.1016/j.cor.2023.106409
Enhanced Ant Colony Algorithm for Discrete Dynamic Berth Allocation in a Case Container Terminal
Meng Yu, Yaqiong Lv, Yuhang Wang and Xiaojing JiJournal of Marine Science and Engineering 11 (10) 1931 (2023)
https://doi.org/10.3390/jmse11101931
Enhanced Berth Allocation Using the Cuckoo Search Algorithm
Sheraz Aslam, Michalis P. Michaelides and Herodotos HerodotouSN Computer Science 3 (4) (2022)
https://doi.org/10.1007/s42979-022-01211-z
The impact of time windows constraints on metaheuristics implementation: a study for the Discrete and Dynamic Berth Allocation Problem
Flávia Barbosa, Priscila C. Berbert Rampazzo, Anibal Tavares de Azevedo and Akebo YamakamiApplied Intelligence (2021)
https://doi.org/10.1007/s10489-021-02420-4
A novel mathematical formulation for solving the dynamic and discrete berth allocation problem by using the Bee Colony Optimisation algorithm
Luigi Pio Prencipe and Mario MarinelliApplied Intelligence 51 (7) 4127 (2021)
https://doi.org/10.1007/s10489-020-02062-y
Modeling, Computing and Data Handling Methodologies for Maritime Transportation
Noura Al-DhaheriIntelligent Systems Reference Library, Modeling, Computing and Data Handling Methodologies for Maritime Transportation 131 49 (2018)
https://doi.org/10.1007/978-3-319-61801-2_2
A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints
Noura Al-Dhaheri and Ali DiabatAnnals of Operations Research 248 (1-2) 1 (2017)
https://doi.org/10.1007/s10479-016-2239-8
1 (2016)
https://doi.org/10.1109/IISA.2016.7785350
1 (2016)
https://doi.org/10.1109/IISA.2016.7785354
1 (2016)
https://doi.org/10.1109/IISA.2016.7785352
1 (2016)
https://doi.org/10.1109/IISA.2016.7785351
1286 (2016)
https://doi.org/10.1109/CSCI.2016.0241
1 (2016)
https://doi.org/10.1109/IISA.2016.7785353
A Branch-and-Price Algorithm to Solve a Quay Crane Scheduling Problem
Nabil Kenan and Ali DiabatProcedia Computer Science 61 527 (2015)
https://doi.org/10.1016/j.procs.2015.09.210
A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
Effrosyni Theodorou and Ali DiabatOptimization Letters 9 (4) 799 (2015)
https://doi.org/10.1007/s11590-014-0787-x
A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem
Yi-Min Fu and Ali DiabatApplied Mathematical Modelling 39 (3-4) 1194 (2015)
https://doi.org/10.1016/j.apm.2014.07.006
A simulation optimization approach for solving the dual-cycling problem in container terminals
Qingcheng Zeng, Ali Diabat and Qian ZhangMaritime Policy & Management 42 (8) 806 (2015)
https://doi.org/10.1080/03088839.2015.1043362
647 (2015)
https://doi.org/10.1109/IESM.2015.7380227