Selecting algorithms for large berth allocation problems

DOI10.1016/j.ejor.2019.11.055zbMath1441.90069OpenAlexW2990512606WikidataQ126642103 ScholiaQ126642103MaRDI QIDQ2294627

Eric Sanlaville, Maciej Drozdowski, Jakub Wawrzyniak

Publication date: 11 February 2020

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

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

zbMATH Keywords

heuristicsschedulingalgorithm portfoliosberth allocation problemalgorithm selection problemquality-runtime trade-off

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

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 ⋮ The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions ⋮ Quay partitioning problem ⋮ Parallel algorithm portfolios with adaptive resource allocation strategy ⋮ Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art ⋮ Selecting algorithms for large berth allocation problems ⋮ Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem ⋮ Models and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor

Uses Software

• aspeed

Cites Work

• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Tactical berth allocation under uncertainty
• On contiguous and non-contiguous parallel task scheduling
• Variable neighborhood search for minimum cost berth allocation
• Robust cyclic berth planning of container vessels
• A survey of berth allocation and quay crane scheduling problems in container terminals
• Measuring instance difficulty for combinatorial optimization problems
• A self-adaptive evolutionary algorithm for the berth scheduling problem: towards efficient parameter control
• Selecting algorithms for large berth allocation problems
• Berth management in container terminal: the template design problem
• aspeed: Solver scheduling via answer set programming

This page was built for publication: Selecting algorithms for large berth allocation problems