1. Baskı devre kartı delim güzergâhlarının meta-sezgisel algoritmalar kullanılarak optimizasyonu.
- Author
-
KAYSAL, Kübra, HOCAOĞLU, Fatih Onur, and KAYSAL, Ahmet
- Abstract
In the drilling process of printed circuit boards, achieving the operation with the least cost depends on the distance travelled by the drilling route. In this study, an integrated method is proposed to carry out the drilling process with the least cost and high speed. In the proposed method, the positions of electronic circuit elements to be placed on the printed circuit board are detected using image processing techniques on a two-dimensional circuit image. Annealing Simulation, Particle Swarm Optimization and Ant Colony Algorithms have been used to solve the travelling salesman problem, and their performances have been examined. When comparing the test results of the obtained models, it is observed that the Ant Colony Algorithm, at the same iteration values, provides solutions with significantly shorter route lengths compared to Simulated Annealing and Particle Swarm Optimization algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF