Generalized hyper-heuristics for solving 2D regular and irregular packing problems
From MaRDI portal
Publication:610988
DOI10.1007/s10479-008-0475-2zbMath1205.90252OpenAlexW2001514005MaRDI QIDQ610988
Publication date: 13 December 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0475-2
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A RNN-based hyper-heuristic for combinatorial problems ⋮ Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery ⋮ An effective heuristic for the two-dimensional irregular bin packing problem ⋮ A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games ⋮ An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations ⋮ A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands ⋮ A new model and a hyper-heuristic approach for two-dimensional shelf space allocation ⋮ Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning ⋮ Matheuristics for the irregular bin packing problem with free rotations ⋮ A beam search approach to solve the convex irregular bin packing problem with guillotine guts ⋮ Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry ⋮ Raster penetration map applied to the irregular packing problem ⋮ A hybrid chaos firefly algorithm for three-dimensional irregular packing problem ⋮ Packing Problems in Space Solved by CPLEX: An Experimental Analysis ⋮ Irregular packing: MILP model based on a polygonal enclosure
Uses Software
Cites Work
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
- Guillotineable bin packing: A genetic approach
- On genetic algorithms for the packing of polygons
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- A typology of cutting and packing problems
- An algorithm for polygon placement using a bottom-left strategy
- Hybrid genetic algorithms for bin-packing and related problems
- A graph-based hyper-heuristic for educational timetabling problems
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
- An improved typology of cutting and packing problems
- Mathematical Methods of Organizing and Planning Production
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
- Jostling for position: local improvement for irregular cutting patterns
- Heuristic, meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocation
- Two-Dimensional Finite Bin-Packing Algorithms
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
