A modified genetic algorithm for software clustering problem

  • Authors:
  • Ali Asghar Pourhaji Kazem;Shariar Lotfi

  • Affiliations:
  • Computer Department, Islamic Azad University of Tabriz, Tabriz, Iran;Computer Science Department, Islamic Azad University of Tabriz, Tabriz, Iran

  • Venue:
  • AIC'06 Proceedings of the 6th WSEAS International Conference on Applied Informatics and Communications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Structure of most software systems is large and complex. Therefore, understanding of these software systems structures is difficult. The reason for this complexity is dependency of many modules of them to each other. Software clustering is the process that divides software systems into meaningful partitions. Software clustering algorithms try to find near optimal partitions from the extraordinarily large space of possible partitions. According to large space of possible partitions software clustering problem is NP-Hard. Genetic algorithms can be use for this kind of problems. In this paper, a modified genetic algorithm, proposed for software clustering. Results of proposed algorithm show that it works better than other genetic software clustering algorithms.