期刊名称：International Journal of Hybrid Information Technology
印刷版ISSN：1738-9968
出版年度：2015
卷号：8
期号：9
页码：121-130
DOI：10.14257/ijhit.2015.8.9.13
出版社：SERSC
摘要：Combinatorial testing can effectively detect the faults triggered by interactions among the various factors in software system. Harmony Search Algorithm (HS), which is a new optimization algorithm and has been widely applied in the fields of portfolio design, repeatedly adjusts the solution variables in harmony memory to reach the optimum. In order to improve the convergence speed of HS, we propose an improved HS algorithm (IHS) and uses one-test-at-a-time strategy to generate a set of optimum initial solutions in IHS. To avoid the algorithm falling into local optima, we dynamically adjust the values of HMCR and PAR in the new algorithm. Compared to some existing algorithms and tools, the improved harmony search algorithm performs more stably and efficiently in generating optimum combinatorial test cases.
