Constrained order packing: comparison of heuristic approaches for a new bin packing problem
From MaRDI portal
Publication:300978
DOI10.1007/s10100-011-0228-1zbMath1339.90280OpenAlexW2102615229MaRDI QIDQ300978
Nikolaus Furian, Siegfried Vössner
Publication date: 29 June 2016
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-011-0228-1
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A hybrid algorithm for constrained order packing, A hybrid evolutionary algorithm for the two-dimensional packing problem, Merging image databases as an example for information integration, The cutting stock problem applied to the hardening process in an automotive spring factory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A heuristic for solving large bin packing problems in two and three dimensions
- A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
- Recent advances on two-dimensional bin packing problems
- TSpack: A unified tabu search code for multi-dimensional bin packing problems
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- Competence-driven project portfolio selection, scheduling and staff assignment
- An agent-based approach to the two-dimensional guillotine bin packing problem
- Modified subset sum heuristics for bin packing
- Packing problems
- A lower bound for the non-oriented two-dimensional bin packing problem
- Worst-case analysis of the subset sum algorithm for bin packing.
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- Approximation algorithm for the oriented two-dimensional bin packing problem
- A typology of cutting and packing problems
- Two-dimensional packing problems: a survey
- On solving multiobjective bin packing problems using evolutionary particle swarm optimization
- A new lower bound for the non-oriented two-dimensional bin-packing problem
- New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
- An improved typology of cutting and packing problems
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Two-Dimensional Finite Bin-Packing Algorithms
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
