Solving pattern nesting problems with genetic algorithms employing task decomposition and contact detection

Authors:
Rahul Dighe;Mark J. Jakiela
Affiliations:
Graduate Student Research Assistant Massachusetts Institute of Technology Department of Mechanical Engineering Computer-Aided Design Laboratory Cambridge, MA 02139 rahul@mit.edu;Associate Professor of Mechanical Engineering Massachusetts Institute of Technology Department of Mechanical Engineering Computer-Aided Design Laboratory Cambridge, MA 02139 jakiela@mit.edu
Venue:
Evolutionary Computation
Year:
1995

Citing 7
Cited 11

Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Adaptive Selection Methods for Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms
Bin Packing with Adaptive Search

Proceedings of the 1st International Conference on Genetic Algorithms
Compaction of Symbolic Layout Using Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms
Parallel Genetic Packing of Rectangles

PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Genetic algorithms as function optimizers

Genetic algorithms as function optimizers

A Review of the Application ofMeta-Heuristic Algorithms to 2D Strip Packing Problems

Artificial Intelligence Review
Layout of Two Dimensional Irregular Shapes Using Genetic Algorithms

Proceedings of the 14th International conference on Industrial and engineering applications of artificial intelligence and expert systems: engineering of intelligent systems
Resource-Based Fitness Sharing

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Evolutionary and adaptive synthesis methods

Formal engineering design synthesis
Optimal nesting of species for exact cover of resources: two against many

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Optimal Nesting of Species for Exact Cover: Many against Many

Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Mathematical model and efficient algorithms for object packing problem

Computational Geometry: Theory and Applications
A hybrid genetic algorithm for the cut order planning problem

IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
Irregular Packing Using the Line and Arc No-Fit Polygon

Operations Research
NP-completeness and the coevolution of exact set covers

Proceedings of the 15th annual conference on Genetic and evolutionary computation
Algorithms for nesting with defects

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.