An estimation of distribution algorithm based on interactions between requirements to solve the bi-objective Next Release Problem

Selecting the appropriate requirements to develop in the next release of an open market software product under evolution, is a compulsory step of each software development project. This selection should be done by maximizing stakeholders’ satisfaction and minimizing development costs, while keeping...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:The Journal of systems and software Ročník 199; s. 111632
Hlavní autoři: del Sagrado, José, Sierra Ibañez, José Antonio, del Águila, Isabel M.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.05.2023
Témata:
ISSN:0164-1212, 1873-1228
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Selecting the appropriate requirements to develop in the next release of an open market software product under evolution, is a compulsory step of each software development project. This selection should be done by maximizing stakeholders’ satisfaction and minimizing development costs, while keeping constraints. In this work we investigate what is the requirements interactions impact when searching for solutions of the bi-objective Next Release Problem. In one hand, these interactions are explicitly included in two algorithms: a branch and bound algorithm and an estimation of distribution algorithm (EDA). And on the other, we study the performance of these not previously used solving approaches by applying them in several instances of small, medium and large size data sets. We find that interactions inclusion do enhance the search and when time restrictions exists, as in the case of the bi-objective Next Release Problem, EDAs have proven to be stable and reliable locating a large number of solutions on the reference Pareto front. •Requirements interactions have a profound impact when searching for solutions of the bi-objective Next Release Problem.•Interactions are explicitly included in a branch and bound algorithm, and in an estimation of distribution algorithm.•Interactions inclusion do enhance the search and when time restrictions exist, as in the case of the bi-objective Next Release Problem.•Estimation of Distribution Algorithms have proven to be stable and reliable locating solutions on the reference Pareto front.
ISSN:0164-1212
1873-1228
DOI:10.1016/j.jss.2023.111632