A mathematical formulation and efficient heuristics for the dynamic container relocation problem
From MaRDI portal
Publication:4632822
DOI10.1002/nav.21569zbMath1411.90197OpenAlexW2083198433MaRDI QIDQ4632822
Publication date: 2 May 2019
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21569
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
Optimizing the number of deployed yard cranes in a container terminal, Container relocation problem with time windows for container departure, An exact algorithm for the unrestricted block relocation problem, On the abstraction method for the container relocation problem, An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules, Pre-processing a container yard under limited available time, Mathematical formulation and heuristic algorithm for the block relocation and loading problem, Comparing allocation and relocation policies at a logistics service container terminal: a discrete-event simulation approach, An algorithm with performance guarantee for the online container relocation problem, A local-search based heuristic for the unrestricted block relocation problem, A new binary formulation of the restricted container relocation problem based on a binary encoding of configurations, Yard crane scheduling for container storage, retrieval, and relocation, Optimizing pre-processing and relocation moves in the stochastic container relocation problem, New integer programming models for slab stack shuffling problems
