On the berth allocation problem

DOI10.1051/RO/2015029MaRDI QIDQ2826660zbMATH OpenOpenAlexFDO

Authors Shaikha Ahmed Jumaa Alzaabi, Ali Diabat

Publication date 18 October 2016

Published in RAIRO. Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

berth allocation problemmixed integer programming

Mathematics Subject Classification ID

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

Recommendations

• The berth allocation problem: models and solution methods
• The berth planning problem
• The berth allocation problem with a cut-and-run option
• The berth allocation problem in terminals with irregular layouts
• The dynamic berth allocation problem: A linearized formulation
• Berth allocation with time-dependent physical limitations on vessels
• A dynamic programming-based matheuristic for the dynamic berth allocation problem
• Berth allocation planning optimization in container terminals

Cites work

• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• 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
• An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study
• Berth allocation with time-dependent physical limitations on vessels
• The dynamic berth allocation problem: A linearized formulation

Cited in

(16)

• The berth allocation problem: models and solution methods
• The berth allocation problem in terminals with irregular layouts
• A dynamic programming-based matheuristic for the dynamic berth allocation problem
• Combinatorial approach to exactly solving discrete and hybrid berth allocation problem
• Novel formulations and modeling enhancements for the dynamic berth allocation problem
• Berth assignment for liner carrier clusters under a cooperative environment
• An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study
• Tactical berth allocation under uncertainty
• A set-partitioning-based model for the berth allocation problem under time-dependent limitations
• The berth allocation problem with mobile quay walls: problem definition, solution procedures, and extensions
• Combinatorial relaxation bounds and preprocessing for berth allocation problems
• A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints
• A fuzzy optimization model for the berth allocation problem
• The berth allocation problem with a cut-and-run option
• The dynamic berth allocation problem: A linearized formulation
• Berth allocation at indented berths for mega-containerships

This page was built for publication: On the berth allocation problem

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