The berth allocation problem in terminals with irregular layouts

DOI10.1016/J.EJOR.2018.07.019MaRDI QIDQ1991240zbMATH OpenOpenAlexWikidataFDO

Authors Juan Francisco Correcher, Thomas Van den Bossche, Ramón Alvarez-Valdes, Greet Vanden Berghe

Publication date 30 October 2018

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://lirias.kuleuven.be/handle/123456789/625185

zbMATH Keywords

berth allocationcombinatorial optimizationinteger programmingiterated local searchport terminal

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10) Applications of mathematical programming (90C90)

Recommendations

• On the berth allocation problem
• The dynamic berth allocation problem: A linearized formulation
• The berth allocation problem: models and solution methods
• Berth allocation planning optimization in container terminals
• Berth allocation with time-dependent physical limitations on vessels

Cites work

• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• A set-partitioning-based model for the berth allocation problem under time-dependent limitations
• A survey of berth allocation and quay crane scheduling problems in container terminals
• Berth allocation at indented berths for mega-containerships
• Mathematical models for the berth allocation problem in dry bulk terminals
• MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
• Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
• Optimal policies for the berth allocation problem under stochastic nature
• POPMUSIC as a matheuristic for the berth allocation problem
• Real-time management of berth allocation with stochastic arrival and handling times
• Tactical berth allocation under uncertainty
• The berth planning problem
• The late acceptance hill-climbing heuristic

Cited in

(18)

• The berth planning problem
• Mathematical models for the berth allocation problem in dry bulk terminals
• An integrated model for berth and yard planning in container terminals with multi-continuous berth layout
• Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey
• A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals
• Berth management in container terminal: the template design problem
• On the berth allocation problem
• An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study
• A model to design recreational boat mooring fields
• Terminal allocation problem in a transshipment hub considering bunker consumption
• Metaheuristic approaches for the berth allocation problem
• Combinatorial relaxation bounds and preprocessing for berth allocation problems
• Fuzziness in the berth allocation problem
• The dynamic berth allocation problem: A linearized formulation
• The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions
• The berth allocation and quay crane assignment problem with crane travel and setup times
• Information sharing in a maritime supply chain with carrier sustainability investment
• Variable neighborhood search for minimum cost berth allocation

This page was built for publication: The berth allocation problem in terminals with irregular layouts

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