{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T21:07:44Z","timestamp":1792184864437,"version":"4.4.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,3,13]],"date-time":"2021-03-13T00:00:00Z","timestamp":1615593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,13]],"date-time":"2021-03-13T00:00:00Z","timestamp":1615593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001602","name":"Science Foundation Ireland","doi-asserted-by":"crossref","award":["13\/RC\/2094_P2"],"award-info":[{"award-number":["13\/RC\/2094_P2"]}],"id":[{"id":"10.13039\/501100001602","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s42979-021-00541-8","type":"journal-article","created":{"date-parts":[[2021,3,13]],"date-time":"2021-03-13T16:02:35Z","timestamp":1615651355000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Reparation in Evolutionary Algorithms for Multi-objective Feature Selection in Large Software Product Lines"],"prefix":"10.1007","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2958-7979","authenticated-orcid":false,"given":"Takfarinas","family":"Saber","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Brevet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Goetz","family":"Botterweck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anthony","family":"Ventresque","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,3,13]]},"reference":[{"key":"541_CR1","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.jss.2018.12.015","volume":"149","author":"A Ramirez","year":"2019","unstructured":"Ramirez A, Romero JR, Ventura S. A survey of many-objective optimisation in search-based software engineering. J Syst Softw. 2019;149:382\u201395.","journal-title":"J Syst Softw"},{"key":"541_CR2","doi-asserted-by":"crossref","unstructured":"Metzger A, Pohl K. Software product line engineering and variability management: achievements and challenges. FSE. 2014. p. 70\u201384.","DOI":"10.1145\/2593882.2593888"},{"issue":"6","key":"541_CR3","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1049\/iet-sen.2018.5318","volume":"13","author":"JC Neto","year":"2019","unstructured":"Neto JC, da Silva CH, Colanzi TE, Amaral AMMM. Are MAs profitable to search-based PLA design? IET Softw. 2019;13(6):587\u201399.","journal-title":"IET Softw"},{"key":"541_CR4","doi-asserted-by":"crossref","unstructured":"Nair V, Agrawal A, Chen J, Fu W, Mathew G, Menzies T, Minku L, Wagner M, Yu Z. Data-driven search-based software engineering. MSR. 2018. p. 341\u201352.","DOI":"10.1145\/3196398.3196442"},{"key":"541_CR5","doi-asserted-by":"crossref","unstructured":"Harman M, Jia Y, Krinke J, Langdon WB, Petke J, Zhang Y. Search based software engineering for software product line engineering: a survey and directions for future work. SPLC. 2014. p. 5\u201318.","DOI":"10.1145\/2648511.2648513"},{"key":"541_CR6","doi-asserted-by":"crossref","unstructured":"Henard C, Papadakis M, Harman M, Le Traon Y. Combining multi-objective search and constraint solving for configuring large software product lines. ICSE. 2015. p. 517\u201328.","DOI":"10.1109\/ICSE.2015.69"},{"key":"541_CR7","doi-asserted-by":"crossref","unstructured":"Saber T, Brevet D, Botterweck G, Ventresque A. Milpibea: Algorithm for multi-objective features selection in (evolving) software product lines. EvoCop. 2020. p. 164\u201379.","DOI":"10.1007\/978-3-030-43680-3_11"},{"key":"541_CR8","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.infsof.2017.08.010","volume":"95","author":"T Saber","year":"2018","unstructured":"Saber T, Brevet D, Botterweck G, Ventresque A. Is seeding a good strategy in multi-objective feature selection when feature models evolve? Inf Softw Technol. 2018;95:266\u201380.","journal-title":"Inf Softw Technol"},{"issue":"10","key":"541_CR9","doi-asserted-by":"publisher","first-page":"2261","DOI":"10.1016\/j.jss.2011.08.008","volume":"85","author":"A Pleuss","year":"2012","unstructured":"Pleuss A, Botterweck G, Dhungana D, Polzer A, Kowalewski S. Model-driven support for product line evolution on feature level. J Syst Softw. 2012;85(10):2261\u201374.","journal-title":"J Syst Softw"},{"issue":"3","key":"541_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.cosrev.2009.07.001","volume":"3","author":"S Salcedo-Sanz","year":"2009","unstructured":"Salcedo-Sanz S. A survey of repair methods used as constraint handling techniques in evolutionary algorithms. Comput Sci Rev. 2009;3(3):175\u201392.","journal-title":"Comput Sci Rev"},{"key":"541_CR11","doi-asserted-by":"crossref","unstructured":"Ray T, Singh HK, Isaacs A, Smith W. Infeasibility driven evolutionary algorithm for constrained optimization. In: Constraint-handling in evolutionary optimization. Springer 2009;145\u2013165.","DOI":"10.1007\/978-3-642-00619-7_7"},{"key":"541_CR12","first-page":"193","volume":"I","author":"HK Singh","year":"2016","unstructured":"Singh HK, Alam K, Ray T. Use of infeasible solutions during constrained evolutionary search: a short survey. ACALC. 2016;I:193\u2013205.","journal-title":"ACALC"},{"issue":"3","key":"541_CR13","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s11081-016-9344-z","volume":"18","author":"\u00c9C Carvalho","year":"2017","unstructured":"Carvalho \u00c9C, Bernardino HS, Hallak PH, Lemonge AC. An adaptive penalty scheme to solve constrained structural optimization problems by a craziness based particle swarm optimization. Optimiz Eng. 2017;18(3):693\u2013722.","journal-title":"Optimiz Eng"},{"key":"541_CR14","doi-asserted-by":"crossref","unstructured":"Sayyad AS, Goseva-Popstojanova K, Menzies T, Ammar H. On parameter tuning in search based software engineering: a replicated empirical study. RESER. 2013. p. 84\u201390.","DOI":"10.1109\/RESER.2013.6"},{"issue":"2","key":"541_CR15","doi-asserted-by":"publisher","first-page":"1447","DOI":"10.1007\/s10270-017-0610-0","volume":"18","author":"J Guo","year":"2019","unstructured":"Guo J, Liang JH, Shi K, Yang D, Zhang J, Czarnecki K, Ganesh V, Yu H. SMTIBEA: a hybrid multi-objective optimization algorithm for configuring large constrained software product lines. Softw Syst Model. 2019;18(2):1447\u201366.","journal-title":"Softw Syst Model"},{"key":"541_CR16","doi-asserted-by":"crossref","unstructured":"Xue Y, Li YF. Multi-objective integer programming approaches for solving optimal feature selection problem: a new perspective on multi-objective optimization problems in SBSE. ICSE. 2018. p. 1231\u201342.","DOI":"10.1145\/3180155.3180257"},{"key":"541_CR17","doi-asserted-by":"crossref","unstructured":"Sayyad AS, Menzies T, Ammar H. On the value of user preferences in search-based software engineering: a case study in software product lines. ICSE. 2013. p. 492\u2013501.","DOI":"10.1109\/ICSE.2013.6606595"},{"issue":"12","key":"541_CR18","doi-asserted-by":"publisher","first-page":"1611","DOI":"10.1109\/TSE.2013.34","volume":"39","author":"T Berger","year":"2013","unstructured":"Berger T, She S, Lotufo R, Wasowski A, Czarnecki K. A study of variability models and languages in the systems software domain. IEEE Trans Softw Eng. 2013;39(12):1611\u201340. https:\/\/doi.org\/10.1109\/TSE.2013.34.","journal-title":"IEEE Trans Softw Eng"},{"key":"541_CR19","unstructured":"Fonseca CM, Paquete L, L\u00f3pez-Ib\u00e1nez M. An improved dimension-sweep algorithm for the hypervolume indicator. CEC. 2006. p. 1157\u201363."},{"key":"541_CR20","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1016\/j.future.2017.06.015","volume":"79","author":"T Saber","year":"2018","unstructured":"Saber T, Thorburn J, Murphy L, Ventresque A. VM reassignment in hybrid clouds for large decentralised companies: a multi-objective challenge. Fut Gener Comput Syst. 2018;79:751\u201364.","journal-title":"Fut Gener Comput Syst"},{"issue":"1","key":"541_CR21","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10732-019-09427-8","volume":"26","author":"T Saber","year":"2020","unstructured":"Saber T, Gandibleux X, O\u2019Neill M, Murphy L, Ventresque A. A comparative study of multi-objective machine reassignment algorithms for data centres. J Heuristics. 2020;26(1):119\u201350. https:\/\/doi.org\/10.1007\/s10732-019-09427-8.","journal-title":"J Heuristics."},{"key":"541_CR22","doi-asserted-by":"crossref","unstructured":"Brevet D, Saber T, Botterweck G, Ventresque A. Preliminary study of multi-objective features selection for evolving software product lines. Symposium on search based software engineering 2016.","DOI":"10.1007\/978-3-319-47106-8_23"},{"issue":"09","key":"541_CR23","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1142\/S0218194019500426","volume":"29","author":"K Shi","year":"2019","unstructured":"Shi K, Yu H, Fan G, Guo J, Chen L, Yang X, Sun H. Mutation with local searching and elite inheritance mechanism in multi-objective optimization algorithm: a case study in software product line. Int J Software Eng Knowl Eng. 2019;29(09):1347\u201378.","journal-title":"Int J Software Eng Knowl Eng"},{"key":"541_CR24","doi-asserted-by":"crossref","unstructured":"Saber T, Delavernhe F, Papadakis M, O\u2019Neill M, Ventresque A. A hybrid algorithm for multi-objective test case selection. CEC. 2018. p. 1\u20138.","DOI":"10.1109\/CEC.2018.8477875"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-021-00541-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-021-00541-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-021-00541-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T17:17:59Z","timestamp":1620926279000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-021-00541-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,13]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["541"],"URL":"https:\/\/doi.org\/10.1007\/s42979-021-00541-8","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"value":"2662-995X","type":"print"},{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,13]]},"assertion":[{"value":"8 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"138"}}