Abstract | ||
---|---|---|
This paper is concerned with the Multi-Objective Next Release Problem (MONRP), a problem in search-based requirements engineering. Previous work has considered only single objective formulations. In the multi-objective formulation, there are at least two (possibly conflicting) objectives that the software engineer wishes to optimize. It is argued that the multi-objective formulation is more realistic, since requirements engineering is characterised by the presence of many complex and conflicting demands, for which the software engineer must find a suitable balance. The paper presents the results of an empirical study into the suitability of weighted and Pareto optimal genetic algorithms, together with the NSGA-II algorithm, presenting evidence to support the claim that NSGA-II is well suited to the MONRP. The paper also provides benchmark data to indicate the size above which the MONRP becomes non--trivial. |
Year | DOI | Venue |
---|---|---|
2007 | 10.1145/1276958.1277179 | GECCO |
Keywords | Field | DocType |
requirements engineering,conflicting demand,single objective formulation,search-based requirements engineering,multi-objective next release problem,benchmark data,software engineer,multi-objective formulation,pareto optimal genetic algorithm,nsga-ii algorithm,empirical study,software engineering,requirement engineering,genetic algorithm | Mathematical optimization,Computer science,Requirements engineering,Pareto optimal,Software,Single objective,Empirical research,Genetic algorithm | Conference |
Citations | PageRank | References |
114 | 3.19 | 16 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yuanyuan Zhang | 1 | 600 | 17.33 |
Mark Harman | 2 | 10264 | 389.82 |
S. Afshin Mansouri | 3 | 649 | 19.68 |