{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,27]],"date-time":"2026-08-27T17:53:24Z","timestamp":1787853204859,"version":"build-2784847793"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T00:00:00Z","timestamp":1693267200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T00:00:00Z","timestamp":1693267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Major Project of Inner Mongolia Natural Science Foundation","award":["2019ZD15"],"award-info":[{"award-number":["2019ZD15"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62162046"],"award-info":[{"award-number":["62162046"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research and Application of Key Technology of Big Data for Discipline Inspection and Supervision","award":["2019GG372"],"award-info":[{"award-number":["2019GG372"]}]},{"name":"the Inner Mongolia Science and Technology Project","award":["2021GG0155"],"award-info":[{"award-number":["2021GG0155"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s12293-023-00392-1","type":"journal-article","created":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T08:06:42Z","timestamp":1693296402000},"page":"319-340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A tolerance-based memetic algorithm for constrained covering array generation"],"prefix":"10.1007","volume":"15","author":[{"given":"Xu","family":"Guo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoyu","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jian-tao","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feiyu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,8,29]]},"reference":[{"key":"392_CR1","unstructured":"Sheng Y (2013) Development of testing platform of embedded software based on combinatorial testing. Ph.D. thesis, Harbin Institute of Technology"},{"key":"392_CR2","unstructured":"Kuhn DR, Reilly MJ (2003) An investigation of the applicability of design of experiments to software testing. In: 27th Annual NASA Goddard\/IEEE software engineering workshop, 2002. Proceedings"},{"issue":"2","key":"392_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1883612.1883618","volume":"43","author":"C Nie","year":"2011","unstructured":"Nie C, Leung H (2011) A survey of combinatorial testing. ACM Comput Surv 43(2):1\u201329","journal-title":"ACM Comput Surv"},{"key":"392_CR4","unstructured":"Wu H, Nie C, Petke J, Jia Y, Harman M (2019) A survey of constrained combinatorial testing. arXiv preprint arXiv:1908.02480"},{"key":"392_CR5","doi-asserted-by":"publisher","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"},{"issue":"11","key":"392_CR6","doi-asserted-by":"publisher","first-page":"2549","DOI":"10.1109\/TSE.2019.2955687","volume":"47","author":"H Wu","year":"2019","unstructured":"Wu H, Nie C, Petke J, Jia Y, Harman M (2019) Comparative analysis of constraint handling techniques for constrained combinatorial testing. IEEE Trans Softw Eng 47(11):2549\u20132562","journal-title":"IEEE Trans Softw Eng"},{"issue":"3","key":"392_CR7","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1049\/sfw2.12054","volume":"16","author":"X Guo","year":"2022","unstructured":"Guo X, Song X, Zhou J (2022) A synergic quantum particle swarm optimisation for constrained combinatorial test generation. IET Softw 16(3):279\u2013300","journal-title":"IET Softw"},{"key":"392_CR8","doi-asserted-by":"crossref","unstructured":"Adam SP, Alexandropoulos S-AN, Pardalos PM, Vrahatis MN (2019) No free lunch theorem: a review. Approx Optim 57\u201382","DOI":"10.1007\/978-3-030-12767-1_5"},{"issue":"2","key":"392_CR9","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.ejor.2007.06.028","volume":"190","author":"SO Kimbrough","year":"2008","unstructured":"Kimbrough SO, Koehler GJ, Lu M, Wood DH (2008) On a feasible-infeasible two-population (fi-2pop) genetic algorithm for constrained optimization: distance tracing and no free lunch. Eur J Oper Res 190(2):310\u2013327","journal-title":"Eur J Oper Res"},{"key":"392_CR10","doi-asserted-by":"crossref","unstructured":"Galinier P, Kpodjedo S, Antoniol G (2017) A penalty-based tabu search for constrained covering arrays. In: Proceedings of the genetic and evolutionary computation conference, pp 1288\u20131294","DOI":"10.1145\/3071178.3071324"},{"key":"392_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2021.106768","volume":"143","author":"Y Wang","year":"2022","unstructured":"Wang Y, Wu H, Niu X, Nie C, Xu J (2022) An adaptive penalty based parallel tabu search for constrained covering array generation. Inf Softw Technol 143:106768","journal-title":"Inf Softw Technol"},{"issue":"3","key":"392_CR12","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/4235.873238","volume":"4","author":"TP Runarsson","year":"2000","unstructured":"Runarsson TP, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput 4(3):284\u2013294","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"392_CR13","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1049\/iet-sen.2012.0074","volume":"7","author":"H Avila-George","year":"2013","unstructured":"Avila-George H, Torres-Jimenez J, Gonzalez-Hernandez L, Hern\u00e1ndez V (2013) Metaheuristic approach for constructing functional test-suites. IET Softw 7(2):104\u2013117","journal-title":"IET Softw"},{"key":"392_CR14","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. IEEE","DOI":"10.1109\/ICSE.2015.71"},{"key":"392_CR15","doi-asserted-by":"crossref","unstructured":"Garvin BJ, Cohen MB, Dwyer MB (2009) An improved meta-heuristic search for constrained interaction testing. In: 2009 1st International symposium on search based software engineering, pp 13\u201322. IEEE","DOI":"10.1109\/SSBSE.2009.25"},{"key":"392_CR16","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.infsof.2017.10.007","volume":"94","author":"S Esfandyari","year":"2018","unstructured":"Esfandyari S, Rafe V (2018) A tuned version of genetic algorithm for efficient test suite generation in interactive t-way testing strategy. Inf Softw Technol 94:165\u2013185","journal-title":"Inf Softw Technol"},{"key":"392_CR17","doi-asserted-by":"crossref","unstructured":"Alazzawi AK, Rais HM, Basri S, Alsariera YA, Capretz LF, Balogun AO, Imam AA (2021) Habcsm: a hamming based t-way strategy based on hybrid artificial bee colony for variable strength test sets generation. arXiv preprint arXiv:2110.03728","DOI":"10.15837\/ijccc.2021.5.4308"},{"key":"392_CR18","doi-asserted-by":"crossref","unstructured":"Lin J, Luo C, Cai S, Su K, Hao D, Zhang L (2015) TCA: an efficient two-mode meta-heuristic algorithm for combinatorial test generation (t). In: 2015 30th IEEE\/ACM international conference on automated software engineering (ASE), pp 494\u2013505. IEEE","DOI":"10.1109\/ASE.2015.61"},{"key":"392_CR19","doi-asserted-by":"crossref","unstructured":"Lin J, Cai S, Luo C, Lin Q, Zhang H (2019) Towards more efficient meta-heuristic algorithms for combinatorial test generation. In: Proceedings of the 2019 27th ACM joint meeting on European Software engineering conference and symposium on the foundations of software engineering, pp 212\u2013222","DOI":"10.1145\/3338906.3338914"},{"key":"392_CR20","doi-asserted-by":"crossref","unstructured":"Luo C, Lin J, Cai S, Chen X, He B, Qiao B, Zhao P, Lin Q, Zhang H, Wu W et al (2021) Autoccag: an automated approach to constrained covering array generation. In: 2021 IEEE\/ACM 43rd international conference on software engineering (ICSE), pp 201\u2013212. IEEE","DOI":"10.1109\/ICSE43902.2021.00030"},{"key":"392_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2020.106288","volume":"122","author":"Y Fu","year":"2020","unstructured":"Fu Y, Lei Z, Cai S, Lin J, Wang H (2020) WCA: a weighting local search for constrained combinatorial test optimization. Inf Softw Technol 122:106288","journal-title":"Inf Softw Technol"},{"issue":"4","key":"392_CR22","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1109\/TEVC.2014.2362532","volume":"19","author":"H Wu","year":"2014","unstructured":"Wu H, Nie C, Kuo F-C, Leung H, Colbourn CJ (2014) A discrete particle swarm optimization for covering array generation. IEEE Trans Evol Comput 19(4):575\u2013591","journal-title":"IEEE Trans Evol Comput"},{"issue":"05","key":"392_CR23","doi-asserted-by":"publisher","first-page":"1750021","DOI":"10.1142\/S0218539317500218","volume":"24","author":"Y Sheng","year":"2017","unstructured":"Sheng Y, Wei C, Jiang S (2017) Constraint test cases generation based on particle swarm optimization. Int J Reliab Qual Saf Eng 24(05):1750021","journal-title":"Int J Reliab Qual Saf Eng"},{"key":"392_CR24","doi-asserted-by":"crossref","unstructured":"Wagner M, Kampel L, Simos DE (2019) Quantum-inspired evolutionary algorithms for covering arrays of arbitrary strength. In: International symposium on experimental algorithms, pp 300\u2013316. Springer","DOI":"10.1007\/978-3-030-34029-2_20"},{"key":"392_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114629","volume":"171","author":"X Cai","year":"2021","unstructured":"Cai X, Zhao H, Shang S, Zhou Y, Deng W, Chen H, Deng W (2021) An improved quantum-inspired cooperative co-evolution algorithm with muli-strategy and its application. Expert Syst Appl 171:114629","journal-title":"Expert Syst Appl"},{"issue":"11\u201312","key":"392_CR26","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/S0045-7825(01)00323-1","volume":"191","author":"CAC Coello","year":"2002","unstructured":"Coello CAC (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Methods Appl Mech Eng 191(11\u201312):1245\u20131287","journal-title":"Comput Methods Appl Mech Eng"},{"key":"392_CR27","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.infsof.2017.02.004","volume":"86","author":"BS Ahmed","year":"2017","unstructured":"Ahmed BS, Gambardella LM, Afzal W, Zamli KZ (2017) Handling constraints in combinatorial interaction testing in the presence of multi objective particle swarm and multithreading. Inf Softw Technol 86:20\u201336","journal-title":"Inf Softw Technol"},{"issue":"3","key":"392_CR28","doi-asserted-by":"publisher","first-page":"271","DOI":"10.20532\/cit.2016.1002727","volume":"24","author":"Y Li","year":"2016","unstructured":"Li Y, Sun Z-A, Fang J-Y (2016) Generating an automated test suite by variable strength combinatorial testing for web services. J Comput Inf Technol 24(3):271\u2013282","journal-title":"J Comput Inf Technol"},{"key":"392_CR29","doi-asserted-by":"crossref","unstructured":"Huang S, Cohen MB, Memon AM (2010) Repairing gui test suites using a genetic algorithm. In: 2010 Third international conference on software testing, verification and validation, pp 245\u2013254. IEEE","DOI":"10.1109\/ICST.2010.39"},{"key":"392_CR30","doi-asserted-by":"crossref","unstructured":"Guo X, Song X, Zhou J-t (2018) Effective discrete memetic algorithms for covering array generation. In: 2018 IEEE 42nd annual computer software and applications conference (COMPSAC), vol. 1, pp 298\u2013303. IEEE","DOI":"10.1109\/COMPSAC.2018.00047"},{"key":"392_CR31","doi-asserted-by":"crossref","unstructured":"Sun J, Fang W, Wu X, Palade V, Xu W (2012) Quantum-behaved particle swarm optimization: analysis of individual particle behavior and parameter selection. Evol Comput 20(3):349\u2013393","DOI":"10.1162\/EVCO_a_00049"},{"key":"392_CR32","doi-asserted-by":"crossref","unstructured":"Sun J, Xu W, Liu J (2005) Parameter selection of quantum-behaved particle swarm optimization. In: International conference on natural computation, pp 543\u2013552. Springer","DOI":"10.1007\/11539902_66"},{"issue":"12","key":"392_CR33","doi-asserted-by":"publisher","first-page":"2879","DOI":"10.3724\/SP.J.1001.2011.03973","volume":"22","author":"X Chen","year":"2011","unstructured":"Chen X, Gu Q, Wang Z-Y, Chen D-X (2011) Framework of particle swarm optimization based pairwise testing. J Softw 22(12):2879\u20132893","journal-title":"J Softw"},{"issue":"1","key":"392_CR34","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10664-010-9135-7","volume":"16","author":"BJ Garvin","year":"2011","unstructured":"Garvin BJ, Cohen MB, Dwyer MB (2011) Evaluating improvements to a meta-heuristic search for constrained interaction testing. Empir Softw Eng 16(1):61-102","journal-title":"Empir Softw Eng"},{"key":"392_CR35","doi-asserted-by":"crossref","unstructured":"Alazzawi AK, Rais HM, Basri S (2019) Abcvs: An artificial bee colony for generating variable t-way test sets. Int J Adv Comput Sci Appl 10(4)","DOI":"10.14569\/IJACSA.2019.0100431"},{"issue":"4","key":"392_CR36","doi-asserted-by":"publisher","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"},{"issue":"6","key":"392_CR37","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.infsof.2012.01.002","volume":"54","author":"ARA Alsewari","year":"2012","unstructured":"Alsewari ARA, Zamli KZ (2012) Design and implementation of a harmony-search-based variable-strength t-way testing strategy with constraints support. Inf Softw Technol 54(6):553\u2013568","journal-title":"Inf Softw Technol"},{"key":"392_CR38","doi-asserted-by":"crossref","unstructured":"Wagner M, Kleine K, Simos DE, Kuhn R, Kacker R (2020) Cagen: a fast combinatorial test generation tool with support for constraints and higher-index arrays. In: 2020 IEEE international conference on software testing, verification and validation workshops (ICSTW), pp 191\u2013200. IEEE","DOI":"10.1109\/ICSTW50294.2020.00041"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-023-00392-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-023-00392-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-023-00392-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T08:40:12Z","timestamp":1694076012000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-023-00392-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,29]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["392"],"URL":"https:\/\/doi.org\/10.1007\/s12293-023-00392-1","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,29]]},"assertion":[{"value":"29 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}