1 |
N. S. S. Mar and P. K. D. V. Yarlagadda, "Design and development of automatic visual inspection system for PCB manufacturing," Robotics and Computer-Integrated Manufacturing, vol. 27, no. 5, pp. 949-962, 2011.
DOI
|
2 |
H. J. Cho and T. H. Park, "Wavelet transform based image template matching for automatic component inspection," The International Journal of Advanced Manufacturing Technology, vol. 50, no. 17, pp. 1033-1039, 2010.
DOI
|
3 |
J. S. Lee and T. H. Park, "Identification of component packaging region for electronic Assembly system," Institute of Control, Robotics and Systems, vol. 2013, no. 5, pp. 562-563, 2013.
|
4 |
A. K. Jain, M. N. Murty, and P. J. Flynn, "Data clustering: a review," ACM Computing Surveys, vol. 31, no. 3, pp. 264-323, 1999.
DOI
|
5 |
T. Niknam, E. T. Fard, N. Pourjafarian, and A. Rousta, "An Efficient hybrid algorithm based on modified imperialist competitive algorithm and K-means for data clustering," Engineering Applications of Artificial Intelligence, vol. 24, no 2, pp. 306-317, 2011.
DOI
|
6 |
U. Maulik, "Genetic algorithm-based clustering technique," Pattern Recognition, vol. 33, no. 5, pp. 1455-1465, 2000.
DOI
|
7 |
J. Gu, "Efficient local search with search space smoothing: a case study of the traveling salesman problem (TSP)," Man and Cybernetics, vol. 24, no. 5, pp. 728-735, 1994.
DOI
|
8 |
M. Bellmore and G. Nemhauser, "The traveling-salesman problem: a survey," Operation Research, vol. 16, no. 6 pp. 538-558, 1968.
DOI
|
9 |
A. Otman and A. Jaafar, "A comparative study of adaptive crossover operators for genetic algorithms to resolve the traveling salesman problem," International Journal of Computer Applications, vol. 31, no. 11, pp. 49-57, 2011.
|
10 |
H. J. Lin, F. W. Yang, and Y. T. Kao, "An efficient GA-based clustering technique," Tamkang Journal of Science and Engineering, vol. 8, no. 2, pp. 113-122, 2005.
|
11 |
M. Laszlo and S. Mukherjee, "A genetic algorithm that exchanges neighboring centers for k-means clustering," Pattern Recognition, vol. 28, no. 16, pp. 2359-2366, 2007.
DOI
|
12 |
L. E. Agustin-Blas and S. Salcedo-Sanz, "A new grouping genetic algorithm for clustering problems," Expert Systems with Applications, vol. 39, no. 120, pp. 9695-9703, 2012.
DOI
|
13 |
H. K. Tsai and J. M. Yang, "Some issues of designing genetic algorithms for traveling salesman problems," Soft Computing, vol. 8, no. 8, pp. 689-697, 2003.
|
14 |
S. Yuan and B. Skinner, "A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms," European Journal of Operational Research, vol. 228, no. 7, pp. 72-82, 2013.
DOI
|
15 |
T. H. Park, H. J. Kim, and N. Kim, "Path planning of automated optical inspection machines for PCB assembly systems," International Journal of Control, Automation, and systems, vol. 4, no. 1, pp. 96-104, 2006.
|