Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems

DOI10.1016/j.cor.2022.105695OpenAlexW4206323263MaRDI QIDQ2669757

Mohamed Nour Kitri, Frédéric Fontane, Nikolay Tchernev, Nicolas Cheimanoff

Publication date: 9 March 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.105695

zbMATH Keywords

integer programmingvariable neighborhood searchberth allocationquay cranes assignment

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items

Berth and quay crane allocation and scheduling problem with renewable energy uncertainty: a robust exact decomposition

Uses Software

• GLOB

Cites Work

• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• General variable neighborhood search for the continuous optimization
• Attraction probabilities in variable neighborhood search
• A survey of berth allocation and quay crane scheduling problems in container terminals
• The berth planning problem
• Variable neighborhood search
• New exact methods for the time-invariant berth allocation and quay crane assignment problem
• A scheduling method for Berth and Quay cranes
• Optimal berth allocation and time-invariant quay crane assignment in container terminals

This page was built for publication: Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems