Skip to Main content Skip to Navigation
Conference papers

Learning from evolved next release problem instances

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download
Contributor : Jifeng Xuan <>
Submitted on : Wednesday, November 26, 2014 - 10:31:45 AM
Last modification on : Thursday, February 21, 2019 - 10:52:55 AM
Long-term archiving on: : Friday, February 27, 2015 - 11:00:30 AM


Files produced by the author(s)



Zhilei Ren, He Jiang, Jifeng Xuan, Shuwei Zhang, Zhongxuan Luo. Learning from evolved next release problem instances. GECCO - Genetic and Evolutionary Computation Conference, 2014, ACM SIGEVO, Jul 2014, Vancouver, BC, Canada. pp.189 - 190, ⟨10.1145/2598394.2598427⟩. ⟨hal-01087436⟩



Record views


Files downloads