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

DOI10.1007/s10479-017-2715-9zbMath1439.90036OpenAlexW2768883843WikidataQ57866445 ScholiaQ57866445MaRDI QIDQ2178356

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

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

Lagrangian decompositionmatheuristicdynamic Berth allocation problemdynasearch

Mathematics Subject Classification ID

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

Related Items (4)

The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions ⋮ An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach ⋮ Ballast water dynamic allocation optimization model and analysis for safe and reliable operation of floating cranes ⋮ Models and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor

Uses Software

• POPMUSIC

Cites Work

• POPMUSIC as a matheuristic for the berth allocation problem
• Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness
• Container terminal operation and operations research -- a classification and literature review
• An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
• An adaptive large neighborhood search for the discrete and continuous berth allocation problem
• A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
• Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles
• Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
• An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
• A unified tabu search heuristic for vehicle routing problems with time windows
• Unnamed Item
• Unnamed Item

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