DocumentCode
1966557
Title
A method of combinatorial test cases generating based on CMA-PGA model
Author
Pei, Tian ; Jiancheng, Wang ; Xiaojing, Xi ; Yingmei, Li
Author_Institution
Inf. Eng. Sch., Commun. Univ. of China, Beijing, China
Volume
2
fYear
2010
fDate
10-11 July 2010
Firstpage
249
Lastpage
251
Abstract
Aiming at shortening the design time of the optimal test cases, a model of Collaborative Multi-Agent based on Parallel Genetic Algorithm (CMA-PGA) is put forward, which is to be used in combinatorial testing of the software system. Because of the competition and coordination mechanisms especially designed in CMA-PGA, the convergence rate of this model outperforms that of simple genetic algorithm in evolving the optimum or near-optimum solution.
Keywords
combinatorial mathematics; convergence; genetic algorithms; multi-agent systems; parallel algorithms; program testing; CMA-PGA; collaborative multi-agent; combinatorial testing; convergence rate; parallel genetic algorithm; Electronics packaging; Gallium arsenide; Genetics; Servers; Combinatorial testing; Cooperative Multi-Agent (CMA); Parallel Genetic Algorithm (PGA); Test cases;
fLanguage
English
Publisher
ieee
Conference_Titel
Industrial and Information Systems (IIS), 2010 2nd International Conference on
Conference_Location
Dalian
Print_ISBN
978-1-4244-7860-6
Type
conf
DOI
10.1109/INDUSIS.2010.5565697
Filename
5565697
Link To Document