%0 Book Section %1 noKey %A Karim, MuhammadRezaul %A Ruhe, Guenther %B Search-Based Software Engineering %D 2014 %E Le Goues, Claire %E Yoo, Shin %I Springer International Publishing %K product.planning release.planning %P 123-137 %R 10.1007/978-3-319-09940-8_9 %T Bi-objective Genetic Search for Release Planning in Support of Themes %U http://dx.doi.org/10.1007/978-3-319-09940-8_9 %V 8636 %X Release planning is a mandatory part of incremental and iterative software development. For the decision about which features should be implemented next, the values of features need to be balanced with the effort and readiness of their implementation. Traditional planning looks at the sum of the values of individual and potentially isolated features. As an alternative idea, a theme is a meta-functionality which integrates a number of individual features under a joint umbrella. That way, possible value synergies from offering features in conjunction (theme-related) can be utilized. In this paper, we model theme-based release planning as a bi-objective (search-based) optimization problem. Each solution of this optimization problem balances the preference between individual and theme-based planning objectives. We apply a two-stage solution approach. In Phase 1, the existing Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is adapted. Subsequently, the problem of guiding the user in the set of non-dominated solutions is addressed in Phase 2. We propose and explore two alternative ways to select among the (potentially large number) Pareto-optimal solutions. The applicability and empirical analysis of the proposed approach is evaluated for two explorative case study projects having 50 resp. 25 features grouped around 8 resp. 5 themes. %@ 978-3-319-09939-2

@incollection{noKey, abstract = {Release planning is a mandatory part of incremental and iterative software development. For the decision about which features should be implemented next, the values of features need to be balanced with the effort and readiness of their implementation. Traditional planning looks at the sum of the values of individual and potentially isolated features. As an alternative idea, a theme is a meta-functionality which integrates a number of individual features under a joint umbrella. That way, possible value synergies from offering features in conjunction (theme-related) can be utilized. In this paper, we model theme-based release planning as a bi-objective (search-based) optimization problem. Each solution of this optimization problem balances the preference between individual and theme-based planning objectives. We apply a two-stage solution approach. In Phase 1, the existing Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is adapted. Subsequently, the problem of guiding the user in the set of non-dominated solutions is addressed in Phase 2. We propose and explore two alternative ways to select among the (potentially large number) Pareto-optimal solutions. The applicability and empirical analysis of the proposed approach is evaluated for two explorative case study projects having 50 resp. 25 features grouped around 8 resp. 5 themes.}, added-at = {2015-06-18T11:10:48.000+0200}, author = {Karim, MuhammadRezaul and Ruhe, Guenther}, biburl = {https://www.bibsonomy.org/bibtex/2af426b77a4cb0df8648be25b11d9ebd4/ispma}, booktitle = {Search-Based Software Engineering}, doi = {10.1007/978-3-319-09940-8_9}, editor = {Le Goues, Claire and Yoo, Shin}, interhash = {5a17a71dc9c1a1a0fef68ef9f5350eb4}, intrahash = {af426b77a4cb0df8648be25b11d9ebd4}, isbn = {978-3-319-09939-2}, keywords = {product.planning release.planning}, language = {English}, pages = {123-137}, publisher = {Springer International Publishing}, series = {Lecture Notes in Computer Science}, timestamp = {2015-06-18T11:10:48.000+0200}, title = {Bi-objective Genetic Search for Release Planning in Support of Themes}, url = {http://dx.doi.org/10.1007/978-3-319-09940-8_9}, volume = 8636, year = 2014 }