A dynamic programming-based matheuristic for the dynamic berth allocation problem

DOI10.1007/S10479-017-2715-9MaRDI QIDQ2178356zbMATH OpenOpenAlexWikidataFDO

Authors Tatsushi Nishi, Tatsuya Okura, Eduardo Lalla-Ruiz, Stefan Voß

Publication date 11 May 2020

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-017-2715-9

zbMATH Keywords

matheuristicLagrangian decompositiondynamic Berth allocation problemdynasearch

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• The dynamic berth allocation problem: A linearized formulation
• Novel formulations and modeling enhancements for the dynamic berth allocation problem
• The berth allocation problem: models and solution methods
• A dynamic and flexible berth allocation model with stochastic vessel arrival times
• On the berth allocation problem
• Metaheuristic approaches for the berth allocation problem
• Mathematical models for the berth allocation problem in dry bulk terminals

Cites work

• scientific article; zbMATH DE number 5152600 (Why is no real title available?)
• A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
• A unified tabu search heuristic for vehicle routing problems with time windows
• An adaptive large neighborhood search for the discrete and continuous berth allocation problem
• An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
• An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
• Container terminal operation and operations research -- a classification and literature review
• Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
• Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness
• Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles
• POPMUSIC -- partial optimization metaheuristic under special intensification conditions
• POPMUSIC as a matheuristic for the berth allocation problem

Cited in

(13)

• POPMUSIC as a matheuristic for the berth allocation problem
• Differential evolution based meta-heuristic algorithm for dynamic continuous berth allocation problem
• Ballast water dynamic allocation optimization model and analysis for safe and reliable operation of floating cranes
• A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations
• Models and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor
• Novel formulations and modeling enhancements for the dynamic berth allocation problem
• Combinatorial approach to exactly solving discrete and hybrid berth allocation problem
• The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions
• On the berth allocation problem
• An adaptive large neighborhood search for the discrete and continuous berth allocation problem
• Mathematical models for the berth allocation problem in dry bulk terminals
• Combinatorial relaxation bounds and preprocessing for berth allocation problems
• An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach

Describes a project that uses

Uses Software

• POPMUSIC

This page was built for publication: A dynamic programming-based matheuristic for the dynamic berth allocation problem

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