Unified Approach to Path Planning Algorithm for SMT Inspection Machines Considering Inspection Delay Time
暂无分享,去创建一个
[1] Javier Del Ser,et al. A new grouping genetic algorithm for clustering problems , 2012, Expert Syst. Appl..
[2] Michael J. Laszlo,et al. A genetic algorithm that exchanges neighboring centers for k-means clustering , 2007, Pattern Recognit. Lett..
[3] Cheng-Yan Kao,et al. Some issues of designing genetic algorithms for traveling salesman problems , 2004, Soft Comput..
[4] Shoudong Huang,et al. A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms , 2013, Eur. J. Oper. Res..
[5] Anil K. Jain,et al. Data clustering: a review , 1999, CSUR.
[6] Ujjwal Maulik,et al. Genetic algorithm-based clustering technique , 2000, Pattern Recognit..
[7] Tae-Hyoung Park,et al. Path planning of automatic optical inspection machines for PCB assembly systems , 2005, 2005 International Symposium on Computational Intelligence in Robotics and Automation.
[8] Tae-Hyoung Park,et al. Wavelet transform based image template matching for automatic component inspection , 2010 .
[9] Jaafar Abouchabaka,et al. A Comparative Study of Adaptive Crossover Operators for Genetic Algorithms to Resolve the Traveling Salesman Problem , 2011, ArXiv.
[10] Prasad K. Yarlagadda,et al. Design and development of automatic visual inspection system for PCB manufacturing , 2011 .
[11] Jun Gu,et al. Efficient Local Search With Search Space Smoothing: A Case Study of the Traveling Salesman Problem (TSP) , 1994, IEEE Trans. Syst. Man Cybern. Syst..
[12] Taher Niknam,et al. An efficient hybrid algorithm based on modified imperialist competitive algorithm and K-means for data clustering , 2011, Eng. Appl. Artif. Intell..
[13] George L. Nemhauser,et al. The Traveling Salesman Problem: A Survey , 1968, Oper. Res..