The Application of Ant Colony Algorithm on Automatic Testing Path Optimization in Complex Circuits

With the maturation of a large number of bionic optimization algorithm, based on the analysis of the currently common path optimization algorithm, ant colony optimization algorithm is applied to the problem of path optimization of automatic testing in complex circuit. This paper established the relevant system models, designed the specific implementation scheme, and conducted the simulation and experiment of path optimization on moving probe tests in small circuits and complex circuits. The results show that the ant colony algorithm applied to path optimization is feasible and it is superior to the results of sequence testing on the testing speed and real-time testing ability.

[1]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[2]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[3]  Bruce C. Kim,et al.  A probe scheduling algorithm for MCM substrates , 1999, International Test Conference 1999. Proceedings (IEEE Cat. No.99CH37034).