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

DOI10.1016/J.COR.2022.105695MaRDI QIDQ2669757zbMATH OpenOpenAlexFDO

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

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

berth allocationinteger programmingquay cranes assignmentvariable neighborhood search

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• New exact methods for the time-invariant berth allocation and quay crane assignment problem
• An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
• Constraint and mathematical programming models for integrated port container terminal operations
• 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

Cites work

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

Cited in

(14)

• Constraint and mathematical programming models for integrated port container terminal operations
• New exact methods for the time-invariant berth allocation and quay crane assignment problem
• Robust scheduling for berth allocation and quay crane assignment problem
• An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
• Integrated laycan and berth allocation and time-invariant quay crane assignment problem in tidal ports with multiple quays
• Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems
• A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
• Solving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm
• Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem
• Berth and quay crane allocation and scheduling problem with renewable energy uncertainty: a robust exact decomposition
• The berth allocation and quay crane assignment problem with crane travel and setup times
• A decomposition method for the group-based quay crane scheduling problem
• An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem
• Integrated berth allocation and quay crane assignment under cooperation among multiple container terminals

Describes a project that uses

Uses Software

• GLOB

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

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