Approximate dynamic programming for container stacking
From MaRDI portal
Publication:6113333
Recommendations
- Approximate algorithms for the container loading problem
- An approximation algorithm for stacking up bins from a conveyer onto pallets
- An approximation algorithm for the stack-up problem
- Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations
- On the complexity of container stowage planning problems
- Dynamic multi-dimensional bin packing
- A maximal-space algorithm for the container loading problem
- A heuristic for multiple container loading problems
- Heuristics for the container loading problem
- Approximation algorithms for a hierarchically structured bin packing problem
Cites work
- A heuristic rule for relocating blocks
- A mathematical formulation and complexity considerations for the blocks relocation problem
- A new binary formulation of the restricted container relocation problem based on a binary encoding of configurations
- A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem
- An algorithm with performance guarantee for the online container relocation problem
- Applying the corridor method to a blocks relocation problem
- Approximate dynamic programming by practical examples
- Conservative allocation models for outbound containers in container terminals
- Container relocation problem with time windows for container departure
- Deriving decision rules to locate export containers in container yards
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification
- Operations research at container terminals: a literature update
- The assignment of storage locations to containers for a container stack
This page was built for publication: Approximate dynamic programming for container stacking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6113333)