Optimization berth allocation in container terminals: A Pyomo and Google Colab approach
- 12 September 2024
- journal article
- research article
- Published by Elsevier in Ocean & Coastal Management
- Vol. 258
Abstract
No abstract availableKeywords
Funding Information
- Ministry of Higher Education, Malaysia (59675)
- Ministry of Higher Education, Malaysia (FRGS/1/2021/ICT06/UMT/02/1)
This publication has 24 references indexed in Scilit:
- A novel mathematical formulation for solving the dynamic and discrete berth allocation problem by using the Bee Colony Optimisation algorithmApplied Intelligence, 2020
- Simulated annealing with different vessel assignment strategies for the continuous berth allocation problemFlexible Services and Manufacturing Journal, 2017
- Differential evolution based meta-heuristic algorithm for dynamic continuous berth allocation problemApplied Mathematical Modelling, 2016
- Robust Berth Allocation Using a Hybrid Approach Combining Branch-and-Cut and the Genetic Algorithm2016
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminalsEuropean Journal of Operational Research, 2015
- A bi-objective model for robust berth allocation schedulingComputers & Industrial Engineering, 2012
- Analysis of the continuous berth allocation problem in container ports using a genetic algorithmJournal of Marine Science and Technology, 2010
- A survey of berth allocation and quay crane scheduling problems in container terminalsEuropean Journal of Operational Research, 2010
- An optimization heuristic for the berth scheduling problemEuropean Journal of Operational Research, 2009
- Multi-objective and prioritized berth allocation in container portsAnnals of Operations Research, 2008