DOI QR코드

DOI QR Code

A Greedy Genetic Algorithm for Release Planning in Software Product Lines

소프트웨어 제품라인의 출시 계획 수립을 위한 탐욕 유전자 알고리듬

  • Yoo, Jaewook (Department of Business Administration, Dong-A University)
  • 유재욱 (동아대학교 경영대학 경영학과)
  • Received : 2013.07.01
  • Accepted : 2013.08.21
  • Published : 2013.09.30

Abstract

Release planning in a software product line (SPL) is to select and assign the features of the multiple software products in the SPL in sequence of releases along a specified planning horizon satisfying the numerous constraints regarding technical precedence, conflicting priorities for features, and available resources. A greedy genetic algorithm is designed to solve the problems of release planning in SPL which is formulated as a precedence-constrained multiple 0-1 knapsack problem. To be guaranteed to obtain feasible solutions after the crossover and mutation operation, a greedy-like heuristic is developed as a repair operator and reflected into the genetic algorithm. The performance of the proposed solution methodology in this research is tested using a fractional factorial experimental design as well as compared with the performance of a genetic algorithm developed for the software release planning. The comparison shows that the solution approach proposed in this research yields better result than the genetic algorithm.

Keywords

References

  1. http://www.sei.cmu.edu/productlines.
  2. J.M.V., vanden Akker, S. Brinkkemper, G. Diepen, and J. Versendaal, Determination of the Next Release of a Software Product : an approach using integer linear programming. Proceeding of the 11th International Workshop on Requirements Engineering, Foundation for Software Quality, (REFSQ 2005), 2005, p 119-124.
  3. J.M.V. vanden Akker, S. Brinkkemper, G. Diepen, and J. Versendaal, Software Product Release Planning through Optimization and what-if analysis. Information and Software Technology, 2008, Vol. 50, No. 1-2, p 101-111. https://doi.org/10.1016/j.infsof.2007.10.017
  4. Kapsalis, A., G.D., Smith, V.J., and Rayward-Smith, Solving the Graphical Stainer Tree Problem Using Genetic Algorithms. Journal of the Operational Research Society, 1993, Vol. 44, No. 4, p 397-406. https://doi.org/10.1057/jors.1993.69
  5. Penny, D., An Estimation-Based Management Framework for Enhancive Maintenance in Commercial Software Products. Proceedings of the International Conference on Software Maintenance, Montreal, Canada, 2002, p 122-130.
  6. Raidl, G.R., An Improved Genetic Algorithm for the Multiconstrained 0-1 Knapsack Problem. Proceedings of the 5th IEEE International Conferecne on Evolutionary Computation, Alaska, USA, 1998, p 207-211.
  7. Reeves, C.R., A Genetic Algorithm for Flowshop Sequencing. Computers and Operations Research, 1995, Vol. 22, No. 1, p 5-13. https://doi.org/10.1016/0305-0548(93)E0014-K
  8. Svahnberg, M., T. Gorschek, R. Feldt, R. Torkar, S.B., and Saleem, M.U. Shafiqfue, A Systematic review on strategic release planning models. Information and Software Technology, 2010, Vol. 52, No. 3, p 237-248. https://doi.org/10.1016/j.infsof.2009.11.006
  9. Taborda, L., Generalized Release Planning for Product Line Architectures. Proceedings of the SPLC, The Third Software Product Lines Conference, Boston, USA, 2004, p 238-254.
  10. Ullah, M. and Ruhe, G., Towards Comprehensive Release Planning for Software Product Lines. Proceedings of the First International Workshop on Software Product Management, Minneapolis/St. Paul, Minnesota, USA, 2006, p 55-59.
  11. Yoo, J., An Exact Solution Approach for Release Planning of Software Product Lines. Journal of the Society of Korea Industrial and Systems Engineering, 2012, Vol. 35, No. 2, p 57-63.
  12. Yoo, J., Release Planning of Software Product Lines Using a Genetic Algorithm. Journal of the Society of Korea Industrial and Systems Engineering, 2012, Vol. 35, No. 4, p 142-148. https://doi.org/10.11627/jkise.2012.35.4.142