paper-with-me

Papers

Many-Objective Software Remodularization using NSGA-III

2020-05-13 · Mohamed Wiem Mkaouer, Marouane Kessentini, Adnan Shaout, Patrice Koligheu, Slim Bechikh, Kalyanmoy Deb, Ali Ouni

Software systems nowadays are complex and difficult to maintain due to continuous changes and bad design choices. To handle the complexity of systems, software products are, in general, decomposed in terms of packages/modules containing classes that are dependent. However, it is challenging to automatically remodularize systems to improve their maintainability. The majority of existing remodularization work mainly satisfy one objective which is improving the structure of packages by optimizing coupling and cohesion. In addition, most of existing studies are limited to only few operation types such as move class and split packages. Many other objectives, such as the design semantics, reducing the number of changes and maximizing the consistency with development change history, are important to improve the quality of the software by remodularizing it. In this paper, we propose a novel many-objective search-based approach using NSGA-III. The process aims at finding the optimal remodularization solutions that improve the structure of packages, minimize the number of changes, preserve semantics coherence, and re-use the history of changes. We evaluate the efficiency of our approach using four different open-source systems and one automotive industry project, provided by our industrial partner, through a quantitative and qualitative study conducted with software engineers.

📄 PDF Abstract BibTeX arXiv:2005.06510

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Runtime Analyses of NSGA-III on Many-Objective Problems

2024-04-17 · Andre Opris, Duc-Cuong Dang, Frank Neumann, Dirk Sudholt

NSGA-II and NSGA-III are two of the most popular evolutionary multi-objective algorithms used in practice. While NSGA-II is used for few objectives such as 2 and 3, NSGA-III is designed to deal with a larger number of ob…

A First Runtime Analysis of NSGA-III on a Many-Objective Multimodal Problem: Provable Exponential Speedup via Stochastic Population Update

2025-05-02 · Andre Opris

The NSGA-III is a prominent algorithm in evolutionary many-objective optimization. It is well-suited for optimizing functions with more than three objectives, setting it apart from the classic NSGA-II. However, theoretic…

GPU-accelerated Evolutionary Many-objective Optimization Using Tensorized NSGA-III

2025-04-08 · Hao Li, Zhenyu Liang, Ran Cheng

NSGA-III is one of the most widely adopted algorithms for tackling many-objective optimization problems. However, its CPU-based design severely limits scalability and computational efficiency. To address the limitations,…

Computational EfficiencyCPUEvolutionary AlgorithmsGPU

A Crowding Distance That Provably Solves the Difficulties of the NSGA-II in Many-Objective Optimization

2024-07-25 · Weijie Zheng, Yao Gao, Benjamin Doerr

Recent theoretical works have shown that the NSGA-II can have enormous difficulties to solve problems with more than two objectives. In contrast, algorithms like the NSGA-III or SMS-EMOA, differing from the NSGA-II only …

On the Impact of Crossover in Many-Objective Optimization: A Runtime Analysis of NSGA-III

2026-05-11 · Andre Opris arxiv

In recent years, a theoretical understanding has rapidly advanced regarding how popular multi-objective evolutionary algorithms (MOEAs) can optimize many-objective problems. However, the benefits of using crossover in ma…