Siti Nur 'Ain Nazri , Kasypi Mokhtar , Anuar Abu Bakar , Benjamin Craig Mclellan , Siti Marsila Mhd Ruslan
{"title":"Optimization berth allocation in container terminals: A Pyomo and Google Colab approach","authors":"Siti Nur 'Ain Nazri , Kasypi Mokhtar , Anuar Abu Bakar , Benjamin Craig Mclellan , Siti Marsila Mhd Ruslan","doi":"10.1016/j.ocecoaman.2024.107359","DOIUrl":null,"url":null,"abstract":"<div><p>Efficient berth allocation profoundly influences container terminal operations, affecting vessel waiting and turnaround times, and overall performance. This study presents a mixed-integer linear programming (MILP) model addressing the Berth Allocation Problem (BAP) in a Malaysian container port. By incorporating the Pyomo optimization library and CBC (Coin-or Branch and Cut) solver in Google Colab, optimal berth allocations are determined, minimizing vessel turnaround times. Visualized in a Space-Time diagram, the results highlight efficient allocation strategies. Despite limitations, the study optimally resolved three instances, achieving a remarkable 38.54% reduction in overall vessel turnaround time compared to FCFS (First-Come-First-Serve) allocation. By prioritizing port turnaround time, the optimization substantially reduced berthing and departure delays, aligning with UNCTAD's call for enhanced port efficiency and accelerated decarbonization efforts.</p></div>","PeriodicalId":54698,"journal":{"name":"Ocean & Coastal Management","volume":"258 ","pages":"Article 107359"},"PeriodicalIF":4.8000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ocean & Coastal Management","FirstCategoryId":"93","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0964569124003442","RegionNum":2,"RegionCategory":"环境科学与生态学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OCEANOGRAPHY","Score":null,"Total":0}
引用次数: 0
Abstract
Efficient berth allocation profoundly influences container terminal operations, affecting vessel waiting and turnaround times, and overall performance. This study presents a mixed-integer linear programming (MILP) model addressing the Berth Allocation Problem (BAP) in a Malaysian container port. By incorporating the Pyomo optimization library and CBC (Coin-or Branch and Cut) solver in Google Colab, optimal berth allocations are determined, minimizing vessel turnaround times. Visualized in a Space-Time diagram, the results highlight efficient allocation strategies. Despite limitations, the study optimally resolved three instances, achieving a remarkable 38.54% reduction in overall vessel turnaround time compared to FCFS (First-Come-First-Serve) allocation. By prioritizing port turnaround time, the optimization substantially reduced berthing and departure delays, aligning with UNCTAD's call for enhanced port efficiency and accelerated decarbonization efforts.
期刊介绍:
Ocean & Coastal Management is the leading international journal dedicated to the study of all aspects of ocean and coastal management from the global to local levels.
We publish rigorously peer-reviewed manuscripts from all disciplines, and inter-/trans-disciplinary and co-designed research, but all submissions must make clear the relevance to management and/or governance issues relevant to the sustainable development and conservation of oceans and coasts.
Comparative studies (from sub-national to trans-national cases, and other management / policy arenas) are encouraged, as are studies that critically assess current management practices and governance approaches. Submissions involving robust analysis, development of theory, and improvement of management practice are especially welcome.