A beam search approach to the container loading problem
From MaRDI portal
(Redirected from Publication:336892)
Recommendations
- A beam search algorithm for the biobjective container loading problem
- An Efficient Algorithm for Solving the Container Loading Problem
- A tree search algorithm for solving the container loading problem
- Solving the single-container loading problem by a fast heuristic method
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- A Genetic Algorithm for Solving the Container Loading Problem
- A maximal-space algorithm for the container loading problem
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- A parallel hybrid local search algorithm for the container loading problem
- A tree search algorithm for solving the container loading problem
- An AND/OR-graph approach to the container loading problem
- An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
- An efficient placement heuristic for three-dimensional rectangular packing
- An improved typology of cutting and packing problems
- Loading plates with non-identical items
- Neighborhood structures for the container loading problem: a VNS implementation
- Solving container loading problems by block arrangement
- The Three-Dimensional Bin Packing Problem
- Weight distribution considerations in container loading
Cited in
(24)- A beam search algorithm for the biobjective container loading problem
- A hybrid chaos firefly algorithm for three-dimensional irregular packing problem
- An efficient heuristic for minimizing the number of moves for the retrieval of a single item in a puzzle-based storage system with multiple escorts
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
- A comparative review of 3D container loading algorithms
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
- Logistic constraints in container loading problems: the impact of complete shipment conditions
- A matheuristic framework for the three-dimensional single large object placement problem with practical constraints
- An extension of Queiroz and Miyazawa's method for vertical stability in two-dimensional packing problems to deal with horizontal stability
- The static stability of support factor‐based rectangular packings: an assessment by regression analysis
- VCS: A new heuristic function for selecting boxes in the single container loading problem
- An efficient method for the three-dimensional container loading problem by forming box sizes
- The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids
- A two-stage packing problem procedure
- A beam search algorithm for the load sequencing of outbound containers in port container terminals
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- The exact solutions of several types of container loading problems
- A two-phase constructive algorithm for the single container mix-loading problem
- Solving a large cutting problem in the glass manufacturing industry
- The risk-averse traveling repairman problem with profits
- A heuristic algorithm for container loading of pallets with infill boxes
- A two-phase approach for single container loading with weakly heterogeneous boxes
- A beam search algorithm for minimizing crane times in premarshalling problems
This page was built for publication: A beam search approach to the container loading problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336892)
