Software module clustering using a Hyper-heuristic based Multi-objective Genetic Algorithm

被引:0
|
作者
Kumari, A. Charan [1 ]
Srinivas, K.
Gupta, M. P. [2 ]
机构
[1] Dayalbagh Educ Inst, Dept Phys & Comp Sci, Agra, Uttar Pradesh, India
[2] Indian Inst Technol, Dept Management Studies, New Delhi 110016, India
关键词
Search-based Software Engineering; Software Module Clustering; Multi-objective optimization; Hyper-heuristics; Reinforcement learning; Genetic Algorithm;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper presents a Fast Multi-objective Hyper-heuristic Genetic Algorithm (MHypGA) for the solution of Multi-objective Software Module Clustering Problem. Multi-objective Software Module Clustering Problem is an important and challenging problem in Software Engineering whose main goal is to obtain a good modular structure of the Software System. Software Engineers greatly emphasize on good modular structure as it is easier to comprehend, develop and maintain such software systems. In recent times, the problem has been converted into a Search-based Software Engineering Problem with multiple objectives. This problem is NP hard as it is an instance of Graph Partitioning and hence cannot be solved using traditional optimization techniques. The MHypGA is a fast and effective metaheuristic search technique for suggesting software module clusters in a software system while maximizing cohesion and minimizing the coupling of the software modules. It incorporates twelve low-level heuristics which are based on different methods of selection, crossover and mutation operations of Genetic Algorithms. The selection mechanism to select a low-level heuristic is based on reinforcement learning with adaptive weights. The efficacy of the algorithm has been studied on six real-world module clustering problems reported in the literature and the comparison of the results prove the superiority of the MHypGA in terms of quality of solutions and computational time.
引用
收藏
页码:813 / 818
页数:6
相关论文
共 50 条
  • [1] Hyper-heuristic approach for multi-objective software module clustering
    Kumari, A. Charan
    Srinivas, K.
    [J]. JOURNAL OF SYSTEMS AND SOFTWARE, 2016, 117 : 384 - 401
  • [2] A Multi-Objective Hyper-Heuristic Clustering Algorithm for Formulas in Traditional Chinese Medicine
    Shi, Wen
    Zhang, Jingyu
    Yu, Bin
    Li, Yibo
    Cheng, Shihui
    [J]. IEEE ACCESS, 2023, 11 : 100355 - 100370
  • [3] A Hyper-heuristic collaborative Multi-objective Evolutionary Algorithm
    Fritsche, Gian
    Pozo, Aurora
    [J]. 2018 7TH BRAZILIAN CONFERENCE ON INTELLIGENT SYSTEMS (BRACIS), 2018, : 354 - 359
  • [4] A multi-objective hyper-heuristic based on choice function
    Maashi, Mashael
    Oezcan, Ender
    Kendall, Graham
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2014, 41 (09) : 4475 - 4493
  • [5] A mixture experiments multi-objective hyper-heuristic
    Vazquez-Rodriguez, J. A.
    Petrovic, S.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2013, 64 (11) : 1664 - 1675
  • [6] A multi-objective hyper-heuristic algorithm based on adaptive epsilon-greedy selection
    Yang, Tailong
    Zhang, Shuyan
    Li, Cuixia
    [J]. COMPLEX & INTELLIGENT SYSTEMS, 2021, 7 (02) : 765 - 780
  • [7] A multi-objective hyper-heuristic algorithm based on adaptive epsilon-greedy selection
    Tailong Yang
    Shuyan Zhang
    Cuixia Li
    [J]. Complex & Intelligent Systems, 2021, 7 : 765 - 780
  • [8] A Hyper-heuristic Clustering Algorithm
    Tsai, Chun-Wei
    Song, Huei-Jyun
    Chiang, Ming-Chao
    [J]. PROCEEDINGS 2012 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2012, : 2839 - 2844
  • [9] Parallel Hyper-Heuristic Algorithm for Multi-Objective Route Planning in a Smart City
    Yao, Yuan
    Peng, Zhe
    Xiao, Bin
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2018, 67 (11) : 10307 - 10318
  • [10] Multi-objective Optimisation with a Sequence-based Selection Hyper-heuristic
    Walker, David J.
    Keedwell, Ed
    [J]. PROCEEDINGS OF THE 2016 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'16 COMPANION), 2016, : 81 - 82