Route Planning Analysis In Holes Drilling Process Using Magnetic Optimization Algorithm For Electronic Manufacturing Sector
Ismail Mohd Muzafar, Mohd Azlishah Othman, Hamzah Asyrani Sulaiman, Maizatul Alice Meor Said, Mohamad Harris Misran, Ramlee Ridza Azri, Sinnappa Mohan, Zahriladha Zakaria, Badrul Hisham Ahmad, Abd Aziz Mohamad Zoinol Abidin, Khairuddin Osman, Sulaiman Siti Fatimah, Hazriq Izzuan Jaafar, J. Kamaruzaman, Nordin Nur Anis, Othman Mohd Hafiz, Saeala Muhammad Salihin, Adam Asrul, Noor Hafizah Amer, Zainal Abidin Amar Faiz · 2013
Electronic manufacturing sector uses computer numerical controlled machines for drilling holes. Most of the computer numerical controlled machines used nearest neighbour algorithm to plan the route for the drill bit to travel. Based on this motivation, this paper proposes an approach which is based on th e experimentation of Magnetic Optimization Algorithm. In this implementation, each magnetic agent or particle in Magnetic Optimization Algorithm represents a candidate solution of the problem. The magnitude of th e magnetic force between these particles is inversely proportional to the distance calculated by the solution they represented. Particles with greater magnetic force will attract other particles with relatively smaller magnetic force, towards it. The process is repeated until the stopping condition meets and the solution with lowest distance is taken as the best-found solution. Result obtained from the case study shows that the proposed