A particle swarm optimization approach for large-scale many-objective software architecture recovery

被引:5
作者
Prajapati, Amarjeet [1 ]
机构
[1] Jaypee Inst Informat Technol, Comp Sci Engn & IT, Noida, India
关键词
Software architecture; PSO; Metaheuristic; Large-scale optimization; Many -objective optimization; EVOLUTIONARY ALGORITHMS;
D O I
10.1016/j.jksuci.2021.08.027
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The software systems with a well-documented architecture are easy to understand and evolve. However, in most cases, either the documented architecture is unavailable or get eroded badly. In these cases, to understand and evolve the software systems, developers often need to recover the architectural compo-nents from the system implementation code. Recently, a variety of heuristic-based multi-objective opti-mization algorithms (MoOAs) for software architecture recovery (SAR) have been introduced. Most of the existing SAR approaches are designed by adopting the traditional MoOAs. However, the performance of such approaches degrades drastically with large-scale many-objective SAR (LSMaO-SAR). To address the challenges the MoOAs caused by the LSMaO-SAR, we introduce a large-scale many-objective particle swarm optimization (LSM-PSO) by customizing the framework of the PSO algorithm. For this, we adopt various strategies such as Balance Fitness Evaluation (BFE), Quality Indicator (QI) based fitness evalua-tion, Fuzzy-Pareto dominance (FPD), and Two-archive external storage, and incorporate into the PSO model. To test the effectiveness of the LSM-PSO, it is applied over five software projects and compared with the existing SAR approaches. The results show that the proposed LSM-PSO outperforms the existing optimization-based SAR approaches.(c) 2021 The Author. Published by Elsevier B.V. on behalf of King Saud University. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
引用
收藏
页码:8501 / 8513
页数:13
相关论文
共 65 条
[1]   Automatic Package Coupling and Cycle Minimization [J].
Abdeen, Hani ;
Ducasse, Stephane ;
Sahraoui, Houari ;
Alloui, Ilham .
16TH WORKING CONFERENCE ON REVERSE ENGINEERING (WCRE 2009), 2009, :103-+
[2]   Parallel multi-agent real-coded genetic algorithm for large-scale black-box single-objective optimisation [J].
Akopov, Andranik S. ;
Beklaryan, Levon A. ;
Thakur, Manoj ;
Verma, Bhisham Dev .
KNOWLEDGE-BASED SYSTEMS, 2019, 174 :103-122
[3]   D2MOPSO: MOPSO Based on Decomposition and Dominance with Archiving Using Crowding Distance in Objective and Solution Spaces [J].
Al Moubayed, N. ;
Petrovski, A. ;
McCall, J. .
EVOLUTIONARY COMPUTATION, 2014, 22 (01) :47-77
[4]   TA-ABC: Two-Archive Artificial Bee Colony for Multi-objective Software Module Clustering Problem [J].
Amarjeet ;
Chhabra, Jitender Kumar .
JOURNAL OF INTELLIGENT SYSTEMS, 2018, 27 (04) :619-641
[5]   Many-objective artificial bee colony algorithm for large-scale software module clustering problem [J].
Amarjeet ;
Chhabra, Jitender Kumar .
SOFT COMPUTING, 2018, 22 (19) :6341-6361
[6]   FP-ABC: Fuzzy-Pareto dominance driven artificial bee colony algorithm for many-objective software module clustering [J].
Amarjeet ;
Chhabra, Jitender Kumar .
COMPUTER LANGUAGES SYSTEMS & STRUCTURES, 2018, 51 :1-21
[7]  
Amarjeet, 2017, J KING SAUD UNIV-COM, V29, P349, DOI 10.1016/j.jksuci.2015.09.004
[8]   Harmony search based remodularization for object-oriented software systems [J].
Amarjeet ;
Chhabra, Jitender Kumar .
COMPUTER LANGUAGES SYSTEMS & STRUCTURES, 2017, 47 :153-169
[9]  
Amarjeet, 2014, INT CONF CONTEMP, P206, DOI 10.1109/IC3.2014.6897174
[10]   A hybrid firefly and particle swarm optimization algorithm for computationally expensive numerical problems [J].
Aydilek, Ibrahim Berkan .
APPLIED SOFT COMPUTING, 2018, 66 :232-249