Quarterly (spring, summer, fall, winter)
176 pp. per issue
7 x 10
ISSN
1063-6560
E-ISSN
1530-9304
2014 Impact factor:
2.37

Evolutionary Computation

Fall 1995, Vol. 3, No. 3, Pages 239-266
(doi: 10.1162/evco.1995.3.3.239)
© 1995 by the Massachusetts Institute of Technology
Solving Pattern Nesting Problems with Genetic Algorithms Employing Task Decomposition and Contact Detection
Article PDF (1.27 MB)
Abstract

A hierarchical approach for nesting two-dimensional shapes based on genetic algorithms is described. For the higher-level search, a representation that facilitates genetic search based on recombination is developed. An alternatiye to overlap computation based on assembly of polygons is used at the lower level of search. Two implementations to find minimum-area enclosures for polygons, with and without a cohstraint on the width of stock, are discussed. Sample output illustrating the effectiveness of the approach is provided.