Abstract
Selecting a set of requirements to be included in the next software release, which has become to be known as the Next Release Problem, is an important issue in the iterative and incremental software development model. Since software development is performed under a dynamic environment, some requirements aspects, like importance and effort cost values, are highly subject to uncertainties, which should be taken into account when solving this problem through a search technique. Current robust approaches for dealing with these uncertainties are very conservative, since they perform the selection of the requirements considering all possible uncertainties realizations. Thereby, this paper presents an evolution of this robust model, exploiting the recoverable robust optimization framework, which is capable of producing recoverable solutions for the Next Release Problem. Several experiments were performed over synthetic and real-world instances, with all results showing that the recovery strategy handles well the conservatism and adds more quality to the robust solutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bagnall, A., Rayward-Smith, V., Whittley, I.: The next release problem. Information and Software Technology 43, 883–890 (2001)
Harman, M., Krinke, J., Ren, J., Yoo, S.: Search based data sensitivity analysis applied to requirement engineering. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 1681–1688. ACM (2009)
Zhang, Y.-Y., Finkelstein, A., Harman, M.: Search based requirements optimisation: Existing work and challenges. In: Rolland, C. (ed.) REFSQ 2008. LNCS, vol. 5025, pp. 88–94. Springer, Heidelberg (2008)
Beyer, H., Sendhoff, B.: Robust optimization–a comprehensive survey. Computer Methods in Applied Mechanics and Engineering 196, 3190–3218 (2007)
Bai, D., Carpenter, T., Mulvey, J.: Making a case for robust optimization models. Management Science 43, 895–907 (1997)
Mulvey, J., Vanderbei, R., Zenios, S.: Robust optimization of large-scale systems. Operations Research 43, 264–281 (1995)
Paixao, M., Souza, J.: A scenario-based robust model for the next release problem. In: ACM Genetic and Evolutionary Computation Conference (GECCO 2013) (to appear, 2013)
Liebchen, C., Lübbecke, M., Möhring, R.H., Stiller, S.: Recoverable robustness (2007)
Liebchen, C., Lübbecke, M., Möhring, R., Stiller, S.: The concept of recoverable robustness, linear programming recovery, and railway applications. In: Ahuja, R.K., Möhring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 1–27. Springer, Heidelberg (2009)
Büsing, C., Koster, A.M., Kutschka, M.: Recoverable robust knapsacks: the discrete scenario case. Optimization Letters 5, 379–392 (2011)
Büsing, C., Koster, A.M.C.A., Kutschka, M.: Recoverable robust knapsacks: γ-scenarios. In: Pahl, J., Reiners, T., Voß, S. (eds.) INOC 2011. LNCS, vol. 6701, pp. 583–588. Springer, Heidelberg (2011)
Bertsimas, D., Sim, M.: The price of robustness. Operations Research 52, 35–53 (2004)
Xuan, J., Jiang, H., Ren, Z., Luo, Z.: Solving the large scale next release problem with a backbone-based multilevel algorithm. IEEE Transactions on Software Engineering 38, 1195–1212 (2012)
Eclipse (January 2013), http://www.eclipse.org/
Mozilla (January 2013), http://www.mozilla.org/
Holland John, H.: Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. University of Michigan, USA (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paixão, M.H.E., de Souza, J.T. (2013). A Recoverable Robust Approach for the Next Release Problem. In: Ruhe, G., Zhang, Y. (eds) Search Based Software Engineering. SSBSE 2013. Lecture Notes in Computer Science, vol 8084. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39742-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-39742-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39741-7
Online ISBN: 978-3-642-39742-4
eBook Packages: Computer ScienceComputer Science (R0)