Ant colony optimization (ACO) algorithm for CNC route problem

Wan Nur Farhanah , Wan Zakaria (2012) Ant colony optimization (ACO) algorithm for CNC route problem. Faculty of Electrical & Electronics Engineering, Universiti Malaysia Pahang.

Preview

PDF WAN_NUR_FARHANAH_BT_WAN_ZAKARIA.PDF Download (667kB)

Abstract

Printed Circuit Boards (PCB) have copper tracks connecting the holes where the components are placed. They are designed specially for each circuit and makes constructive very easy without any wires. The holes on the PCB had been drilled by using Computer Numerical Controlled (CNC) machines. However, the CNC machines do not choose the optimal route when completing their task and this caused the high cost problem on the machining. This project proposes a new optimization technique which applies ant behavior, for finding the optimal route in PCB holes drilling process. The amount of phenomenon on the shortest path proves that ACO-based approach is capable to optimize the route taken for CNC machine in order to drill the holes on PCB. This project is about to develop a software which applying ACO algorithm in order to calculate the shortest path available that can reduce the time taken to drill the entire hole of PCB. The GUT will be display the shortest path that should be taken by user and give user authority to manipulate the coordinate based on the requirement.

Item Type:	Undergraduates Project Papers
Additional Information:	Project paper (Bachelor of Electrical Engineering (Electronics)) -- Universiti Malaysia Pahang - 2012
Uncontrolled Keywords:	Pattern recognition systems Mathematical optimization Ants Behavior Mathematical models
Subjects:	T Technology > TK Electrical engineering. Electronics Nuclear engineering
Faculty/Division:	Faculty of Electrical & Electronic Engineering
Depositing User:	nurudin nasir
Date Deposited:	17 Dec 2014 01:14
Last Modified:	17 Jun 2021 01:30
URI:	http://umpir.ump.edu.my/id/eprint/7739
Download Statistic:	View Download Statistics

Actions (login required)

View Item