A biased random-key genetic algorithm for the container pre-marshalling problem
From MaRDI portal
Publication:342512
DOI10.1016/j.cor.2016.05.011zbMath1349.90563OpenAlexW2394748150WikidataQ60145754 ScholiaQ60145754MaRDI QIDQ342512
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.05.011
Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) 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, The bounded beam search algorithm for the block relocation problem, An exact algorithm for the unrestricted block relocation problem, Pre-processing a container yard under limited available time, A beam search algorithm for minimizing crane times in premarshalling problems, Robust optimization for premarshalling with uncertain priority classes, A constraint programming approach for the premarshalling problem, The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions, A branch and bound approach for large pre-marshalling problems, Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm, Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem, Integer programming models for the pre-marshalling problem, An exact algorithm for the block relocation problem with a stowage plan, Deep learning assisted heuristic tree search for the container pre-marshalling problem, Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimizing liner shipping fleet repositioning plans
- ASlib: a benchmark library for algorithm selection
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification
- Solving the container relocation problem by an improved greedy look-ahead heuristic
- Towards objective measures of algorithm performance across instance space
- Simulation-based optimization for housekeeping in a container transshipment terminal
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
- A tree search procedure for the container pre-marshalling problem
- An optimization model for the container pre-marshalling problem
- On the complexity of blocks-world planning
- Container terminal operation and operations research -- a classification and literature review
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- A mathematical model of inter-terminal transportation
- A multi-heuristic approach for solving the pre-marshalling problem
- Strategies for dispatching AGVs at automated seaport container terminals
- On the complexity of container stowage planning problems
- Operations research at container terminals: a literature update
- A heuristic rule for relocating blocks
- The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
- A Branch and Price Procedure for the Container Premarshalling Problem
- Models and algorithms for shuffling problems in steel plants
- The Complexity of Sorting with Networks of Stacks and Queues
- Genetic Algorithms and Random Keys for Sequencing and Optimization
