TY - GEN
T1 - GA support system to optimize the sequence of multi-level and multi-tool operations in CNC machines
AU - Qudeiri, Jaber E.Abu
AU - Khadra, Fayiz Y.Abu
AU - Al-Ahmari, Abdulrahman
PY - 2013
Y1 - 2013
N2 - The objective of all manufacturers is to produce high-quality products at reasonable prices. In high-volume mass production systems, optimizing the operation sequence (OS) not only reduces product cost but also increases production efficiency. An optimal OS can be achieved by trimming unnecessary segments of motion from the tool path (TP), which reduces production time. Currently, a computer numerical control (CNC) program can be generated for a given TP by the number of automatic programing packages (APPs) that are currently available. However, TP optimization is not included in most APPs. In this study, we propose genetic algorithms (GAs) to determine the optimal OS for the TP pass through a set of operations located asymmetrically in multiple levels and using one or more cutting tools. Then, the CNC program of the TP will be generated. The traveling salesman problem is introduced to define the OS problem. A GA based on the TSP formulation can determine the OS that achieves the shortest TP. The incorporation of a GA and TSP can be integrated into the APP for TP optimization before creating CNC programs.
AB - The objective of all manufacturers is to produce high-quality products at reasonable prices. In high-volume mass production systems, optimizing the operation sequence (OS) not only reduces product cost but also increases production efficiency. An optimal OS can be achieved by trimming unnecessary segments of motion from the tool path (TP), which reduces production time. Currently, a computer numerical control (CNC) program can be generated for a given TP by the number of automatic programing packages (APPs) that are currently available. However, TP optimization is not included in most APPs. In this study, we propose genetic algorithms (GAs) to determine the optimal OS for the TP pass through a set of operations located asymmetrically in multiple levels and using one or more cutting tools. Then, the CNC program of the TP will be generated. The traveling salesman problem is introduced to define the OS problem. A GA based on the TSP formulation can determine the OS that achieves the shortest TP. The incorporation of a GA and TSP can be integrated into the APP for TP optimization before creating CNC programs.
KW - TSP
KW - genetic algorithm
KW - multi-level operations
KW - multi-tool
KW - operation sequence
UR - http://www.scopus.com/inward/record.url?scp=84885974717&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84885974717&partnerID=8YFLogxK
U2 - 10.1109/SNPD.2013.54
DO - 10.1109/SNPD.2013.54
M3 - Conference contribution
AN - SCOPUS:84885974717
SN - 9780769550053
T3 - SNPD 2013 - 14th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing
SP - 231
EP - 236
BT - SNPD 2013 - 14th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing
T2 - 14th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2013
Y2 - 1 July 2013 through 3 July 2013
ER -