Learning from evolved next release problem instances

Release Time:2019-03-12  Hits:

Indexed by: Conference Paper

Date of Publication: 2014-07-12

Included Journals: Scopus、EI

Page Number: 189-190

Abstract: Taking the Next Release Problem (NRP) as a case study, we intend to analyze the relationship between heuristics and the software engineering problem instances. We adopt an evolutionary algorithm to evolve NRP instances that are either hard or easy for the target heuristic (GRASP in this study), to investigate where a heuristic works well and where it does not, when facing a software engineering problem. Thereafter, we use a feature-based approach to predict the hardness of the evolved instances, with respect to the target heuristic. Experimental results reveal that, the proposed algorithm is able to evolve NRP instances with different hardness. Furthermore, the problem-specific features enables the prediction of the target heuristic's performance.

Prev One:多电网调峰负荷分配问题的目标函数选取与求解

Next One:Misleading classification