COMPARISON OF THE SUCCESS OF META-HEURISTIC ALGORITHMS IN TOOL PATH PLANNING OF COMPUTER NUMERICAL CONTROL MACHINE

ÇAŞKA S., Gök K., Gök A.

Surface Review and Letters, cilt.29, sa.9, 2022 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 29 Sayı: 9
  • Basım Tarihi: 2022
  • Doi Numarası: 10.1142/s0218625x22501268
  • Dergi Adı: Surface Review and Letters
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Aerospace Database, Chemical Abstracts Core, Chimica, Communication Abstracts, Compendex, Metadex, Civil Engineering Abstracts
  • Anahtar Kelimeler: Computer numerical control machine, genetic algorithms, particle swarm optimization, grey wolf optimizer, travelling salesman problem
  • Manisa Celal Bayar Üniversitesi Adresli: Evet

Özet

Carrying out an engineering process with the least cost and within the shortest time is the basic purpose in many fields of industry. In Computer Numerical Control (CNC) machining, performing a process by following a certain order reduces cost and time of the process. In the literature, there are research works involving varying methods that aim to minimize the length of the CNC machine tool path. In this study, the trajectory that the CNC machine tool follows while drilling holes on a plate was discussed within the Travelling Salesman Problem (TSP). Genetic Algorithms (GA), Particle Swarm Optimization (PSO), and Grey Wolf Optimizer (GWO) methods were used to solve TSP. The case that the shortest tool path was obtained was determined by changing population size parameter in GA, PSO, and GWO methods. The results were presented in tables.