{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T07:34:58Z","timestamp":1763105698195,"version":"3.37.3"},"reference-count":76,"publisher":"Springer Science and Business Media LLC","issue":"18","license":[{"start":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T00:00:00Z","timestamp":1582588800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T00:00:00Z","timestamp":1582588800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003093","name":"Ministry of Higher Education, Malaysia","doi-asserted-by":"publisher","award":["RDU170103"],"award-info":[{"award-number":["RDU170103"]}],"id":[{"id":"10.13039\/501100003093","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003170","name":"Stiftelsen f\u00f6r Kunskaps-och Kompetensutveckling","doi-asserted-by":"publisher","award":["20130085"],"award-info":[{"award-number":["20130085"]}],"id":[{"id":"10.13039\/501100003170","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Hyper-heuristic is a new methodology for the adaptive hybridization of meta-heuristic algorithms to derive a general algorithm for solving optimization problems. This work focuses on the selection type of hyper-heuristic, called the exponential Monte Carlo with counter (EMCQ). Current implementations rely on the memory-less selection that can be counterproductive as the selected search operator may not (historically) be the best performing operator for the current search instance. Addressing this issue, we propose to integrate the memory into EMCQ for combinatorial <jats:italic>t<\/jats:italic>-wise test suite generation using reinforcement learning based on the Q-learning mechanism, called Q-EMCQ. The limited application of combinatorial test generation on industrial programs can impact the use of such techniques as Q-EMCQ. Thus, there is a need to evaluate this kind of approach against relevant industrial software, with a purpose to show the degree of interaction required to cover the code as well as finding faults. We applied Q-EMCQ on 37 real-world industrial programs written in Function Block Diagram (FBD) language, which is used for developing a train control management system at Bombardier Transportation Sweden AB. The results show that Q-EMCQ is an efficient technique for test case generation. Addition- ally, unlike the <jats:italic>t<\/jats:italic>-wise test suite generation, which deals with the minimization problem, we have also subjected Q-EMCQ to a maximization problem involving the general module clustering to demonstrate the effectiveness of our approach. The results show the Q-EMCQ is also capable of outperforming the original EMCQ as well as several recent meta\/hyper-heuristic including modified choice function, Tabu high-level hyper-heuristic, teaching learning-based optimization, sine cosine algorithm, and symbiotic optimization search in clustering quality within comparable execution time.<\/jats:p>","DOI":"10.1007\/s00500-020-04769-z","type":"journal-article","created":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T08:02:36Z","timestamp":1582617756000},"page":"13929-13954","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["An evaluation of Monte Carlo-based hyper-heuristic for interaction testing of industrial embedded software applications"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9051-7609","authenticated-orcid":false,"given":"Bestoun S.","family":"Ahmed","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2416-4205","authenticated-orcid":false,"given":"Eduard","family":"Enoiu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0611-2655","authenticated-orcid":false,"given":"Wasif","family":"Afzal","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4626-0513","authenticated-orcid":false,"given":"Kamal Z.","family":"Zamli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,25]]},"reference":[{"issue":"4","key":"4769_CR1","doi-asserted-by":"crossref","first-page":"1330","DOI":"10.1016\/j.asoc.2011.11.029","volume":"12","author":"BS Ahmed","year":"2012","unstructured":"Ahmed BS, Zamli KZ, Lim CP (2012) Application of particle swarm optimization to uniform and variable strength covering array construction. Appl Soft Comput 12(4):1330\u20131347","journal-title":"Appl Soft Comput"},{"key":"4769_CR2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.infsof.2015.05.005","volume":"66(C)","author":"BS Ahmed","year":"2015","unstructured":"Ahmed BS, Abdulsamad TS, Potrus MY (2015) Achievement of minimized combinatorial test suite for configuration-aware software functional testing using the cuckoo search algorithm. Inf Softw Technol 66(C):13\u201329","journal-title":"Inf Softw Technol"},{"key":"4769_CR3","doi-asserted-by":"crossref","first-page":"25706","DOI":"10.1109\/ACCESS.2017.2771562","volume":"5","author":"BS Ahmed","year":"2017","unstructured":"Ahmed BS, Zamli KZ, Afzal W, Bures M (2017) Constrained interaction testing: a systematic literature study. IEEE Access 5:25706\u201325730","journal-title":"IEEE Access"},{"key":"4769_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809163","volume-title":"Introduction to software testing","author":"P Ammann","year":"2008","unstructured":"Ammann P, Offutt J (2008) Introduction to software testing. Cambridge University Press, Cambridge"},{"key":"4769_CR5","doi-asserted-by":"crossref","unstructured":"Andrews JH, Briand LC, Labiche Y (2005) Is mutation an appropriate tool for testing experiments? In: Proceedings of the 27th international conference on Software engineering, ACM, pp 402\u2013411","DOI":"10.1145\/1062455.1062530"},{"key":"4769_CR6","unstructured":"Ayob M, Kendall G (2003) A Monte Carlo hyper-heuristic to optimise component placement sequencing for multi head placement machine. In: Placement machine, INTECH\u201903, Thailand, pp 132\u2013141"},{"key":"4769_CR7","unstructured":"Bell KZ, Vouk MA (2005) On effectiveness of pairwise methodology for testing network-centric software. In: Enabling technologies for the new knowledge society: ITI 3rd international conference on information and communications technology, IEEE, pp 221\u2013235"},{"key":"4769_CR8","doi-asserted-by":"crossref","unstructured":"Bergstr\u00f6m H, Enoiu EP (2017) Using timed base-choice coverage criterion for testing industrial control software. In: International conference on software testing, verification and validation workshops (ICSTW), pp 216\u2013219","DOI":"10.1109\/ICSTW.2017.41"},{"key":"4769_CR9","first-page":"457","volume-title":"Hyper-heuristics: an emerging direction in modern search technology","author":"E Burke","year":"2003","unstructured":"Burke E, Kendall G, Newall J, Hart E, Ross P, Schulenburg S (2003) Hyper-heuristics: an emerging direction in modern search technology. Springer, Boston, pp 457\u2013474"},{"key":"4769_CR10","first-page":"449","volume-title":"A classification of hyper-heuristic approaches","author":"EK Burke","year":"2010","unstructured":"Burke EK, Hyde M, Kendall G, Ochoa G, \u00d6zcan E, Woodward JR (2010) A classification of hyper-heuristic approaches. Springer, Boston, pp 449\u2013468"},{"issue":"12","key":"4769_CR11","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke EK, Gendreau M, Hyde M, Kendall G, Ochoa G, \u00d6zcan E, Rong Q (2013) Hyper-heuristics: a survey of the state of the art. J Op Res Soc 64(12):1695\u20131724","journal-title":"J Op Res Soc"},{"key":"4769_CR12","doi-asserted-by":"crossref","unstructured":"Calvagna A, Gargantini A (2009) Ipo-s: Incremental generation of combinatorial interaction test data based on symmetries of covering arrays. In: 2009 International conference on software testing, verification, and validation workshops, pp 10\u201318","DOI":"10.1109\/ICSTW.2009.7"},{"key":"4769_CR13","doi-asserted-by":"crossref","unstructured":"Charbachi P, Eklund L, Enoiu E (2017) Can pairwise testing perform comparably to manually handcrafted testing carried out by industrial engineers? In: International conference on software quality, reliability and security companion (QRS-C), pp 92\u201399","DOI":"10.1109\/QRS-C.2017.23"},{"key":"4769_CR14","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.compstruc.2014.03.007","volume":"139","author":"M-Y Cheng","year":"2014","unstructured":"Cheng M-Y, Prayogo D (2014) Symbiotic organisms search: a new metaheuristic optimization algorithm. Comput Struct 139:98\u2013112","journal-title":"Comput Struct"},{"key":"4769_CR15","doi-asserted-by":"crossref","unstructured":"Chen X, Gu Q, Li A, Chen D (2009) Variable strength interaction testing with an ant colony system approach. In: Proceedings of the 2009 16th Asia-pacific software engineering conference. APSEC \u201909, IEEE computer society, Washington, pp 160\u2013167","DOI":"10.1109\/APSEC.2009.18"},{"issue":"3","key":"4769_CR16","doi-asserted-by":"crossref","first-page":"495","DOI":"10.3745\/JIPS.2012.8.3.495","volume":"8","author":"CP Cheong","year":"2012","unstructured":"Cheong CP, Fong S, Lei P, Chatwin C, Young R (2012) Designing an efficient and secure credit card-based payment system with web services based on ansi x9.59\u20132006. J Inf Process Syst 8(3):495\u2013520","journal-title":"J Inf Process Syst"},{"issue":"3","key":"4769_CR17","first-page":"279","volume":"8","author":"JCH Christopher","year":"1992","unstructured":"Christopher JCH (1992) Watkins and Peter Dayan technical note: Q-learning. Mach Learn 8(3):279\u2013292","journal-title":"Mach Learn"},{"key":"4769_CR18","doi-asserted-by":"crossref","unstructured":"Cohen DM, Dalal SR, Kajla A, Patton GC (1994) The automatic efficient test generator (AETG) system. In: International symposium on software reliability engineering, IEEE, pp 303\u2013309","DOI":"10.1109\/ISSRE.1994.341392"},{"key":"4769_CR19","doi-asserted-by":"crossref","unstructured":"Cohen MB (2004) Designing test suites for software interaction testing. Technical report, The University of Auckland, Ph.D. Thesis","DOI":"10.1109\/ICSE.2003.1201186"},{"key":"4769_CR20","doi-asserted-by":"crossref","unstructured":"Cohen MB, Dwyer MB, Shi J (2007) Interaction testing of highly-configurable systems in the presence of constraints. In: Proceedings of the 2007 international symposium on software testing and analysis. ISSTA \u201907, ACM, New York, pp 129\u2013139","DOI":"10.1145\/1273463.1273482"},{"issue":"5","key":"4769_CR21","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/52.536462","volume":"13","author":"DM Cohen","year":"1996","unstructured":"Cohen DM, Dalal SR, Parelius J, Patton GC (1996) The combinatorial design approach to automatic test generation. IEEE Softw 13(5):83","journal-title":"IEEE Softw"},{"issue":"7","key":"4769_CR22","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1109\/32.605761","volume":"23","author":"DM Cohen","year":"1997","unstructured":"Cohen DM, Dalal SR, Fredman ML, Patton GC (1997) The AETG system: an approach to testing based on combinatorial design. IEEE Trans Softw Eng 23(7):437\u2013444","journal-title":"IEEE Trans Softw Eng"},{"issue":"2","key":"4769_CR23","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1002\/jcd.20065","volume":"14","author":"CJ Colbourn","year":"2006","unstructured":"Colbourn CJ, Martirosyan SS, Mullen GL, Shasha D, Sherwood GB, Yucas JL (2006) Products of mixed covering arrays of strength two. J Comb Des 14(2):124\u2013138","journal-title":"J Comb Des"},{"key":"4769_CR24","doi-asserted-by":"crossref","unstructured":"Dalal SR, Jain A, Karunanithi N, Leaton JM, Lott CM (1998) Model-based testing of a highly programmable system. In: International symposium on software reliability engineering, IEEE, pp 174\u2013179","DOI":"10.1109\/ISSRE.1998.730876"},{"key":"4769_CR25","doi-asserted-by":"crossref","unstructured":"DeMillo RA, Lipton RJ, Sayward FG (1978) Hints on test data selection: help for the practicing programmer. In: Computer, vol 11, IEEE","DOI":"10.1109\/C-M.1978.218136"},{"key":"4769_CR26","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.engappai.2019.03.021","volume":"82","author":"G Dhiman","year":"2019","unstructured":"Dhiman G, Kaur A (2019) Stoa: a bio-inspired based optimization algorithm for industrial engineering problems. Eng Appl Artif Intell 82:148\u2013174","journal-title":"Eng Appl Artif Intell"},{"key":"4769_CR27","doi-asserted-by":"crossref","unstructured":"Enoiu E, Sundmark D, \u010cau\u0161evi\u0107 A, Pettersson P (2017) A comparative study of manual and automated testing for industrial control software. In: International conference osoftware testing, verification and validation (ICST), IEEE, pp 412\u2013417","DOI":"10.1109\/ICST.2017.44"},{"issue":"5","key":"4769_CR28","doi-asserted-by":"crossref","first-page":"287","DOI":"10.6028\/jres.113.022","volume":"113","author":"M Forbes","year":"2008","unstructured":"Forbes M, Lawrence J, Lei Y, Kacker RN, Kuhn DR (2008) Refining the in-parameter-order strategy for constructing covering arrays. J Res Natl Inst Stand Technol 113(5):287\u2013297","journal-title":"J Res Natl Inst Stand Technol"},{"key":"4769_CR29","doi-asserted-by":"crossref","unstructured":"Ghandehari LS, Czerwonka J, Lei Y, Shafiee S, Kacker R, Kuhn R (2014) An empirical comparison of combinatorial and random testing. In: International conference on software testing, verification and validation workshops (ICSTW), IEEE, pp 68\u201377","DOI":"10.1109\/ICSTW.2014.8"},{"issue":"4","key":"4769_CR30","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s10664-006-9024-2","volume":"11","author":"M Grindal","year":"2006","unstructured":"Grindal M, Lindstr\u00f6m B, Offutt J, Andler SF (2006) An evaluation of combination strategies for test case selection. Empir Softw Eng 11(4):583\u2013611","journal-title":"Empir Softw Eng"},{"key":"4769_CR31","volume-title":"Statistical methods for psychology","author":"D Howell","year":"2012","unstructured":"Howell D (2012) Statistical methods for psychology. Cengage Learning, Boston"},{"key":"4769_CR32","doi-asserted-by":"crossref","first-page":"1573","DOI":"10.3233\/JIFS-169452","volume":"34","author":"M Jain","year":"2018","unstructured":"Jain M, Maurya S, Rani A, Singh V (2018) Owl search algorithm: a novel nature-inspired heuristic paradigm for global optimization. J Intell Fuzzy Syst 34:1573\u20131582","journal-title":"J Intell Fuzzy Syst"},{"key":"4769_CR33","doi-asserted-by":"crossref","unstructured":"Jia Y, Cohen MB, Harman M, Petke J (2015) Learning combinatorial interaction test generation strategies using hyperheuristic search. In: 2015 IEEE\/ACM 37th IEEE international conference on software engineering, vol 1, pp 540\u2013550","DOI":"10.1109\/ICSE.2015.71"},{"key":"4769_CR34","volume-title":"IEC 61131\u20133: programming industrial automation systems: concepts and programming languages, requirements for programming systems, decision-making aids","author":"KH John","year":"2010","unstructured":"John KH, Tiegelkamp M (2010) IEC 61131\u20133: programming industrial automation systems: concepts and programming languages, requirements for programming systems, decision-making aids. Springer, Berlin"},{"key":"4769_CR35","doi-asserted-by":"crossref","unstructured":"Just R, Jalali D, Inozemtseva L, Ernst MD, Holmes R, Fraser G (2014) Are mutants a valid substitute for real faults in software testing? In: International symposium on foundations of software engineering, ACM","DOI":"10.1145\/2635868.2635929"},{"key":"4769_CR36","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.cie.2018.12.033","volume":"128","author":"AH Kashan","year":"2019","unstructured":"Kashan AH, Tavakkoli-Moghaddam R, Gen M (2019) Find-fix-finish-exploit-analyze (f3ea) meta-heuristic algorithm: an effective algorithm with new evolutionary operators for global optimization. Comput Ind Eng 128:192\u2013218","journal-title":"Comput Ind Eng"},{"key":"4769_CR37","unstructured":"Kendall G, Sabar NR, Ayob M (2014) An exponential Monte Carlo local search algorithm for the berth allocation problem. In: 10th International conference of the practice and theory of automated timetabling, pp 544\u2013548"},{"key":"4769_CR38","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks, vol 4, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"4598","key":"4769_CR39","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"key":"4769_CR40","doi-asserted-by":"crossref","unstructured":"Kuhn DR, Kacker RN, Lei Y (2010) Sp 800-142. Practical combinatorial testing","DOI":"10.6028\/NIST.SP.800-142"},{"key":"4769_CR41","unstructured":"Kuhn DR, Okum V (2006) Pseudo-exhaustive testing for software. In: 30th Annual IEEE\/NASA software engineering workshop, SEW\u201906, IEEE, pp 153\u2013158"},{"key":"4769_CR42","unstructured":"Kuhn DR, Reilly MJ (2002) An investigation of the applicability of design of experiments to software testing. In: Proceedings of the 27th annual NASA Goddard\/IEEE on software engineering workshop, IEEE, pp 91\u201395"},{"issue":"3","key":"4769_CR43","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/stvr.381","volume":"18","author":"Y Lei","year":"2008","unstructured":"Lei Y, Raghu Kacker D, Kuhn R, Okun V, Lawrence J (2008) Ipog\u2013ipog-d: efficient test generation for multi-way combinatorial testing. Softw Test Verif Reliab 18(3):125\u2013148","journal-title":"Softw Test Verif Reliab"},{"key":"4769_CR44","doi-asserted-by":"crossref","unstructured":"Lei Y, Kacker R , Kuhn DR, Okun V, Lawrence J (2007) Ipog: a general strategy for t-way software testing. In: Proceedings of the 14th annual IEEE international conference and workshops on the engineering of computer-based systems. ECBS \u201907, IEEE computer society, Washington, pp 549\u2013556","DOI":"10.1109\/ECBS.2007.47"},{"key":"4769_CR45","doi-asserted-by":"crossref","unstructured":"Lei Y, Tai KC (1998) In-parameter-order: a test generation strategy for pairwise testing. In: Proceedings of third IEEE international high-assurance systems engineering symposium (Cat. No. 98EX231), pp 254\u2013261","DOI":"10.1109\/HASE.1998.731623"},{"key":"4769_CR46","unstructured":"Leung HKN, White L (1991) A cost model to compare regression test strategies. In: Proceedings of the conference on Software maintenance, IEEE, pp 201\u2013208"},{"issue":"22","key":"4769_CR47","doi-asserted-by":"crossref","first-page":"8753","DOI":"10.1016\/j.eswa.2015.07.029","volume":"42","author":"T Mahmoud","year":"2015","unstructured":"Mahmoud T, Ahmed BS (2015) An efficient strategy for covering array construction with fuzzy logic-based adaptive swarm optimization for software testing use. Expert Syst Appl 42(22):8753\u20138765","journal-title":"Expert Syst Appl"},{"issue":"10","key":"4769_CR48","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1145\/4372.4375","volume":"28","author":"R Mandl","year":"1985","unstructured":"Mandl R (1985) Orthogonal latin squares: an application of experiment design to compiler testing. Commun ACM 28(10):1054\u20131058","journal-title":"Commun ACM"},{"key":"4769_CR49","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","volume":"96","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016) Sca: a sine cosine algorithm for solving optimization problems. Knowl Based Syst 96:120\u2013133","journal-title":"Knowl Based Syst"},{"issue":"3","key":"4769_CR50","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1007\/s10489-017-0903-6","volume":"47","author":"SJ Mousavirad","year":"2017","unstructured":"Mousavirad SJ, Ebrahimpour-Komleh H (2017) Human mental search: a new population-based metaheuristic optimization algorithm. Appl Intell 47(3):850\u2013887","journal-title":"Appl Intell"},{"issue":"2","key":"4769_CR51","first-page":"11:1","volume":"43","author":"C Nie","year":"2011","unstructured":"Nie C, Leung H (2011) A survey of combinatorial testing. ACM Comput Surv 43(2):11:1\u201311:29","journal-title":"ACM Comput Surv"},{"key":"4769_CR52","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.cor.2017.09.011","volume":"93","author":"M Pour Shahrzad","year":"2018","unstructured":"Pour Shahrzad M, Drake John H, Burke Edmund K (2018) A choice function hyper-heuristic framework for the allocation of maintenance tasks in danish railways. Comput Oper Res 93:15\u201326","journal-title":"Comput Oper Res"},{"issue":"2","key":"4769_CR53","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1109\/TSE.2010.26","volume":"37","author":"K Praditwong","year":"2011","unstructured":"Praditwong K, Harman M, Yao X (2011) Software module clustering as a multi-objective search problem. IEEE Trans Softw Eng 37(2):264\u2013282","journal-title":"IEEE Trans Softw Eng"},{"key":"4769_CR54","volume-title":"Numerical recipes in C: the art of scientific computing","author":"WH Press","year":"1992","unstructured":"Press WH, Teukolsky SA, Vetterling WT, Flannery BP (1992) Numerical recipes in C: the art of scientific computing, 2nd edn. Cambridge University Press, New York","edition":"2"},{"issue":"1","key":"4769_CR55","first-page":"19","volume":"7","author":"R Rao","year":"2016","unstructured":"Rao R (2016) Jaya: a simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int J Ind Eng Comput 7(1):19\u201334","journal-title":"Int J Ind Eng Comput"},{"issue":"3","key":"4769_CR56","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.cad.2010.12.015","volume":"43","author":"RV Rao","year":"2011","unstructured":"Rao RV, Savsani VJ, Vakharia DP (2011) Teaching-learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des 43(3):303\u2013315","journal-title":"Comput Aided Des"},{"issue":"6","key":"4769_CR57","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1109\/TSE.2004.24","volume":"30","author":"D Richard Kuhn","year":"2004","unstructured":"Richard Kuhn D, Wallace DR, Gallo AM (2004) Software fault interactions and implications for software testing. IEEE Trans Softw Eng 30(6):418\u2013421","journal-title":"IEEE Trans Softw Eng"},{"key":"4769_CR58","unstructured":"R-Project (2005) R: a language and environment for statistical computing. The R foundation for statistical computing, http:\/\/www.R-project.org"},{"key":"4769_CR59","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.ins.2014.10.045","volume":"314(Supplement","author":"NR Sabar","year":"2015","unstructured":"Sabar NR, Kendall G (2015) Population based monte carlo tree search hyper-heuristic for combinatorial optimization problems. Inf Sci 314(Supplement C):225\u2013239","journal-title":"Inf Sci"},{"key":"4769_CR60","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.asoc.2016.01.006","volume":"43(C)","author":"H Samma","year":"2016","unstructured":"Samma H, Lim CP, Saleh JM (2016) A new reinforcement learning-based memetic particle swarm optimizer. Appl Softw Comput 43(C):276\u2013297","journal-title":"Appl Softw Comput"},{"issue":"7","key":"4769_CR61","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1016\/j.infsof.2012.01.007","volume":"54","author":"S Sampath","year":"2012","unstructured":"Sampath S, Bryce RC (2012) Improving the effectiveness of test suite reduction for user-session-based testing of web applications. Inf Softw Technol 54(7):724\u2013738","journal-title":"Inf Softw Technol"},{"key":"4769_CR62","doi-asserted-by":"crossref","unstructured":"Schroeder PJ, Bolaki P, Gopu V (2004) Comparing the fault detection effectiveness of n-way and random test suites. In: International symposium on empirical software engineering, IEEE, pp 49\u201359","DOI":"10.1109\/ISESE.2004.1334893"},{"key":"4769_CR63","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1016\/j.asoc.2018.07.033","volume":"71","author":"H Shayanfar","year":"2018","unstructured":"Shayanfar H, Gharehchopogh FS (2018) Farmland fertility: a new metaheuristic algorithm for solving continuous optimization problems. Appl Soft Comput 71:728\u2013746","journal-title":"Appl Soft Comput"},{"key":"4769_CR64","unstructured":"Shiba T, Tsuchiya T, Kikuno T (2004) Using artificial life techniques to generate test cases for combinatorial testing. In: Proceedings of the 28th annual international computer software and applications conference, COMPSAC \u201904, IEEE computer society, Washington, vol 01, pp 72\u201377"},{"key":"4769_CR65","doi-asserted-by":"crossref","unstructured":"Shin D, Jee E, Bae DH (2012) Empirical evaluation on FBD model-based test coverage criteria using mutation analysis. In: Model driven engineering languages and systems. Springer","DOI":"10.1007\/978-3-642-33666-9_30"},{"key":"4769_CR66","unstructured":"Sobh K, Oliveira D, Liu B, Mayantz M, Zhang YM, Alhazmi A, de Bled R, Al-Sharawi A (2010) Software design document, testing, deployment and configuration management, and user manual of the UUIS\u2014a team 4 COMP5541-W10 project approach. CoRR, abs\/1005.0169"},{"issue":"2","key":"4769_CR67","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1109\/TCC.2014.2315797","volume":"2","author":"CW Tsai","year":"2014","unstructured":"Tsai CW, Huang WC, Chiang MH, Chiang MC, Yang CS (2014) A hyper-heuristic scheduling algorithm for cloud. IEEE Trans Cloud Comput 2(2):236\u2013250","journal-title":"IEEE Trans Cloud Comput"},{"issue":"2","key":"4769_CR68","first-page":"101","volume":"25","author":"A Vargha","year":"2000","unstructured":"Vargha A, Delaney HD (2000) A critique and improvement of the CL common language effect size statistics of McGraw and Wong. J Educ Behav Stat 25(2):101\u2013132","journal-title":"J Educ Behav Stat"},{"issue":"04","key":"4769_CR69","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1142\/S021853930100058X","volume":"8","author":"DR Wallace","year":"2001","unstructured":"Wallace DR, Richard Kuhn D (2001) Failure modes in medical device software: an analysis of 15 years of recall data. Int J Reliab Qual Saf Eng 8(04):351\u2013371","journal-title":"Int J Reliab Qual Saf Eng"},{"key":"4769_CR70","unstructured":"Williams AW, Probert RL (1996) A practical strategy for testing pair-wise coverage of network interfaces. In: Proceedings of seventh international symposium on software reliability engineering, pp 246\u2013254"},{"issue":"4","key":"4769_CR71","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1109\/TEVC.2014.2362532","volume":"19","author":"H Wu","year":"2015","unstructured":"Wu H, Nie C, Kuo FC, Leung H, Colbourn CJ (2015) A discrete particle swarm optimization for covering array generation. IEEE Trans Evolut Comput 19(4):575\u2013591","journal-title":"IEEE Trans Evolut Comput"},{"key":"4769_CR72","unstructured":"Yang XS, Deb S (2009) Cuckoo search via levy flights. In: 2009 World congress on nature biologically inspired computing (NaBIC), pp 210\u2013214"},{"key":"4769_CR73","volume-title":"Nature-inspired metaheuristic algorithms","author":"X-S Yang","year":"2008","unstructured":"Yang X-S (2008) Nature-inspired metaheuristic algorithms. Luniver Press, Frome"},{"key":"4769_CR74","first-page":"240","volume-title":"Flower pollination algorithm for global optimization","author":"X-S Yang","year":"2012","unstructured":"Yang X-S (2012) Flower pollination algorithm for global optimization. Springer, Berlin, pp 240\u2013249"},{"key":"4769_CR75","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.asoc.2016.03.021","volume":"44(C)","author":"KZ Zamli","year":"2016","unstructured":"Zamli KZ, Alkazemi BY, Kendall G (2016) A tabu search hyper-heuristic strategy for t-way test suite generation. Appl Soft Comput 44(C):57\u201374","journal-title":"Appl Soft Comput"},{"key":"4769_CR76","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.ins.2017.03.007","volume":"399(C)","author":"KZ Zamli","year":"2017","unstructured":"Zamli KZ, Din F, Kendall G, Ahmed BS (2017) An experimental study of hyper-heuristic selection and acceptance mechanism for combinatorial t-way test suite generation. Inf Sci 399(C):121\u2013153","journal-title":"Inf Sci"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-04769-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-020-04769-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-04769-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,24]],"date-time":"2021-02-24T00:15:40Z","timestamp":1614125740000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-020-04769-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,25]]},"references-count":76,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["4769"],"URL":"https:\/\/doi.org\/10.1007\/s00500-020-04769-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2020,2,25]]},"assertion":[{"value":"25 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}