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

DOI10.1051/RO/2015048MaRDI QIDQ2969974zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Berth allocation problembulk portsmaritime logisticsMIPyard assignment

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(6)

• A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
• On the berth allocation problem
• Multi-objective and prioritized berth allocation in container ports
• Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem
• A review of bulk terminal operations: status, trends, and future outlook
• 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)