POPMUSIC as a matheuristic for the berth allocation problem

DOI10.1007/S10472-014-9444-4MaRDI QIDQ276540zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Eduardo Lalla-Ruiz, Stefan Voß

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

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

Recommendations

• A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations
• Metaheuristic approaches for the berth allocation problem
• The berth allocation problem with a cut-and-run option
• A dynamic programming-based matheuristic for the dynamic berth allocation problem
• The dynamic berth allocation problem: A linearized formulation

Cites work

• scientific article; zbMATH DE number 5152600 (Why is no real title available?)
• A survey of berth allocation and quay crane scheduling problems in container terminals
• Container terminal operation and operations research -- a classification and literature review
• Handbook of applied optimization
• Handbooks in operations Research \& management science: Transportation
• Matheuristics
• POPMUSIC -- partial optimization metaheuristic under special intensification conditions
• The Lebesgue summability of double trigonometric integrals
• The service allocation problem at the Gioia Tauro maritime terminal

Cited in

(19)

• Novel formulations and modeling enhancements for the dynamic berth allocation problem
• The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm
• A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem
• The berth allocation problem in terminals with irregular layouts
• POPMUSIC for a real-world large-scale vehicle routing problem with time windows
• A dynamic programming-based matheuristic for the dynamic berth allocation problem
• Hybridizations of evolutionary algorithms with large neighborhood search
• Combinatorial approach to exactly solving discrete and hybrid berth allocation problem
• Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time
• A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics
• Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional knapsack problem: which one works better when?
• A comparative analysis of two matheuristics by means of merged local optima networks
• Metaheuristic approaches for the berth allocation problem
• A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals
• A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics
• The matching relaxation for a class of generalized set partitioning problems
• Generalized local branching heuristics and the capacitated ring tree problem
• A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations
• New formulations and solutions for the strategic berth template problem

Describes a project that uses

Uses Software

• POPMUSIC

This page was built for publication: POPMUSIC as a matheuristic for the berth allocation problem

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