Volume 5 Number 2 (Feb. 2010)
Home > Archive > 2010 > Volume 5 Number 2 (Feb. 2010) >
JCP 2010 Vol.5(2): 258-265 ISSN: 1796-203X
doi: 10.4304/jcp.5.2.258-265

jcp0502-12

Kewen Li1, 2, Zilu Zhang1, and Jisong Kou2
1 College of Computer and Communication Engineering, China University of Petroleum, Dongying, Shandong, 257061, China
2 School of Management, Tianjin University, Tianjin,300072, China


Abstract—Software test is usually costly and vital in software development lifecycle. Though genetic algorithms have the globally searching capability, premature convergence and weak local optimization are two key problems existing in the conventional genetic algorithm. This paper introduces particle swarm optimization into genetic algorithm to breed software test data automatically. The GPSMA (Genetic-Particle Swarm Mixed Algorithm) uses the individual’s update mode to replace the mutation operation in genetic algorithm on the basis of population division. The experimental results show the new method can not only maintain effectively the polymorphism in the colony and avoid premature, but also greatly improve the convergent speed.

Index Terms—software test, data generation, mixed algorithm, particle swarm optimization, genetic algorithm

[PDF]

Cite: Kewen Li, Zilu Zhang, and Jisong Kou, " jcp0502-12," Journal of Computers vol. 5, no. 2, pp. 258-265, 2010.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Read more>>