A beam search implementation for the irregular shape packing problem
From MaRDI portal
Recommendations
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- Dealing with nonregular shapes packing
- A tutorial in irregular shape packing problems
- A hybrid beam search looking-ahead algorithm for the circular packing problem
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
Cites work
- A 2-exchange heuristic for nesting problems
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
- A simulated annealing approach to the nesting problem in the textile manufacturing industry
- A tabu thresholding implementation for the irregular stock cutting problem
- An algorithm for polygon placement using a bottom-left strategy
- An improved typology of cutting and packing problems
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- Computing closely matching upper and lower bounds on textile nesting problems
- Fast neighborhood search for two- and three-dimensional nesting problems
- Job shop scheduling with beam search
- Jostling for position: local improvement for irregular cutting patterns
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- On genetic algorithms for the packing of polygons
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- TOPOS -- A new constructive algorithm for nesting problems
Cited in
(15)- An effective heuristic for the two-dimensional irregular bin packing problem
- Beam search and non-linear programming tools for the circular packing problem
- Matheuristics for the irregular bin packing problem with free rotations
- A clique covering MIP model for the irregular strip packing problem
- Algorithms for nesting with defects
- An improved best-fit heuristic for the orthogonal strip packing problem
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
- Dealing with nonregular shapes packing
- Irregular packing: MILP model based on a polygonal enclosure
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
- Solving a large cutting problem in the glass manufacturing industry
- Irreducible bin packing and normality in routing open shop
- A fast implementation for the 2D/3D box placement problem
- Raster penetration map applied to the irregular packing problem
This page was built for publication: A beam search implementation for the irregular shape packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q964846)
