A new heuristic algorithm for cuboids packing with no orientation constraints
From MaRDI portal
(Redirected from Publication:954042)
Recommendations
Cites work
- A hybrid genetic algorithm for the container loading problem
- A new heuristic algorithm for rectangle packing
- A parallel hybrid local search algorithm for the container loading problem
- Approximate algorithms for the container loading problem
- Heuristics for the container loading problem
- Loading Multiple Pallets
- Multistage Cutting Stock Problems of Two and More Dimensions
- Solving container loading problems by block arrangement
Cited in
(13)- A global search framework for practical three-dimensional packing with variable carton orientations
- A fast heuristic for a three-dimensional non-convex domain loading problem
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- VCS: A new heuristic function for selecting boxes in the single container loading problem
- scientific article; zbMATH DE number 5371495 (Why is no real title available?)
- A hybrid chaos firefly algorithm for three-dimensional irregular packing problem
- An efficient placement heuristic for three-dimensional rectangular packing
- PACKING A TRUCK — NOW WITH A TWIST!
- A comparative review of 3D container loading algorithms
- Constraints in container loading -- a state-of-the-art review
- On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints
- A pure quasi-human algorithm for solving the cuboid packing problem
- A maximum caving degree algorithm for three-dimensional rectangular packing
This page was built for publication: A new heuristic algorithm for cuboids packing with no orientation constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954042)