Scientific and Technical Journal

ELECTROTECHNIC AND COMPUTER SYSTEMS

ISSN Print 2221-3937
ISSN Online 2221-3805
THE ALGORITHM OF FINDING PARETO-OPTIMAL SOLUTIONS FOR NEXT RELEASE PROBLEM
Abstract:

In the process of iterative software development, the project team need to determine the features that should be added to the system as part of the next release. This problem is named the next release problem (NRP). Usually, the solutions of NRP base on empirical tools and give the quasi-optimal solution. Every feature of the software system is characterized by its importance and complexity so that the NRP can be formulated as the bi-objective optimization problem. The objective of the paper is to modify the algorithm of combinations enumeration for finding the Pareto-optimal solution for NRP, reducing the time and cost of required computing resources. We consider three versions of the algorithm of combinations enumeration. It is shown that the algorithm of combinations enumeration with filtering is the best algorithm accordingly of criteria of computation time and memory consumption.

Authors:
Keywords
DOI
References
  1. West D., and Grant T., (2010), Agile Development: Mainstream Adoption Has Changed Agility Cambridge: Forrester Research, 22 p.
  2. Bagnall A.J., Rayward-Smith V.J., and Whittley I.M., (2001), The Next Release Problem, Information and Software Technology, Vol. 43, pp. 883 –890.
  3. Nogin V.D. Priniatie reshenij v mnogokriterial’noj srede: kolichestvennyi podkhod [Decision-making in Multi-criteria Environment: Quantitative Approach], (2002), Moscow, Russian Federation, 176 p. (In Russian).
  4. Kolechkina L.N. Optimal’nye reshenia mnogokriterial’nykh kombinatornykh zadach na razmescheniakh [Optimum Decisions of Multicriterion Combinatorial Problems on Placing], (2007), Teoria Optymal’nykh Rishen’, Kiev, Ukraine, Vol. 6, pp. 67 – 73 (In Russian).
  5. Zhang Y., Harman M., and Mansouri S.A., (2007), The Multi-objective Next Release Problem, Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation (GECCO’07), London, UK, pp. 1129 – 1137.
  6. Cai X., Wei O., and Huang Z., (2012), Evolutionary Approaches for Multi-objective Next Release Problem, Computing and Informatics, Vol. 31, pp. 847 – 875.
  7. Durillo J.J., Zhang Y., Alba E., Harman M., and Nebro A.J., (2010), A Study of the Bi-objective Next Release Problem, Empirical Software Engineering, pp. 1 – 32, Doi: 10.1007/s10664-010-9147-3.
  8. Greer D., and Ruhe G., (2004), Software Release Planning: an Evolutionary and Iterative Approach Information and Software Technology, Vol. 46, pp. 243 – 253.
  9. Howard M., (2011), Growth of DRAM Content in Notebook PCs Decelerates Partly Due to Rise of Ultra books and the Cloud, IHS Technology, Url: https://technology.ihs.com/389419/growth-of-dram-content-in-notebook-pcs-decelerates-partly-due-to-rise-of-ultrabooks-and-the-cloud (accessed 08.05.2015).
  10. Java SE HotSpot Virtual Machine Garbage Collection Tuning Guide, (2015), Oracle Corporation, Url: http://docs.oracle.com/javase/8/docs/technotes/guides/vm/gctuning/ (accessed 08.05.2015).
  11. Deb K., Pratap A., Agarwal S., and Meyarivan T., (2002),A Fast and Elitist Multiobjective Genetic Algorithm: NSGA–IIIEEE Transactions on EvolutionaryComputation, Vol. 6(2), pp. 182 – 197.
  12. Ruskey F.,(2003), Combinatorial Generation CSC-425/520 Univ. of Victoria CA, 39 p., Url:http://www.1stworks.com/ref/CombGen.pdf (accessed 08.05.2015).
Published:
Last download:
2017-11-17 01:48:18

[ © KarelWintersky ] [ All articles ] [ All authors ]
[ © Odessa National Polytechnic University, 2014. Any use of information from the site is possible only under the condition that the source link! ]
Яндекс.Метрика