Jul 2, 2024 · In the area of Search-Based Software Engineering, software engineering issues are formulated and tackled as optimization problems.

Since this problem has been demonstrated to be NP-hard, we propose a new heuristic algorithm based on the General Variable Neighborhood Search (GVNS) schema to ...

Mar 20, 2024 · As the nature of the problem is NP-hard, variable neighborhood search (VNS) meta-heuristic and mat-heuristic algorithms have been designed. For ...

We study two multi-objective optimization problems to evaluate the quality of the solutions to the SMCP, the Equal-size Cluster Approach (ECA) and the ...

General Variable Neighborhood Search for the optimization of software quality · List of references · Publications that cite this publication.

A feature selection model for software defect prediction using binary Rao optimization algorithm · Computer Science, Engineering. Applied Soft Computing · 2022.

In this work, we present an algorithm based on Variable Neighborhood Descent for the SMCP and study a novel quality metric, the Function of Complexity Balance, ...

To solve all targeted problem variants, we develop a two-phase general variable neighborhood search (GVNS) that applies an efficient move evaluation approach ...

The Software Module Clustering Problem (SMCP) is an optimization problem which objective is to find the most modular organization of software systems to ease ...

Cavero, S., Pardo, E.G., Duarte, A.: A general variable neighborhood search for the cyclic antibandwidth problem. Comput. Optim. Appl. 81, 657–687 (2022)