TY - GEN
T1 - Metal cutting with hybrid genetic algorithm
AU - Tang, Kwok-Wah
AU - Tang, Wallace Kit-Sang
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
KW - Genetic algorithm
KW - Heuristic approach
KW - Metal cutting
UR - http://www.scopus.com/inward/record.url?scp=33845334828&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-33845334828&origin=recordpage
U2 - 10.1109/INDIN.2005.1560465
DO - 10.1109/INDIN.2005.1560465
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 0780390946
SN - 9780780390942
VL - 2005
SP - 735
EP - 739
BT - 2005 3rd IEEE International Conference on Industrial Informatics, INDIN
T2 - 2005 3rd IEEE International Conference on Industrial Informatics, INDIN
Y2 - 10 August 2005 through 12 August 2005
ER -