Abstract
The multi-objective feature selection from software product lines is a problem that has attracted increasing attention in recent years. However, current studies on this problem suffer from two main limitations: (1) resource constraints are naturally adhered to the feature selection process, but they are completely ignored or inadequately handled, and (2) there is a strong preference to the use of evolutionary algorithms for the feature selection problem, and the suitability of other multi-objective metaheuristics remains to be fully explored. To address the above two limitations, this paper proposes the multi-objective feature selection with multiple linear and non-linear resource constraints, and investigates the performance of decomposition-based metaheuristics on the proposed problem. We construct a number of problem instances using both artificial and real-world software product lines, considering 2, 3 and 4 objectives. Experimental results show that, within the decomposition-based framework, reproduction operators that are based on probabilistic models (PM) perform better than genetic operators. Moreover, we demonstrate that adaptation of weight vectors can further improve the performance. Finally, we show that PMAD (the combination of PM-based reproduction operators, adaptation of weight vectors and decomposition-based framework) is better than several state-of-the-art algorithms when handling this problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Source codes of PMAD are publicly available at https://doi.org/10.5281/zenodo.4275041.
References
Batory, D.: Feature models, grammars, and propositional formulas. In: Obbink, H., Pohl, K. (eds.) SPLC 2005. LNCS, vol. 3714, pp. 7–20. Springer, Heidelberg (2005). https://doi.org/10.1007/11554844_3
Benavides, D., Segura, S., Ruiz-Corts, A.: Automated analysis of feature models 20 years later: a literature review. Inf. Syst. 35(6), 615–636 (2010)
Clements, P., Northrop, L.: Software Product Lines: Practices and Patterns. Addison-Wesley Longman Publishing Co., Inc., Boston (2001)
Czarnecki, K., Eisenecker, U.: Generative Programming: Methods, Tools, and Applications. ACM Press/Addison-Wesley Publishing Co. 1515 Broadway, New York, United States (2000)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and Elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)
do Nascimento Ferreira, T., Kuk, J.N., Pozo, A., Vergilio, S.R.: Product selection based on upper confidence bound MOEA/D-Dra for testing software product lines. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 4135–4142 (2016)
Guo, J., et al.: SMTIBEA: a hybrid multi-objective optimization algorithm for configuring large constrained software product lines. Softw. Syst. Model. 18, 1447–1466 (2019). https://doi.org/10.1007/s10270-017-0610-0
Guo, J., White, J., Wang, G., Li, J., Wang, Y.: A genetic algorithm for optimized feature selection with resource constraints in software product lines. J. Syst. Softw. 84(12), 2208–2221 (2011)
Henard, C., Papadakis, M., Harman, M., Traon, Y.L.: Combining multi-objective search and constraint solving for configuring large software product lines. In: The 37th International Conference on Software Engineering, vol. 1, pp. 517–528, May 2015
Hierons, R.M., Li, M., Liu, X., Segura, S., Zheng, W.: SIP: optimal product selection from feature models using many-objective evolutionary optimization. ACM Trans. Softw. Eng Methodol. 25(2), 17:1–17:9 (2016)
Ishibuchi, H., Masuda, H., Tanigaki, Y., Nojima, Y.: Difficulties in specifying reference points to calculate the inverted generational distance for many-objective optimization problems. In: IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making (MCDM), pp. 170–177. IEEE (2014)
Jain, H., Deb, K.: An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, part II: handling constraints and extending to an adaptive approach. IEEE Trans. Evol. Comput. 18(4), 602–622 (2014)
Li, H., Landa-Silva, D.: An adaptive evolutionary multi-objective approach based on simulated annealing. Evol. Comput. 19(4), 561–595 (2011)
Liang, J.H., Ganesh, V., Czarnecki, K., Raman, V.: SAT-based analysis of large real-world feature models is easy. In: Proceedings of the 19th International Conference on Software Product Line, SPLC 2015, pp. 91–100. ACM, New York (2015). https://doi.org/10.1145/2791060.2791070
Lopez-Herrejon, R.E., Chicano, F., Ferrer, J., Egyed, A., Alba, E.: Multi-objective optimal test suite computation for software product line pairwise testing. In: IEEE International Conference on Software Maintenance, pp. 404–407 (2013)
Ma, X., Yu, Y., Li, X., Qi, Y., Zhu, Z.: A survey of weight vector adjustment methods for decomposition based multi-objective evolutionary algorithms. IEEE Trans. Evol. Comput. 24(4), 634–649 (2020)
Mendonca, M., Wasowski, A., Czarnecki, K.: SAT-based analysis of feature models is easy. In: Proceedings of the 13th International Software Product Line Conference, SPLC 2009, pp. 231–240. Carnegie Mellon University, Pittsburgh (2009)
RamĂrez, A., Romero, J.R., Ventura, S.: A survey of many-objective optimisation in search-based software engineering. J. Syst. Softw. 149, 382–395 (2019)
Roos-Frantz, F., Benavides, D., Ruiz-Cortés, A., Heuer, A., Lauenroth, K.: Quality-aware analysis in product line engineering with the orthogonal variability model. Softw. Qual. J. 20, 519–565 (2012). https://doi.org/10.1007/s11219-011-9156-5
Sayyad, A.S., Ingram, J., Menzies, T., Ammar, H.: Scalable product line configuration: a straw to break the camel’s back. In: 2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE), pp. 465–474, November 2013
Sayyad, A.S., Menzies, T., Ammar, H.: On the value of user preferences in search-based software engineering: a case study in software product lines. In: 2013 35th International Conference on Software Engineering (ICSE), pp. 492–501, May 2013
Wang, B., Xu, H., Yuan, Y.: Scale adaptive reproduction operator for decomposition based estimation of distribution algorithm. In: 2015 IEEE Congress on Evolutionary Computation (CEC), pp. 2042–2049, May 2015
White, J., Dougherty, B., Schmidt, D.C.: Selecting highly optimal architectural feature sets with filtered Cartesian flattening. J. Syst. Softw. 82(8), 1268–1284 (2009). sI: Architectural Decisions and Rationale
White, J., Doughtery, B., Schmidt, D.C.: Filtered cartesian flattening: an approximation technique for optimally selecting features while adhering to resource constraints. In: Software Product Lines, 12th International Conference, SPLC 2008, Limerick, Ireland, 8–12 September 2008, Proceedings. Second Volume (Workshops), pp. 209–216 (2008)
Wilcoxon, F.: Individual comparisons by ranking methods. Biom. Bull. 1(6), 80–83 (1945)
Xiang, Y., Yang, X., Zhou, Y., Huang, H.: Enhancing decomposition-based algorithms by estimation of distribution for constrained optimal software product selection. IEEE Trans. Evol. Comput. 24(2), 245–259 (2020)
Xiang, Y., Yang, X., Zhou, Y., Zheng, Z., Li, M., Huang, H.: Going deeper with optimal software products selection using many-objective optimization and satisfiability solvers. Empir. Softw. Eng. 25, 591–626 (2020)
Xiang, Y., Zhou, Y., Li, M., Chen, Z.: A vector angle based evolutionary algorithm for unconstrained many-objective problems. IEEE Trans. Evol. Comput. 21(1), 131–152 (2017)
Xiang, Y., Zhou, Y., Zheng, Z., Li, M.: Configuring software product lines by combining many-objective optimization and SAT solvers. ACM Trans. Softw. Eng. Methodol. 26(4), 141–1446 (2018)
Xue, Y., Li, M., Shepperd, M., Lauria, S., Liu, X.: A novel aggregation-based dominance for Pareto-based evolutionary algorithms to configure software product lines. Neurocomputing 364, 32–48 (2019)
Xue, Y., et al.: IBED: combining IBEA and DE for optimal feature selection in software product line engineering. Appl. Soft Comput. 49, 1215–1231 (2016)
Zhang, Q., Li, H.: MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712–731 (2007)
Zitzler, E., Künzli, S.: Indicator-based selection in multiobjective search. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 832–842. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-30217-9_84
Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. Evol. Comput. 3(4), 257–271 (1999)
Acknowledgment
This paper is supported by National Natural Science Foundation of China (61906069, 61703183, 62006081), Guangdong Basic and Applied Basic Research Foundation (2019A1515011411, 2019A1515011700), Project Funded by China Postdoctoral Science Foundation (2019M662912, 2020M672630), Science and Technology Program of Guangzhou (202002030355, 202002030260), Public Welfare Technology Application Research Plan of Zhejiang (LGG19F030010), and Fundamental Research Funds for the Central Universities (2019MS088).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Xiang, Y., Peng, X., Xia, X., Meng, X., Li, S., Huang, H. (2021). An Investigation of Decomposition-Based Metaheuristics for Resource-Constrained Multi-objective Feature Selection in Software Product Lines. In: Ishibuchi, H., et al. Evolutionary Multi-Criterion Optimization. EMO 2021. Lecture Notes in Computer Science(), vol 12654. Springer, Cham. https://doi.org/10.1007/978-3-030-72062-9_52
Download citation
DOI: https://doi.org/10.1007/978-3-030-72062-9_52
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-72061-2
Online ISBN: 978-3-030-72062-9
eBook Packages: Computer ScienceComputer Science (R0)