New formulations and solutions for the strategic berth template problem

DOI10.1016/j.ejor.2021.06.062zbMath1490.90045OpenAlexW3181306364MaRDI QIDQ2076915

Yanyan Li

Publication date: 22 February 2022

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.06.062

zbMATH Keywords

combinatorial optimizationmaritime transportationstrategic berth allocation

Mathematics Subject Classification ID

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

Uses Software

• XPRESS

Cites Work

• Unnamed Item
• Unnamed Item
• POPMUSIC as a matheuristic for the berth allocation problem
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Berth allocation with time-dependent physical limitations on vessels
• Robust cyclic berth planning of container vessels
• A survey of berth allocation and quay crane scheduling problems in container terminals
• Berth management in container terminal: the template design problem
• Combinatorial optimization. Theory and applications.
• Minimizing Total Tardiness on One Machine is NP-Hard

This page was built for publication: New formulations and solutions for the strategic berth template problem