A review of the application of meta-heuristic algorithms to 2D strip packing problems

Artificial Intelligence Review

Volumn 16, Issue 4, 2001, Pages 257-300

  Hopper, E ^a   Turton, B C H ^a  

^a CARDIFF UNIVERSITY   (United Kingdom)

Author keywords

Artificial neural networks; Genetic algorithms; Irregular; Meta heuristics; Packing problem; Regular; Simulated annealing; Tabu search; Two dimensional

Indexed keywords

GENETIC ALGORITHMS; INDUSTRY; NEURAL NETWORKS; OPTIMIZATION; PACKAGING; PROBLEM SOLVING; SIMULATED ANNEALING; TWO DIMENSIONAL;

META HEURISTIC ALGORITHMS; PACKING PROBLEM; STRIP PACKING PROBLEMS; TABU SEARCH;

HEURISTIC METHODS;

EID: 0035576292     PISSN: 02692821     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1012590107280     Document Type: Article

References (71)

1. Nesting two-dimensional shapes in rectangular modules
2. Optimal allocation of two-dimensional irregular shapes using heuristic search methods
3. A genetic solution for the cutting stock problem
4. Using a tabu search approach for solving the two-dimensional irregular cutting problem
5. Evolutionary search techniques application in automated lay-planning optimization problem
6. Irregular shape nesting and placing with evolutionary approach
7. Applying simulated annealing and the no fit polygon to the nesting problem
8. Approximation algorithms for bin-packing - an updated survey
9. Average-case analysis of cutting and packing in two dimensions
10. Optimising area loss in flat glass cutting
11. New approaches to nesting rectangular patterns
12. Applying adaptive search algorithms to epistatic domains
13. Solving pattern nesting problems with genetic algorithms employing task decomposition and contact detection
14. Some experiments with simulated annealing techniques for packing problems
15. Packing problems
16. Solution approaches to irregular nesting problems
17. Two and three dimensional packing problems and solution methods
18. Three-dimensional packing-solution approaches and heuristic development
19. Typology of cutting and packing problems
20. Simulated annealing. A tool for operational research
21. Application of simulated annealing to the cutting stock problem
22. Hybrid grouping genetic algorithm for bin packing
23. Optimal packing and covering in the plane are NP-complete
24. Hybrid approach for optimal nesting using a genetic algorithm and a local minimisation algorithm
25. Packing different-sized circles into a rectangular container
26. Tabu search
27. Approaches to the cutting stock problem
28. Polyominoes tiling by a genetic algorithm
29. Two-stage approach for nesting in two-dimensional cutting problems using neural network and simulated annealing
30. A local optimisation-based solution to the rectangle layout problem
31. A family of genetic algorithms for the pallet loading problem
32. The trim loss and assortment problems
33. Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods
34. Application of genetic algorithms to packing problems - a review
35. A genetic algorithm for a 2D industrial packing problem
36. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
37. On solving rectangle bin packing problems using genetic algorithms
38. New approaches for the nesting of two-dimensional shapes for press tool design
39. Nesting of two-dimensional shapes using genetic algorithms
40. Optimal blank nesting using simulated annealing
41. Two dimensional packing problems using genetic algorithms
42. On genetic algorithms for the packing of polygons
43. Simulated annealing: Use of a new tool in bin-packing
44. Guillontineable bin-packing: A genetic approach
45. Parallel genetic packing of rectangles
46. Genetic packing of rectangles on transputers
47. Parallel genetic packing on transputers
48. An evolutionary algorithm for the rectangular cutting stock problem
49. Applications of genetic algorithm and simulated annealing to the 2-dimensional non-guillotine cutting stock problem
50. An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
51. Approximation algorithms for the oriented two-dimensional bin packing problem
52. A system for the compaction of two-dimensional irregular shapes based on simulated annealing
53. A new constructive algorithm for nesting problems
54. A parallel stochastic optimisation algorithm for solving 2D bin packing problems
55. Varying quality function in genetic algorithms and the cutting problem
56. Genetic neuro-nester for irregular patterns
57. An evolutionary approach to two-dimensional guillotine cutting problem
58. An object-based evolutionary algorithm for solving rectangular piece nesting problems
59. An object-based evolutionary algorithm for solving irregular nesting problems
60. An object-based evolutionary algorithm: The nesting solution
61. Bin packing
62. Two-dimensional stock cutting problems and solution methodologies
63. Bin-packing with adaptive search
64. Cutting and packing problems: A categorised, application-orientated research bibliography
65. Optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules
66. Automated packing systems: Review of industrial implementations