{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:59:52Z","timestamp":1776956392082,"version":"3.51.4"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030881054","type":"print"},{"value":"9783030881061","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-88106-1_7","type":"book-chapter","created":{"date-parts":[[2021,9,30]],"date-time":"2021-09-30T07:04:39Z","timestamp":1632985479000},"page":"87-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Multi-objective Test Case Selection Through Linkage Learning-Based Crossover"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0551-6690","authenticated-orcid":false,"given":"Mitchell","family":"Olsthoorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7395-3588","authenticated-orcid":false,"given":"Annibale","family":"Panichella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,29]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"89497","DOI":"10.1109\/ACCESS.2020.2990567","volume":"8","author":"J Blank","year":"2020","unstructured":"Blank, J., Deb, K.: Pymoo: multi-objective optimization in python. IEEE Access 8, 89497\u201389509 (2020)","journal-title":"IEEE Access"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0020-0190(96)00135-4","volume":"60","author":"TY Chen","year":"1996","unstructured":"Chen, T.Y., Lau, M.F.: Dividing strategies for the optimization of a test suite. Inf. Process. Lett. 60(3), 135\u2013141 (1996)","journal-title":"Inf. Process. Lett."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2000","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182\u2013197 (2000)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Epitropakis, M.G., Yoo, S., Harman, M., Burke, E.K.: Empirical evaluation of pareto efficient multi-objective regression test case prioritisation. In: Proceedings of the 2015 International Symposium on Software Testing and Analysis, pp. 234\u2013245. ACM (2015)","DOI":"10.1145\/2771783.2771788"},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1145\/152388.152391","volume":"2","author":"MJ Harrold","year":"1993","unstructured":"Harrold, M.J., Gupta, R., Soffa, M.L.: A methodology for controlling the size of a test suite. ACM Trans. Softw. Eng. Methodol. (TOSEM) 2(3), 270\u2013285 (1993)","journal-title":"ACM Trans. Softw. Eng. Methodol. (TOSEM)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10664-005-3861-2","volume":"10","author":"H Do","year":"2005","unstructured":"Do, H., Elbaum, S., Rothermel, G.: Supporting controlled experimentation with testing techniques: an infrastructure and its potential impact. Empir. Softw. Eng. 10, 405\u2013435 (2005). https:\/\/doi.org\/10.1007\/s10664-005-3861-2","journal-title":"Empir. Softw. Eng."},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/TSE.2007.38","volume":"33","author":"Z Li","year":"2007","unstructured":"Li, Z., Harman, M., Hierons, R.M.: Search algorithms for regression test case prioritization. IEEE Trans. Softw. Eng. 33(4), 225\u2013237 (2007)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Luong, N.H., Grond, M.O., La Poutr\u00e9, H., Bosman, P.A.: Scalable and practical multi-objective distribution network expansion planning. In: IEEE Power & Energy Society General Meeting, pp. 1\u20135. IEEE (2015)","DOI":"10.1109\/PESGM.2015.7286113"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Luong, N.H., La Poutr\u00e9, H., Bosman, P.A.: Multi-objective gene-pool optimal mixing evolutionary algorithms. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, pp. 357\u2013364 (2014)","DOI":"10.1145\/2576768.2598261"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.swevo.2018.02.005","volume":"40","author":"NH Luong","year":"2018","unstructured":"Luong, N.H., La Poutr\u00e9, H., Bosman, P.A.: Multi-objective gene-pool optimal mixing evolutionary algorithm with the interleaved multi-start scheme. Swarm Evol. Comput. 40, 238\u2013254 (2018)","journal-title":"Swarm Evol. Comput."},{"issue":"3","key":"7_CR11","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1162\/evco_a_00209","volume":"26","author":"NH Luong","year":"2018","unstructured":"Luong, N.H., Poutr\u00e9, H.L., Bosman, P.A.: Exploiting linkage information and problem-specific knowledge in evolutionary distribution network expansion planning. Evol. Comput. 26(3), 471\u2013505 (2018)","journal-title":"Evol. Comput."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Mondal, D., Hemmati, H., Durocher, S.: Exploring test suite diversification and code coverage in multi-objective test case selection. In: IEEE International Conference on Software Testing, Verification and Validation (ICST), pp. 1\u201310 (2015)","DOI":"10.1109\/ICST.2015.7102588"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Olsthoorn, M., Panichella, A.: Replication package of \u201cMulti-objective test case selection through linkage learning-based crossover (2021). https:\/\/doi.org\/10.5281\/zenodo.5105872","DOI":"10.5281\/zenodo.5105872"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Panichella, A., Oliveto, R., Di Penta, M., De Lucia, A.: Improving multi-objective test case selection by injecting diversity in genetic algorithms. IEEE Trans. Softw. Eng (to appear). https:\/\/doi.org\/10.1109\/TSE.2014.2364175","DOI":"10.1109\/TSE.2014.2364175"},{"key":"7_CR15","unstructured":"Pelikan, M., Goldberg, D.E.: Escaping hierarchical traps with competent genetic algorithms. In: Proceedings of the 3rd Annual Conference on Genetic and Evolutionary Computation, pp. 511\u2013518 (2001)"},{"key":"7_CR16","unstructured":"Pelikan, M., Goldberg, D.E., Cant\u00fa-Paz, E., et al.: BOA: The Bayesian optimization algorithm. In: Proceedings of the genetic and evolutionary computation conference GECCO-99, vol. 1, pp. 525\u2013532. Citeseer (1999)"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Pradhan, D., Wang, S., Ali, S., Yue, T., Liaaen, M.: CBGA-ES+: a cluster-based genetic algorithm with non-dominated elitist selection for supporting multi-objective test optimization. IEEE Trans. Softw. Eng. (2018)","DOI":"10.1109\/ICST.2017.40"},{"issue":"6","key":"7_CR18","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1109\/TEVC.2020.2985497","volume":"24","author":"MW Przewozniczek","year":"2020","unstructured":"Przewozniczek, M.W., Komarnicki, M.M.: Empirical linkage learning. IEEE Trans. Evol. Comput. 24(6), 1097\u20131111 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Rothermel, G., Untch, R., Chu, C., Harrold, M.: Test case prioritization: an empirical study. In: IEEE International Conference on Software Maintenance, (ICSM 1999) Proceedings, pp. 179\u2013188 (1999). https:\/\/doi.org\/10.1109\/ICSM.1999.792604","DOI":"10.1109\/ICSM.1999.792604"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Rothermel, G., Harrold, M.J., Ostrin, J., Hong, C.: An empirical study of the effects of minimization on the fault detection capabilities of test suites. In: Proceedings of the International Conference on Software Maintenance, pp. 34\u201344. IEEE CS Press (1998)","DOI":"10.1109\/ICSM.1998.738487"},{"key":"7_CR21","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. In: 2018 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE (2018)","DOI":"10.1109\/CEC.2018.8477875"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-642-15844-5_27","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"D Thierens","year":"2010","unstructured":"Thierens, D.: The linkage tree genetic algorithm. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 264\u2013273. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_27"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Thierens, D., Bosman, P.A.: Optimal mixing evolutionary algorithms. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, pp. 617\u2013624 (2011)","DOI":"10.1145\/2001576.2001661"},{"key":"7_CR24","volume-title":"Practical DevOps","author":"J Verona","year":"2016","unstructured":"Verona, J.: Practical DevOps. Packt Publishing Ltd., Birmingham (2016)"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Wang, S., Ali, S., Yue, T., Li, Y., Liaaen, M.: A practical guide to select quality indicators for assessing pareto-based search algorithms in search-based software engineering. In: Proceedings of the 38th International Conference on Software Engineering, pp. 631\u2013642. ACM, New York (2016)","DOI":"10.1145\/2884781.2884880"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BFb0056853","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN V","author":"RA Watson","year":"1998","unstructured":"Watson, R.A., Hornby, G.S., Pollack, J.B.: Modeling building-block interdependency. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 97\u2013106. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0056853"},{"issue":"2","key":"7_CR27","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1002\/stv.430","volume":"22","author":"S Yoo","year":"2012","unstructured":"Yoo, S., Harman, M.: Regression testing minimization, selection and prioritization: a survey. Softw. Test. Verif. Reliab. 22(2), 67\u2013120 (2012)","journal-title":"Softw. Test. Verif. Reliab."},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Yoo, S.: A novel mask-coding representation for set cover problems with applications in test suite minimisation. In: Proceedings of the 2nd International Symposium on Search-Based Software Engineering (SSBSE 2010). IEEE (2010)","DOI":"10.1109\/SSBSE.2010.12"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Yoo, S., Harman, M.: Pareto efficient multi-objective test case selection. In: Proceedings of International Symposium on Software Testing and Analysis, pp. 140\u2013150. ACM (2007)","DOI":"10.1145\/1273463.1273483"},{"issue":"4","key":"7_CR30","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.jss.2009.11.706","volume":"83","author":"S Yoo","year":"2010","unstructured":"Yoo, S., Harman, M.: Using hybrid algorithm for Pareto efficient multi-objective test suite minimisation. J. Syst. Softw. 83(4), 689\u2013701 (2010)","journal-title":"J. Syst. Softw."},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-23716-4_20","volume-title":"Search Based Software Engineering","author":"S Yoo","year":"2011","unstructured":"Yoo, S., Harman, M., Ur, S.: Highly scalable multi objective test suite minimisation using graphics cards. In: Cohen, M.B., \u00d3 Cinn\u00e9ide, M. (eds.) SSBSE 2011. LNCS, vol. 6956, pp. 219\u2013236. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23716-4_20"},{"key":"7_CR32","unstructured":"Yoo, S., Nilsson, R., Harman, M.: Faster fault finding at google using multi objective regression test optimisation. In: 8th European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC\/FSE\u201911), Szeged, Hungary (2011)"},{"issue":"4","key":"7_CR33","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1162\/evco.2009.17.4.17409","volume":"17","author":"TL Yu","year":"2009","unstructured":"Yu, T.L., Goldberg, D.E., Sastry, K., Lima, C.F., Pelikan, M.: Dependency structure matrix, genetic algorithms, and effective recombination. Evol. Comput. 17(4), 595\u2013626 (2009)","journal-title":"Evol. Comput."},{"issue":"2","key":"7_CR34","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7(2), 117\u2013132 (2003)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Search-Based Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88106-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T01:53:34Z","timestamp":1725846814000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88106-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030881054","9783030881061"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88106-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"29 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSBSE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Search Based Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bari","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ssbse2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ssbse.info\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference took place virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}