Optimization Hole-Cutting Operations Sequence in CNC Machine Tools Using GA
Optimization Hole-Cutting Operations Sequence in CNC Machine Tools Using GA
复制标题
DOI：
10.1109/icsssm.2006.320513
复制
发表时间：
2006-10
期刊：
影响因子：
--
通讯作者：
Jaber E. Abu Qudeiri;Al-momani Raid;M. Jamali;Hidehiko Yamamoto
中科院分区：
文献类型：
--
作者：
Jaber E. Abu Qudeiri;Al-momani Raid;M. Jamali;Hidehiko Yamamoto
采用微机为基础的CAD/CAM系统生成数控程序，大大提高了机床的生产率。目前，许多商业CAD/CAM软件包，提供自动数控编程已经开发和应用于各种切削加工。由CNC机床加工的切削过程之一是孔切削操作（HCO）。在本文中，我们试图找到一个有效的解决方法，以确定最佳的操作顺序，为一组孔位于非对称的位置和不同的水平。为了寻找最短刀具行程路径，引入了遗传算法。在对CTTP进行优化后，生成了用于编写该工艺部分程序的G代码。CTTP可以被表述为旅行商问题（TSP）的一个特例。将遗传算法与TSP相结合，可以在商业CAD/CAM软件包中实现NC程序自动生成过程中的CTTP优化
The productivity of machine tools is significantly improved by using microcomputer based CAD/CAM systems for NC program generation. Currently, many commercial CAD/CAM packages that provide automatic NC programming have been developed and applied to various cutting processes. One of the cutting processes machined by CNC machine tools is hole-cutting operations (HCO). In this paper, we attempt to find an efficient solution approach to determine the best sequence of operations for a set of holes that located in asymmetrical locations and different levels. In order to find the HCO that achieves the shortest cutting tool travel path (CTTP), Genetic algorithm is introduced. After the CTTP is optimized, the G-codes that use to code the part of program for this process is created. CTTP can be formulated as a special case of the traveling salesman problem (TSP). The incorporation of genetic algorithm and TSP can be included in the commercial CAD/CAM packages to optimize the CTTP during automatic generation of NC programs