Fundamentals of algorithmics
An introduction to genetic algorithms
An introduction to genetic algorithms
Graph theory and its applications
Graph theory and its applications
Classical floorplanning harmful?
ISPD '00 Proceedings of the 2000 international symposium on Physical design
The irregular cutting-stock problem mdash; a new procedure for deriving the no-fit polygon
Computers and Operations Research
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithm Optimisation of Part Placement Using a Connection-Based Coding Method
IEA/AIE '02 Proceedings of the 15th international conference on Industrial and engineering applications of artificial intelligence and expert systems: developments in applied artificial intelligence
On genetic algorithms for shoe making nesting - A Taiwan case
Expert Systems with Applications: An International Journal
An innovative virtual-engineering system for supporting integrated footwear design
International Journal of Intelligent Engineering Informatics
New constructive algorithms for leather nesting in the automotive industry
Computers and Operations Research
Algorithms for nesting with defects
Discrete Applied Mathematics
| Hi-index | 0.00 |
The problem of placing a number of specific shapes in order to minimise waste is commonly encountered in the sheet metal, clothing and shoe-making industries. The paper presents genetic algorithm coding methodologies for the leather nesting problem which involves cutting shoe upper components from hides so as to maximise material utilisation. Algorithmic methods for computer-aided nesting can be either packing or connectivity driven. The paper discusses approaches to how both types of method can be realised using a local placement strategy whereby one shape at a time is placed on the surface. In each case the underlying coding method is based on the use of the no-fit polygon (NFP) that allows the genetic algorithm to evolve non-overlapping configurations. The packing approach requires that a local space utilisation measure is developed. The connectivity approach is based on an adaptive graph method. Coding techniques for dealing with some of the more intractable aspects of the leather nesting problem such as directionality constraints and surface grading quality constraints are also discussed. The benefits and drawbacks of the two approaches are presented.