A biased random-key genetic algorithm for the container pre-marshalling problem
From MaRDI portal
Recommendations
- Solving the robust container pre-marshalling problem
- A feasibility-based heuristic for the container pre-marshalling problem
- A branch and bound approach for large pre-marshalling problems
- A multi-heuristic approach for solving the pre-marshalling problem
- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
Cites work
- scientific article; zbMATH DE number 1131224 (Why is no real title available?)
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
- A branch and price procedure for the container premarshalling problem
- A heuristic rule for relocating blocks
- A mathematical model of inter-terminal transportation
- A multi-heuristic approach for solving the pre-marshalling problem
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- A tree search procedure for the container pre-marshalling problem
- ASlib: a benchmark library for algorithm selection
- An optimization model for the container pre-marshalling problem
- Container terminal operation and operations research -- a classification and literature review
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification
- Models and algorithms for shuffling problems in steel plants
- On the complexity of blocks-world planning
- On the complexity of container stowage planning problems
- Operations research at container terminals: a literature update
- Optimizing liner shipping fleet repositioning plans
- Scikit-learn: machine learning in Python
- Simulation-based optimization for housekeeping in a container transshipment terminal
- Solving the container relocation problem by an improved greedy look-ahead heuristic
- Strategies for dispatching AGVs at automated seaport container terminals
- The Complexity of Sorting with Networks of Stacks and Queues
- The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
- Towards objective measures of algorithm performance across instance space
Cited in
(17)- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
- The container premarshalling problem under limited crane time: a constraint programming approach
- Optimizing the number of deployed yard cranes in a container terminal
- Deep learning assisted heuristic tree search for the container pre-marshalling problem
- Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem
- The bounded beam search algorithm for the block relocation problem
- Pre-processing a container yard under limited available time
- Robust optimization for premarshalling with uncertain priority classes
- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
- A branch and bound approach for large pre-marshalling problems
- Integer programming models for the pre-marshalling problem
- A beam search algorithm for minimizing crane times in premarshalling problems
- An exact algorithm for the unrestricted block relocation problem
- A constraint programming approach for the premarshalling problem
- An exact algorithm for the block relocation problem with a stowage plan
- The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions
This page was built for publication: A biased random-key genetic algorithm for the container pre-marshalling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342512)
