소프트웨어 제품라인의 출시 계획 수립을 위한 탐욕 유전자 알고리듬
A Greedy Genetic Algorithm for Release Planning in Software Product Lines
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Release planning in a software product line (SPL) is to select and assign the features of the multiple software products inthe 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 problemsof release planning in SPL which is formulated as a precedence-constrained multiple 0-1 knapsack problem. To be guaranteedto obtain feasible solutions after the crossover and mutation operation, a greedy-like heuristic is developed as a repair operatorand reflected into the genetic algorithm. The performance of the proposed solution methodology in this research is tested usinga fractional factorial experimental design as well as compared with the performance of a genetic algorithm developed for thesoftware release planning. The comparison shows that the solution approach proposed in this research yields better result thanthe genetic algorithm.
Abstract
Release planning in a software product line (SPL) is to select and assign the features of the multiple software products inthe 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 problemsof release planning in SPL which is formulated as a precedence-constrained multiple 0-1 knapsack problem. To be guaranteedto obtain feasible solutions after the crossover and mutation operation, a greedy-like heuristic is developed as a repair operatorand reflected into the genetic algorithm. The performance of the proposed solution methodology in this research is tested usinga fractional factorial experimental design as well as compared with the performance of a genetic algorithm developed for thesoftware release planning. The comparison shows that the solution approach proposed in this research yields better result thanthe genetic algorithm.
참고문헌 (12)
- J.M.V., "Determination of the Next Release of a Software Product : an approach using integer linear programming", Proceeding of the 11th International Workshop on Requirements Engineering, Foundationfor Software Quality, pp.119~124 (2005)
- J.M.V. vanden Akker, "Software Product Release Planning through Optimization and what-if analysis", Information and Software Technology, 50(1-2), pp.101~111 (2008)
- Kapsalis, A., "Solving the Graphical Stainer Tree Problem Using Genetic Algorithms", Journal of the Operational Research Society, 44(4), pp.397~406 (1993)
- Penny, D., "An Estimation-Based Management Framework for Enhancive Maintenance in Commercial Software Products", Proceedings of the International Conference on Software Maintenance, pp.122~130 (2002)
- Raidl, G.R., "An Improved Genetic Algorithm for the Multiconstrained 0～1 Knapsack Problem", Proceedings of the 5th IEEE International Conferecne on Evolutionary Computation, pp.207~211 (1998)
- Reeves, C.R., "A Genetic Algorithm for Flowshop Sequencing", Computers and Operations Research, 22(1), pp.5~13 (1995)
- Svahnberg, M., "A Systematic review on strategic release planning models", Information and Software Technology, 52(3), pp.237~248 (2010)
- Taborda, L., "Generalized Release Planning for Product Line Architectures", Proceedings of the SPLC, The Third Software Product Lines Conference, pp.238~254 (2004)
- Ullah, M., "Towards Comprehensive Release Planning for Software Product Lines", Proceedings of the First International Workshop on Software Product Management, pp.55~59 (2006)
- 유재욱, "소프트웨어 제품라인의 출시 계획을 위한 최적해법", 산업경영시스템학회지, 35(2), pp.57~63 (2012), 한국산업경영시스템학회
- 유재욱, "유전자 알고리듬을 이용한 소프트웨어 제품라인의 출시 계획 수립", 산업경영시스템학회지, 35(4), pp.142~148 (2012), 한국산업경영시스템학회[DOI]