TY - JOUR
T1 - A comparative study on evolutionary multi-objective algorithms for next release problem
AU - Rahimi, Iman
AU - Gandomi, Amir H.
AU - Nikoo, Mohammad Reza
AU - Chen, Fang
N1 - Publisher Copyright:
© 2023 The Author(s)
DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.
PY - 2023/9/1
Y1 - 2023/9/1
N2 - The next release problem (NRP) refers to implementing the next release of software in the software industry regarding the expected revenues; specifically, constraints like limited budgets indicate that the total cost corresponding to the next software release should be minimized. This paper uses and investigates the comparative performance of nineteen state-of-the-art evolutionary multi-objective algorithms, including NSGA-II, rNSGA-II, NSGA-III, MOEAD, EFRRR, tDEA, KnEA, MOMBIII, SPEA2, RVEA, NNIA, HypE, ANSGA-III, BiGE, GrEA, IDBEA, SPEAR, SPEA2SDE, and MOPSO, that can tackle this problem. The problem was designed to maximize customer satisfaction and minimize the total required cost. Three indicators, namely hyper-volume (HV), spread, and runtime, were examined to compare the algorithms. Two types of datasets, i.e., classic and realistic data, from small to large scale, were also examined to verify the applicability of the results. Overall, NSGA-II exhibited the best CPU run time in all test scales, and, also, the results show that the HV and spread values of 1st and 2nd best algorithms (NNIA and SPEAR), for which most HV values for NNIA are bigger than 0.708 and smaller than 1, while the HV values for SPEAR vary between 0.706 and 0.708. Finally, the conclusion and direction for future works are discussed.
AB - The next release problem (NRP) refers to implementing the next release of software in the software industry regarding the expected revenues; specifically, constraints like limited budgets indicate that the total cost corresponding to the next software release should be minimized. This paper uses and investigates the comparative performance of nineteen state-of-the-art evolutionary multi-objective algorithms, including NSGA-II, rNSGA-II, NSGA-III, MOEAD, EFRRR, tDEA, KnEA, MOMBIII, SPEA2, RVEA, NNIA, HypE, ANSGA-III, BiGE, GrEA, IDBEA, SPEAR, SPEA2SDE, and MOPSO, that can tackle this problem. The problem was designed to maximize customer satisfaction and minimize the total required cost. Three indicators, namely hyper-volume (HV), spread, and runtime, were examined to compare the algorithms. Two types of datasets, i.e., classic and realistic data, from small to large scale, were also examined to verify the applicability of the results. Overall, NSGA-II exhibited the best CPU run time in all test scales, and, also, the results show that the HV and spread values of 1st and 2nd best algorithms (NNIA and SPEAR), for which most HV values for NNIA are bigger than 0.708 and smaller than 1, while the HV values for SPEAR vary between 0.706 and 0.708. Finally, the conclusion and direction for future works are discussed.
KW - Evolutionary algorithm
KW - Multi-objective
KW - Next release problem
KW - Software engineering
UR - http://www.scopus.com/inward/record.url?scp=85163166655&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85163166655&partnerID=8YFLogxK
UR - https://www.mendeley.com/catalogue/268d6723-3438-3a8f-92f3-31441d58f5f4/
U2 - 10.1016/j.asoc.2023.110472
DO - 10.1016/j.asoc.2023.110472
M3 - Article
AN - SCOPUS:85163166655
SN - 1568-4946
VL - 144
JO - Applied Soft Computing
JF - Applied Soft Computing
M1 - 110472
ER -