Metal cutting with hybrid genetic algorithm
Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45) › 32_Refereed conference paper (with ISBN/ISSN) › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Title of host publication | 2005 3rd IEEE International Conference on Industrial Informatics, INDIN |
Pages | 735-739 |
Volume | 2005 |
Publication status | Published - 2005 |
Publication series
Name | |
---|---|
Volume | 2005 |
Conference
Title | 2005 3rd IEEE International Conference on Industrial Informatics, INDIN |
---|---|
Place | Australia |
City | Perth |
Period | 10 - 12 August 2005 |
Link(s)
Abstract
A hybrid genetic approach is proposed for the metal cutting process. Metal cutting can be modeled as a two-dimensional strip-packing problem with rotation allowed, and is known to be NP-complete. With a heuristic placement method, the complicated and highly constrained cutting problem is transformed into a simple permutation problem with a much smaller searching domain, solved by an order-based genetic algorithm. In our simulations, it is demonstrated that optimal results can be duly obtained in a reasonably short period of time. © 2005 IEEE.
Research Area(s)
- Genetic algorithm, Heuristic approach, Metal cutting
Citation Format(s)
Metal cutting with hybrid genetic algorithm. / Tang, Kwok-Wah; Tang, Wallace Kit-Sang.
2005 3rd IEEE International Conference on Industrial Informatics, INDIN. Vol. 2005 2005. p. 735-739 1560465.Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45) › 32_Refereed conference paper (with ISBN/ISSN) › peer-review