DocumentCode
2792558
Title
Search Based Approaches to Component Selection and Prioritization for the Next Release Problem
Author
Baker, Paul ; Harman, Mark ; Steinhöfel, Kathleen ; Skaliotis, Alexandros
Author_Institution
Motorola Labs., Viables Estate, Basingstoke
fYear
2006
fDate
24-27 Sept. 2006
Firstpage
176
Lastpage
185
Abstract
This paper addresses the problem of determining the next set of releases in the course of software evolution. It formulates both ranking and selection of candidate software components as a series of feature subset selection problems to which search based software engineering can be applied. The approach is automated using greedy and simulated annealing algorithms and evaluated using a set of software components from the component base of a large telecommunications organization. The results are compared to those obtained by a panel of (human) experts. The results show that the two automated approaches convincingly outperform the expert judgment approach
Keywords
greedy algorithms; object-oriented programming; simulated annealing; software maintenance; software selection; feature subset selection problem; greedy algorithm; large telecommunications organization; next release problem; search based software engineering; simulated annealing algorithm; software component prioritization; software component selection; software evolution; software ranking; Educational institutions; Humans; Planing; Programming; Robustness; Simulated annealing; Software algorithms; Software engineering; Software systems; Software testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Maintenance, 2006. ICSM '06. 22nd IEEE International Conference on
Conference_Location
Philadelphia, PA
ISSN
1063-6773
Print_ISBN
0-7695-2354-4
Type
conf
DOI
10.1109/ICSM.2006.56
Filename
4021335
Link To Document