The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers

DOI10.3934/jimo.2022088OpenAlexW4285309573MaRDI QIDQ2691324

Salma Mezghani, Habib Chabchoub, Boukthir Haddar

Publication date: 29 March 2023

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2022088

zbMATH Keywords

applicationscutting and packingadditional constraintsrectangular shapebin packing problem (BPP)

Mathematics Subject Classification ID

Differential geometry of symmetric spaces (53C35)

Uses Software

• 2DCPackGen
• Bison

Cites Work

• Improved local search algorithms for the rectangle packing problem with general spatial costs
• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
• The two-dimensional bin packing problem with variable bin sizes and costs
• Sequential heuristic for the two-dimensional bin-packing problem
• A variable neighborhood descent approach for the two-dimensional bin packing problem
• An improved typology of cutting and packing problems
• A hybrid genetic algorithm for the two-dimensional single large object placement problem
• Models and algorithms for three-stage two-dimensional bin packing
• Multi-objective temporal bin packing problem: an application in cloud computing
• Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms
• Mathematical Methods of Organizing and Planning Production
• A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions
• Hybrid approach for the two-dimensional bin packing problem with two-staged patterns
• An Exact Approach to the Strip-Packing Problem
• Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
• Algorithms for the two dimensional bin packing problem with partial conflicts
• Algorithms for the Bin Packing Problem with Conflicts
• A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
• Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
• An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
• A two-stage packing problem procedure
• A greedy search for the three-dimensional bin packing problem: the packing static stability case
• About the Structure of the Integer Cone and Its Application to Bin Packing
• On Bin Packing with Conflicts
• Heuristics for determining the number of warehouses for storing non-compatible products
• Variable Sized Bin Packing
• Two-Dimensional Finite Bin-Packing Algorithms
• A stochastic model of bin-packing
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
• On Packing Two-Dimensional Bins
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• The Bin Packing Problem with Precedence Constraints
• One-dimensional heuristics adapted for two-dimensional rectangular strip packing
• Solving the two-dimensional packing problem with m-M calculus
• Efficient algorithms for orthogonal packing problems
• Bin packing with directed stackability conflicts
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
• A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
• A heuristic for solving large bin packing problems in two and three dimensions
• A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
• The multiple container loading problem with preference
• Procedures for the bin packing problem with precedence constraints
• Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic
• A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
• A grouping genetic algorithm with controlled gene transmission for the bin packing problem
• An effective tabu search approach with improved loading algorithms for the 3L-CVRP
• Vector bin packing with heterogeneous bins: application to the machine reassignment problem
• Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
• Packing first, routing second -- a heuristic for the vehicle routing and loading problem
• An AFPTAS for variable sized bin packing with general activation costs
• Exactly solving packing problems with fragmentation
• Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
• Lower and upper bounds for the bin packing problem with fragile objects
• An investigation into two bin packing problems with ordering and orientation implications
• A skyline heuristic for the 2D rectangular packing and strip packing problems
• Online variable-sized bin packing with conflicts
• Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
• Max-min bin packing algorithm and its application in nano-particles filling
• Relaxations and exact solution of the variable sized bin packing problem
• An exact method for the 2D guillotine strip packing problem
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• Optimal rectangle packing
• Dynamic multi-dimensional bin packing
• A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
• A tree search method for the container loading problem with shipment priority
• A new version of on-line variable-sized bin packing
• Recent advances on two-dimensional bin packing problems
• Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
• Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints
• Strip packing with precedence constraints and strip packing with release times
• Lower bounds and reduction procedures for the bin packing problem
• A particular approach for the three-dimensional packing problem with additional constraints
• New lower bounds for bin packing problems with conflicts
• An agent-based approach to the two-dimensional guillotine bin packing problem
• A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
• Heuristics for the variable sized bin-packing problem
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints
• Three-dimensional bin packing problem with variable bin height
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
• Online variable-sized bin packing
• Resource constrained scheduling as generalized bin packing
• Multiple-type, two-dimensional bin packing problems: Applications and algorithms
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• Local search algorithms for the bin packing problem and their relationships to various construction heuristics
• Local search algorithms for the rectangle packing problem with general spatial costs
• The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
• An efficient approach for the multi-pallet loading problem
• An improved approximation algorithm of MULTIWAY CUT.
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• Approximation and online algorithms. 16th international workshop, WAOA 2018, Helsinki, Finland, August 23--24, 2018. Revised selected papers
• A MIP-based slicing heuristic for three-dimensional bin packing
• Product packing and stacking under uncertainty: a robust approach
• The optimal absolute ratio for online bin packing
• A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
• A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints
• The min-conflict packing problem
• Efficient algorithms for real-life instances of the variable size bin packing problem
• Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
• Three-dimensional container loading models with cargo stability and load bearing constraints
• Variable neighbourhood search for the variable sized bin packing problem
• Heuristics and lower bounds for the bin packing problem with conflicts
• BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem
• Approximation algorithm for the oriented two-dimensional bin packing problem
• A typology of cutting and packing problems
• Two-dimensional packing problems: a survey
• LP models for bin packing and cutting stock problems
• Heuristic algorithms for the three-dimensional bin packing problem
• Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
• Algorithms for the variable sized bin packing problem
• Models and bounds for two-dimensional level packing problems
• Space defragmentation for packing problems
• Bin packing with fixed number of bins revisited
• Online packing of arbitrary sized items into designated and multipurpose bins
• The pallet loading problem: three-dimensional bin packing with practical constraints
• Bin packing problem with conflicts and item fragmentation
• A bin packing approach to solve the aircraft maintenance task allocation problem
• A hybrid evolutionary algorithm for the offline Bin Packing Problem
• Solving robust bin-packing problems with a branch-and-price approach
• A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
• Online bin packing with cardinality constraints resolved
• Heuristic approaches for solid transportation-\(p\)-facility location problem
• An exact and a heuristic approach for the transportation-\(p\)-facility location problem
• A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
• Exact and heuristic methods for placing ships in locks
• Approximation and online algorithms for multidimensional bin packing: a survey
• Online bin packing of fragile objects with application in cellular networks
• On solving multiobjective bin packing problems using evolutionary particle swarm optimization
• Comparing online algorithms for bin packing problems
• Efficient algorithms for the offline variable sized bin-packing problem
• Two-dimensional strip packing with unloading constraints
• A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem
• A new constraint programming approach for the orthogonal packing problem
• Solving the variable size bin packing problem with discretized formulations
• Two-dimensional bin packing with one-dimensional resource augmentation
• A new exact method for the two-dimensional bin-packing problem with fixed orientation
• New resolution algorithm and pretreatments for the two-dimensional bin-packing problem

This page was built for publication: The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers