A particular approach for the three-dimensional packing problem with additional constraints

DOI10.1016/J.COR.2010.01.010zbMATH Open1188.90227OpenAlexW2042249499MaRDI QIDQ976016FDOQ976016

Authors: Ana Maria de Almeida, Marisa B. Figueiredo 

Publication date: 11 June 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.01.010

Recommendations

• 3-D container packing heuristics
• AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
• A heuristic for the three-dimensional strip packing problem
• A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
• Heuristic algorithms for the three-dimensional bin packing problem

zbMATH Keywords

multi-criteria optimizationheuristic algorithmsthree-dimensional packingreal problem application

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Extreme point-based heuristics for three-dimensional bin packing
• Guided local search for the three-dimensional bin-packing problem
• The Three-Dimensional Bin Packing Problem
• A greedy search for the three-dimensional bin packing problem: the packing static stability case
• An analytical model for the container loading problem
• Packing small boxes into a big box.

Cited In (13)

• A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
• The exact solutions of several types of container loading problems
• Title not available (Why is that?)
• 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
• Solving packing problems by a distributed global optimization algorithm
• Grids for cutting and packing problems: a study in the 2D knapsack problem
• A global optimization approach for solving three-dimensional open dimension rectangular packing problems
• AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
• A comparative review of 3D container loading algorithms
• Constraints in container loading -- a state-of-the-art review
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
• An efficient method for the three-dimensional container loading problem by forming box sizes

This page was built for publication: A particular approach for the three-dimensional packing problem with additional constraints

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