An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study

DOI10.1051/RO/2015048zbMATH Open1358.90014OpenAlexW2527422581MaRDI QIDQ2969974FDOQ2969974

Authors: Jasem al-Hammadi, Ali Diabat 

Publication date: 24 March 2017

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2015048

Recommendations

• A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
• Berth allocation planning optimization in container terminals
• Multi-objective and prioritized berth allocation in container ports
• An integrated model for berth and yard planning in container terminals with multi-continuous berth layout
• Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem
• The berth allocation problem: models and solution methods
• An integrated storage space and berth allocation problem in a container terminal
• Novel formulations and modeling enhancements for the dynamic berth allocation problem
• The berth allocation problem in terminals with irregular layouts

zbMATH Keywords

MIPmaritime logisticsbulk portsBerth allocation problemyard assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)

Cites Work

• A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
• A scheduling method for Berth and Quay cranes
• A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
• On the berth allocation problem
• Berth allocation with time-dependent physical limitations on vessels
• A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time
• Robust cyclic berth planning of container vessels
• Simulation-based optimization for discharge/loading operations at a maritime container terminal
• Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
• Online rules for container stacking
• The Dynamic Berth Allocation Problem: A linearized formulation
• A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints

Cited In (4)

• On the berth allocation problem
• Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem
• Multi-objective and prioritized berth allocation in container ports
• Berth allocation at indented berths for mega-containerships

This page was built for publication: An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2969974)