Optimization of Operation Sequence in CNC Machine Tools Using Genetic Algorithm

被引:18
作者
Abu Qudeiri, Jaber [1 ]
Yamamoto, Hidehiko [1 ]
Ramli, Rizauddin [1 ]
机构
[1] Gifu Univ, Intelligent Mfg Syst Lab, Gifu 5011193, Japan
来源
JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING | 2007年 / 1卷 / 02期
关键词
NC Program; Tool Path; Operations Sequence; Genetic Algorithm; TSP;
D O I
10.1299/jamdsm.1.272
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
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. Many cutting processes machined by CNC machine tools. In this paper, we attempt to find an efficient solution approach to determine the best sequence of operations for a set of operations that located in asymmetrical locations and different levels. In order to find the best sequence of operations that achieves the shortest cutting tool travel path (CTTP), genetic algorithm is introduced. After the sequence is optimized, the G-codes that use to code for the travel time 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.
引用
收藏
页码:272 / 282
页数:11
相关论文
共 18 条
  • [1] Optimization hole-cutting operations sequence in CNC machine tools using GA
    Abu Qudeiri, Jaber E.
    Raid, Ai-Momani
    Jamali, Mohamed Anouar
    Yamamoto, Hidehehiko
    [J]. 2006 INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1 AND 2, PROCEEDINGS, 2006, : 501 - 506
  • [2] [Anonymous], 1987, SIMULATED ANNEALING
  • [3] [Anonymous], P INT C ART NEUR NET
  • [4] Toolpath optimization for minimizing airtime during machining
    Castelino, K
    D'Souza, R
    Wright, PK
    [J]. JOURNAL OF MANUFACTURING SYSTEMS, 2003, 22 (03) : 173 - 180
  • [5] Automated microplanning for 2.5-D pocket machining
    D'Souza, R
    Wright, P
    Séquin, C
    [J]. JOURNAL OF MANUFACTURING SYSTEMS, 2001, 20 (04) : 288 - 296
  • [6] A PARALLEL TABU SEARCH ALGORITHM FOR LARGE TRAVELING SALESMAN PROBLEMS
    FIECHTER, CN
    [J]. DISCRETE APPLIED MATHEMATICS, 1994, 51 (03) : 243 - 267
  • [7] Garey MR, 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
  • [8] MINIMIZING WALLPAPER WASTE .1. CLASS OF TRAVELING SALESMAN PROBLEMS
    GARFINKEL, RS
    [J]. OPERATIONS RESEARCH, 1977, 25 (05) : 741 - 751
  • [9] GREFENSTETTE BJ, 1985, P 2 INT C GEN ALG
  • [10] An effective implementation of the Lin-Kernighan traveling salesman heuristic
    Helsgaun, K
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 126 (01) : 106 - 130