Generation of Pairwise Test Sets Using a Novel DPSO Algorithm

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 113)


The pairwise test suite generation is one of key issues of combinatorial testing. This paper presents a novel discrete particle swarm optimization algorithm (DPSO) to generate pairwise test data of combinatorial testing. In the algorithm, a particle represents a test suite, fitness function is evaluated by the uncovered number of combination pair, and the position of the particle is produced by stochastic algorithm, which is randomly generated by the frequency of discrete values of all factors in test suite, then optimal test suite which covers all combination pairs is generated. Finally, the classic example is used to illustrate the performance of the proposed algorithm. Compared with the existing algorithms, this paper provides an effective pairwise test suite generation method which has nothing to do with the initial value and can generate the most effective test suit with fast convergence, less calculation and stability.


Combinatorial testing Discrete particle swarm optimization algorithm Test case generation 



This work was supported in part by project “Research on Key Problem of Combinatorial Software Testing optimization Based on Swarm Intelligence” (61050003) from National Natural Science Foundation of China, by project “Smart Combinatorial Soft Testing method “ (ZL2009-9) from Natural Science Foundation of XUPT, by project “Smart Combinatorial Embedded Soft Testing Platform” (2009K08-26) from Key Technologies R and D Programmed Foundation of Shan xi Province.


  1. 1.
    Kennedy J, Eberhart R (1945) Particle swarm optimization. Proc IEEE Int Conf Neural Netw 4:1942–1948CrossRefGoogle Scholar
  2. 2.
    Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm optimization. Proc Conf Syst Man Cybern 5:4104–4109Google Scholar
  3. 3.
    Zha R-J, Zhang D-P (2010) Test data generation algorithms of combinatorial testing and comparison based on cross-entropy and particle swarm optimization method. Chinese J Comput 10(33):1896–1908CrossRefGoogle Scholar
  4. 4.
    Mandl R (1985) Orthogonal latin squares: an application of experiment design to compiler testing. Commun ACM 28(10):1054–1058 OctoberCrossRefGoogle Scholar
  5. 5.
    Cohen DM, Dalal SR, Fredman ML, Patton GC (1997) The AETG system: an approach to testing based on combinatorial design. IEEE Trans Softw Eng 23(7):437–444CrossRefGoogle Scholar
  6. 6.
    Lei Y, Tai KC (1998) A test generation strategy for pairwise testing. In: Proceedings of the 3rd IEEE high-assurance systems engineering symposium, pp 254–261Google Scholar
  7. 7.
    McCaffrey JD (2009) Generation of pairwise test sets using a genetic algorithm. In: Proceedings of the 2009 33rd annual IEEE international computer software and applications conference, pp 625–628Google Scholar
  8. 8.
    Li K, Yang Z (2008) Generating method of pair-wise covering test data based on ACO 2008 international workshop on education technology and training, pp 776–780Google Scholar
  9. 9.
    McCaffrey JD (2009) Generation of pairwise test sets using a simulated Bee colony algorithm IEEE IRI 2009, 10–12 July, pp 115–120Google Scholar
  10. 10.
    Lei Y, Tai KC (2002) A test generation strategy for pair-wise testing. IEEE Trans Softw Eng 28(1):109–111CrossRefGoogle Scholar
  11. 11.
    Sun J, Wang S (2010) A novel chaos discrete particle swarm optimization algorithm for test suite reduction. In: Proceedings of 2010 2nd international conference on information science and engineering (ICISE), pp 1–4Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2012

Authors and Affiliations

  1. 1.School of Computer Science and TechnologyXi’an University of Post and TelecommunicationsXi’anChina
  2. 2.Institute of Visualization TechnologyNorthwest UniversityXi’anChina

Personalised recommendations