Evolutionary Computation and Metaheuristics - Automatic Generation of Combinatorial Test Data - page 57

32. McCaffrey, J.D.: Generation of pairwise test sets using a genetic algorithm. In: Proceedings of
the 33rd Annual IEEE International Computer Software and Applications Conference (COMP-
SAC), Vol. 1, pp. 626-631 (2009)
33. McCaffrey, J.D.: Generation of pairwise test sets using a simulated bee colony algorithm. In:
Proceedings of the IEEE International Conference on Information Reuse and Integration (IRI)
pp. 115-119, IEEE (2009)
34. McCaffrey, J.D.: An empirical study of pairwise test set generation using a genetic algorithm. In:
Proceedings of the 7th International Conference on Information Technology: New Generations
(ITNG), pp. 992-997, (2010)
35. Mitchell, M.: An Introduction to Genetic Algorithms. The MIT Press, Cambridge (1998)
36. Nie, C., Wu, H., Liang, Y., Leung, H., Kuo, F.-C., Li, Z.: Search based combinatorial testing.
In: Proceedings of the Asia-Pacific Software Engineering Conference (APSEC), pp. 778-783
(2012)
37. Nurmela, K.J.: Upper bounds for covering arrays by tabu search. Discret. Appl. Math. 138 (1-2),
143-152 (2004)
38. Pedersen, M.E.H.: Good parameters for particle swarm optimization. Hvass Laboratories Tech-
nical Report HL1001 (2010). http://www.hvass-labs.org
39. Pham, D.T., Ghanbarzadeh, A., Koc, E., Otri, S., Rahim, S., Zaidi, M.: The Bees algorithm—a
novel tool for complex optimisation problems. In: Proceedings of IPROMS Conference, pp.
454-461 (2006)
40. Reeves, C.R., Rowe, J.E.: Genetic Algorithms: Principles and Perspectives: A Guide to GA
Theory. Kluwer Academic, Dordrecht (2002)
41. Rodriguez-Cristerna, A., Torres-Jimenez, J.: A simulated annealingwith variable neighborhood
search approach to construct mixed covering arrays. Electron. Notes Discret. Math. 39 (1), 249-
256 (2012)
42. Shi, Y., Eberhart, R.C.: A modified particle swarm optimizer. In: Proceedings of IEEE Inter-
national Conference on Evolutionary Computation, pp. 69-73 (1998)
43. Shiba, T., Tsuchiya, T., Kikuno, T.: Using artificial life techniques to generate test cases for
combinatorial testing. In: Proceedings of the 28th Annual International Computer Software
and Applications Conference (COMPSAC), vol. 1, pp. 72-77 (2004)
44. Simon, D.: Evolutionary Optimization Algorithms. Wiley, Hoboken (2013)
45. Stardom, J.: Metaheuristics and the search for covering and packing arrays. Master's thesis,
Simon Fraser University, Canada (2001)
46. Stevens, B.: Transversal Covers and Packings, Ph.D. thesis, University of Toronto, Toronto,
Canada (1998)
47. Torres-Jimenez, J., Rodriguez-Tello, E.: Newbounds for binary covering arrays using simulated
annealing. Inf. Sci. 185 (1), 137-152 (2012)
48. Trelea, I.C.: The particle swarm optimization algorithm: convergence analysis and parameter
selection. Inf. Process. Lett. 85 (6), 317-325 (2003)
49. Walker II, R.A., Colbourn, C.J.: Tabu search for covering arrays using permutation vectors. J.
Stat. Planning Inf. 139 (1), 69-80 (2009)
50. Whitley, D.: An overview of evolutionary algorithms: practical issues and common pitfalls.
Inf. Softw. Technol. 43 (14), 817-831 (2001)
51. Zang, H., Zhang, S., Hapeshi, K.: A review of nature-inspired algorithms. J. Bionic Eng. 7 ,
S232-S237 (2010) (Suppl, Elsevier)