z-logo
open-access-imgOpen Access
Multiple paths test data generation based on particle swarm optimisation
Author(s) -
Han Xuan,
Lei Hang,
Wang Yun-sheng
Publication year - 2017
Publication title -
iet software
Language(s) - English
Resource type - Journals
ISSN - 1751-8814
DOI - 10.1049/iet-sen.2016.0066
Subject(s) - particle swarm optimization , fitness function , position (finance) , path (computing) , mathematical optimization , population , fitness approximation , computer science , convergence (economics) , function (biology) , algorithm , mathematics , genetic algorithm , demography , finance , evolutionary biology , sociology , economics , biology , economic growth , programming language
Considering path coverage as the test adequacy criterion, a modified multiple paths test data generator based on particle swarm optimisation (MMPPSO) algorithm is proposed. During the particle swarm optimisation process, each particle tracks the individual best position and the global best position. For the multiple paths coverage problem, different fitness functions are applied to assess the individual best position and the global best position in MMPPSO. The weighted summation of those branch distance functions is designed as the single path fitness function. The fitness function for the individual best position is the minimum of those single path fitness functions, which guides particles converge to a specific path. The fitness function for the global best position is the summation of those single path fitness functions, which guides the population achieve multiple paths coverage and avoid the premature convergence. The experiments implemented on some benchmarks show that the authors’ approach is more effective and more efficient than other methods, especially for complicated programs and large target path sets.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here