A general genetic algorithm for one and two dimensional cutting and packing problems
Cutting and packing problems are combinatorial optimisation problems. The major interest in these problems is their practical significance, in manufacturing and other business sectors. In most manufacturing situations a raw material usually in some standard size has to be divided or be cut into smal...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Nelson Mandela Metropolitan University
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10948/555 http://hdl.handle.net/10948/d1011727 |