Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three

Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distinguished features including an efficient heuristic to generate a good quality initial population, and a local search operator based on a fine tuned Simulated Annealing (SA) algorithm employing a carefully designed compound neighborhood. Its performance is investigated through extensive experimentation over well known benchmarks and compared with other state-of-the-art algorithms, showing improvements on some previous best-known results. Key words: Memetic Algorithms, Covering Arrays, Software Testing.

• Type: Conference
• Year: 2009
• Where: AE
• Authors: Eduardo Rodriguez-Tello, Jose Torres-Jimenez
• Keywords: AE 2009, Array Construction Problem, Artificial Intelligence, Memetic Algorithms, Quality Initial Population