Three-dimensional bin packing problem with variable bin height

DOI10.1016/j.ejor.2009.05.040zbMath1175.90299OpenAlexW2168373012MaRDI QIDQ1039777

Mark Goh, Robert de Souza, Yong Wu, Wenkai Li

Publication date: 23 November 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10072/34843

zbMATH Keywords

optimizationgenetic algorithmsmixed integer programmingthree-dimensionalbin packingbatch bin packing

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (23)

Solving the 3-D yard allocation problem for break bulk cargo via variable neighborhood search branching ⋮ Global optimization for the three-dimensional open-dimension rectangular packing problem ⋮ A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems ⋮ Packing non-identical circles within a rectangle with open length ⋮ Exact and approximate methods for parallel multiple-area spatial scheduling with release times ⋮ A data-driven approach for mixed-case palletization with support ⋮ Reinforcement learning for combinatorial optimization: a survey ⋮ A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension ⋮ A MIP-based slicing heuristic for three-dimensional bin packing ⋮ A large neighbourhood search algorithm for solving container loading problems ⋮ Scheduling inspired models for two-dimensional packing problems ⋮ A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Solving packing problems by a distributed global optimization algorithm ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ A global search framework for practical three-dimensional packing with variable carton orientations ⋮ Lower bounds for three-dimensional multiple-bin-size bin packing problems ⋮ The pallet loading problem: three-dimensional bin packing with practical constraints ⋮ Constructive heuristics for the canister filling problem ⋮ Three-stage heuristic algorithm for three-dimensional irregular packing problem ⋮ Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints ⋮ A comparative review of 3D container loading algorithms ⋮ Methodology for selecting packaging alternatives: an ``action research application in the industrial sector

Uses Software

• CPLEX
• Genocop
• Algorithm 864

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristic approaches for the two- and three-dimensional knapsack packing problem
• Loading plates with non-identical items
• An analytical model for the container loading problem
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• A comparative evaluation of heuristics for container loading
• Heuristics for the container loading problem
• Heuristic algorithms for the three-dimensional bin packing problem
• Solving the variable size bin packing problem with discretized formulations
• The distributor's three-dimensional pallet-packing problem: a human intelligence-based heuristic approach
• Models and algorithms for three-stage two-dimensional bin packing
• Accelerating column generation for variable sized bin-packing problems
• Guided Local Search for the Three-Dimensional Bin-Packing Problem
• Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
• The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
• A Genetic Algorithm for Solving the Container Loading Problem
• The Three-Dimensional Bin Packing Problem
• Multiple Container Packing: A Case Study of Pipe Packing
• Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
• Evolutionary Computation in Combinatorial Optimization

This page was built for publication: Three-dimensional bin packing problem with variable bin height