POPMUSIC as a matheuristic for the berth allocation problem

DOI10.1007/s10472-014-9444-4zbMath1335.90124OpenAlexW1992052799WikidataQ57866741 ScholiaQ57866741MaRDI QIDQ276540

Stefan Voß, Eduardo Lalla-Ruiz

Publication date: 4 May 2016

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-014-9444-4

zbMATH Keywords

berth allocation problemmatheuristicPOPMUSIC

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items

The matching relaxation for a class of generalized set partitioning problems, A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals, A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem, A dynamic programming-based matheuristic for the dynamic berth allocation problem, A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics, Novel formulations and modeling enhancements for the dynamic berth allocation problem, A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics, A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations, Hybridizations of evolutionary algorithms with large neighborhood search, Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When?, The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm, Generalized local branching heuristics and the capacitated ring tree problem, The berth allocation problem in terminals with irregular layouts, A comparative analysis of two matheuristics by means of merged local optima networks, Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time, Combinatorial approach to exactly solving discrete and hybrid berth allocation problem, New formulations and solutions for the strategic berth template problem

Uses Software

• POPMUSIC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The service allocation problem at the Gioia Tauro maritime terminal
• A survey of berth allocation and quay crane scheduling problems in container terminals
• Container terminal operation and operations research -- a classification and literature review
• The Lebesgue summability of double trigonometric integrals
• Matheuristics