%0 Journal Article
%T Particle Swarm Optimization with Complex Local Searching for Solving Optimal Moving Path for PCB
%A Mo Yuanbin
%A Xu Shuihua
%A Liu Jizhong
%J Advances in Mathematical and Computational Methods
%D 2011
%I 
%R 10.5729
%X It is important for printed circuit boards (PCB) programming system to find out theoptimal moving path. However, determining the optimal moving path is a NP-hard travelingsalesman problem (TSP). Up to now, the drilling path automatic generated by programming systemmay not be the optimal. Based on Particle Swarm Optimization (PSO) and Complex Method (MC),a novel algorithm, Particle Swarm Optimization with Complex local searching (PSOC), is proposedin the paper. Numerical computations and algorithm performance analysis show that the approachhas global searching capability and can give satisfactory solutions. The algorithm is applied infinding the optimal moving path for PCB. The results have demonstrated the effectiveness andefficiency of the approach.
%K Particle swarm optimization (PSO)
%K Method of complex (MC)
%K Printed circuit boards (PCB)
%K Optimal moving path
%K Traveling salesman problem (TSP).
%U http://www.ier-institute.org/2160-0635/v1/no1/034.pdf