A general purpose algorithm for three-dimensional packing

DOI10.1287/IJOC.1030.0068zbMATH Open1239.90108OpenAlexW2105183094MaRDI QIDQ2890477FDOQ2890477

Authors: Lorenzo Brunetta, Philippe Grégoire 

Publication date: 8 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c31190091cefa29edb079ea7762fe018623bfb4e

Recommendations

• 3-D container packing heuristics
• An Efficient Algorithm for Solving the Container Loading Problem
• A tree search algorithm for solving the container loading problem
• Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
• A heuristic for the three-dimensional strip packing problem

zbMATH Keywords

integer programmingheuristic algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10)

Cited In (32)

• A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Efficient Algorithm for Solving the Container Loading Problem
• Title not available (Why is that?)
• 3-D container packing heuristics
• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
• Heuristic algorithms for on-line packing in three dimensions
• The distributor's three-dimensional pallet-packing problem: a human intelligence-based heuristic approach
• On the three-dimensional container packing problem under home delivery service
• A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
• Approximate algorithms for the container loading problem
• Lower bounds for three-dimensional multiple-bin-size bin packing problems
• AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
• Three-stage heuristic algorithm for three-dimensional irregular packing problem
• Space and time allocation in a shipyard assembly hall
• A cost-efficient method to optimize package size in emerging markets
• An efficient placement heuristic for three-dimensional rectangular packing
• A heuristic algorithm for three-dimensional container loading problem with non-identical items
• A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
• Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
• A global optimization algorithm for the three-dimensional packing problem
• A recursion heuristic algorithm for cylinder objects loading problem
• A comparative review of 3D container loading algorithms
• A computer-based heuristic for packing pooled shipment containers
• A multi-level tree search algorithm for three dimensional container loading problem
• Constraints in container loading -- a state-of-the-art review
• SIMULTANEOUS PACKING AND COVERING IN THREE–DIMENSIONAL EUCLIDEAN SPACE
• A heuristic approach to the three-dimensional cargo-loading problem
• An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
• A tree search algorithm for solving the container loading problem
• A new heuristic algorithm for cuboids packing with no orientation constraints

This page was built for publication: A general purpose algorithm for three-dimensional packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890477)