A comparison of two memetic algorithms for software class modelling

  • Authors:
  • Jim Smith;Christopher L. Simons

  • Affiliations:
  • University of the West of England, Bristol, United Kingdom;University of the West of England, Bristol, United Kingdom

  • Venue:
  • Proceedings of the 15th annual conference on Genetic and evolutionary computation
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recent research has demonstrated that the problem of class modelling within early cycle object orientated software engineering can be successfully tackled by posing it as a search problem to be tackled with meta-heuristics. This "Search Based Software Engineering" approach has been illustrated using both Evolutionary Algorithms and Ant Colony Optimisation to perform the underlying search. Each has been shown to display strengths and weaknesses - both in terms of how easily "standard" algorithms can be applied to the domain, and of optimisation performance. This paper extends that work by considering the effect of incorporating Local Search. Specifically we examine the hypothesis that within a memetic framework the choice of global search heuristic does not significantly affect search performance, freeing the decision to be made on other more subjective factors. Results show that in fact the use of local search is not always beneficial to the Ant Colony Algorithm, whereas for the Evolutionary Algorithm with order based recombination it is highly effective at improving both the quality and speed of optimisation. Across a range of parameter settings ACO found its best solutions earlier than EAs, but those solutions were of lower quality than those found by EAs. For both algorithms we demonstrated that the number of constraints present, which relates to the number of classes created, has a far bigger impact on solution quality and time than the size of the problem in terms of numbers of attributes and methods.