Test Point Selection Method Research Based on Genetic Algorithm and Binary Particle Swarm Optimization Algorithm

Conference paper
First Online:
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 334)

Abstract

Test point selection is the foundation of testability analysis and design. A minimal complete subset of genetic algorithm and binary particle swarm optimization algorithm is proposed to meet testability index requirements. Firstly, the mathematical model is established based on analyzing the testability problems. Then, the heuristic function is constructed to measure the pros and cons of the test set. Experimental results show that the algorithm can effectively overcome the deficiency of a single algorithm going into a local optimum and premature convergence, and improve the searching efficiency to obtain a global optimal solution quickly.

Keywords

Test point selection GABPSO algorithm Heuristic function 
This is a preview of subscription content, log in to check access.

References

  1. 1.
    Tian Z, Shi J. System testability design, analysis and verification. Beijing: Beijing University of Aeronautic and Astronautics Press; 2003. pp. 68–75.Google Scholar
  2. 2.
    Prasad VC, Rao Pinjala SN. Fast algorithms for selection of test nodes of an analog circuit using a generalized fault dictionary approach. Circuit Syst Signal Process. 1995;14(6):707–24.CrossRefMATHGoogle Scholar
  3. 3.
    Prasad VC, Babu NSC. Selection of test nodes of for analog fault diagnosis in dictionary approach. IEEE Trans Instrum Measur. 2000;49(6):1289–97.CrossRefGoogle Scholar
  4. 4.
    Pinjala KK, Bruce CK. An approach for selection of test points for analog fault diagnosis. Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems, IEEE; 2003. pp. 287–94.Google Scholar
  5. 5.
    Starzyk JA, Liu D, Liu Z-H, et al. Entropy-based optimum test nodes selection for analog fault dictionary techniques. IEEE Trans Instrum Measur. 2004;53(3):754–61.CrossRefGoogle Scholar
  6. 6.
    Kennedy J, Eberhart RC. A discrete binary version of the particle swarm algorithm. Proceedings of the World Multiconference on Systemics, Cybernetics and Informatics, IEEE; 1997. pp. 4104–9.Google Scholar
  7. 7.
    Chenlin Y, Shulin T, Bing L. Application of heuristic graph search to test points selection for analog fault dictionary techniques. IEEE Trans Instrum Measur. 2009;58(7):2145–58.CrossRefGoogle Scholar
  8. 8.
    Zhou M, Sun S. The theory and application of genetic algorithm. Beijing: National Defense of Industry Press; 1999. pp. 36–48.Google Scholar
  9. 9.
    Engelbrecht AP. Fundamentals of computational swarm intelligence. Hoboken: Wiley; 2009. pp. 46–64.Google Scholar
  10. 10.
    Ronghua J, Houjun W, Bing L. Test selection based on binary particle swarm optimization. J Electron Measur Instrum. 2008;22(2):11–5.Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Naval Aeronautical and Astronautical UniversityYantaiChina

Personalised recommendations