Recent advances on two-dimensional bin packing problems

DOI10.1016/S0166-218X(01)00347-XzbMath1022.90020MaRDI QIDQ697576

Daniele Vigo, Silvano Martello, Andrea Lodi

Publication date: 17 September 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

surveyalgorithmsbin packing problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

Prospective Network Flow Models and Algorithms for Bin Packing Problems, Improved filtering for the bin-packing with cardinality constraint, A hybrid heuristic algorithm for the 2D variable-sized bin packing problem, MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS, Constrained order packing: comparison of heuristic approaches for a new bin packing problem, Sequential heuristic for the two-dimensional bin-packing problem, A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints, Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search, A single machine scheduling problem with two-dimensional vector packing constraints, Bin packing and cutting stock problems: mathematical models and exact algorithms, A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem, An improved typology of cutting and packing problems, A new exact method for the two-dimensional orthogonal packing problem, Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts, Arc-flow model for the two-dimensional guillotine cutting stock problem, A virtual microstructure generator for 3D stone masonry walls, Two- and three-dimensional parametric packing, An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery, Models and algorithms for fair layout optimization problems, The off-line group seat reservation problem, Rectangle transformation problem, An introduction to the two‐dimensional rectangular cutting and packing problem, Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts, A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, A mathematical modeling approach to optimize composite parts placement in autoclave, Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand, A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber, Packing, covering and tiling in two-dimensional spaces, Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review, HEURISTICS WITH STOCHASTIC NEIGHBORHOOD STRUCTURES FOR TWO-DIMENSIONAL BIN PACKING AND CUTTING STOCK PROBLEMS, Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem, A sequential value correction heuristic for a bi-objective two-dimensional bin-packing, Layout optimisation for an installation port of an offshore wind farm, A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates, New resolution algorithm and pretreatments for the two-dimensional bin-packing problem, Exact and heuristic methods for placing ships in locks, A 3-approximation algorithm for two-dimensional bin packing, Chips on wafers, or packing rectangles into grids, Unnamed Item, The Two Dimensional Bin Packing Problem with Side Constraints, Exact solution techniques for two-dimensional cutting and packing, Number of bins and maximum lateness minimization in two-dimensional bin packing, Optimisation hybride par colonies de fourmis pour le problème de découpe à deux dimensions, Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers, An agent-based approach to the two-dimensional guillotine bin packing problem, Hybrid approach for the two-dimensional bin packing problem with two-staged patterns, A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing, A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem, Deterministic model for customized pilot manufacture production with various backplane sizes, Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem, A branch-and-price algorithm for the two-dimensional level strip packing problem, Optimal aircraft load balancing, A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem, Local search of orthogonal packings using the lower bounds, New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems, The two-dimensional bin packing problem with variable bin sizes and costs, Analysis of distributed genetic algorithms for solving cutting problems, A branch-and-price algorithm for the temporal bin packing problem, An efficient deterministic optimization approach for rectangular packing problems, 2DPackLib: a two-dimensional cutting and packing library

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
• Online algorithms. The state of the art
• A 2.5 times optimal algorithm for packing in two dimensions
• An improved BL lower bound
• Packings in two dimensions: Asymptotic average-case analysis of algorithms
• A lower bound for the non-oriented two-dimensional bin packing problem
• An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
• An exact algorithm for general, orthogonal, two-dimensional knapsack problems
• Integer linear programming models for 2-staged two-dimensional knapsack problems
• Approximation algorithm for the oriented two-dimensional bin packing problem
• Heuristic algorithms for the three-dimensional bin packing problem
• A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• A Linear Programming Approach to the Cutting-Stock Problem
• Shelf Algorithms for Two-Dimensional Packing Problems
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Two-Dimensional Finite Bin-Packing Algorithms
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Orthogonal Packings in Two Dimensions
• Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
• A algorithm for two-dimensional packing
• On Packing Two-Dimensional Bins
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• An Algorithm for Two-Dimensional Cutting Problems
• A Strip-Packing Algorithm with Absolute Performance Bound 2
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
• Optimal Scheduling of Tasks on Identical Parallel Processors
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Multistage Cutting Stock Problems of Two and More Dimensions