{"title":"用进化算法求解软件模块聚类问题","authors":"Kata Praditwong","doi":"10.1109/JCSSE.2011.5930112","DOIUrl":null,"url":null,"abstract":"Well organized software is easy to maintain but software modularization is complicated because of the number of modules. Automated software module clustering is transformed to a search-based problem. This paper describes the experiments on real-world problems of software module clustering by metaheuristic search methods such as genetic algorithms. This paper introduces the Grouping Genetic Algorithm (GGA) to the benchmarks. The fitness function measures a module granularity which is cohesion and coupling. Empirical result reports that the GGA outperforms a genetic algorithm with string representation.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"42","resultStr":"{\"title\":\"Solving software module clustering problem by evolutionary algorithms\",\"authors\":\"Kata Praditwong\",\"doi\":\"10.1109/JCSSE.2011.5930112\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Well organized software is easy to maintain but software modularization is complicated because of the number of modules. Automated software module clustering is transformed to a search-based problem. This paper describes the experiments on real-world problems of software module clustering by metaheuristic search methods such as genetic algorithms. This paper introduces the Grouping Genetic Algorithm (GGA) to the benchmarks. The fitness function measures a module granularity which is cohesion and coupling. Empirical result reports that the GGA outperforms a genetic algorithm with string representation.\",\"PeriodicalId\":287775,\"journal\":{\"name\":\"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"42\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JCSSE.2011.5930112\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCSSE.2011.5930112","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Solving software module clustering problem by evolutionary algorithms
Well organized software is easy to maintain but software modularization is complicated because of the number of modules. Automated software module clustering is transformed to a search-based problem. This paper describes the experiments on real-world problems of software module clustering by metaheuristic search methods such as genetic algorithms. This paper introduces the Grouping Genetic Algorithm (GGA) to the benchmarks. The fitness function measures a module granularity which is cohesion and coupling. Empirical result reports that the GGA outperforms a genetic algorithm with string representation.