A particular approach for the three-dimensional packing problem with additional constraints
From MaRDI portal
Publication:976016
DOI10.1016/j.cor.2010.01.010zbMath1188.90227MaRDI QIDQ976016
Marisa B. Figueiredo, Ana de Almeida
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
heuristic algorithms; multi-criteria optimization; three-dimensional packing; real problem application
90C29: Multi-objective and goal programming
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
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, The exact solutions of several types of container loading problems, Constraints in container loading -- a state-of-the-art review, A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application, A comparative review of 3D container loading algorithms, A global optimization approach for solving three-dimensional open dimension rectangular packing problems
Cites Work
- An analytical model for the container loading problem
- Packing small boxes into a big box.
- Guided Local Search for the Three-Dimensional Bin-Packing Problem
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- A greedy search for the three-dimensional bin packing problem: the packing static stability case
- The Three-Dimensional Bin Packing Problem