{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T19:53:11Z","timestamp":1780516391158,"version":"3.54.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"34","license":[{"start":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T00:00:00Z","timestamp":1694995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T00:00:00Z","timestamp":1694995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003093","name":"Ministry of Education, Malaysia","doi-asserted-by":"crossref","award":["FRGS \/1\/2019\/ICT02\/UKM\/01\/1"],"award-info":[{"award-number":["FRGS \/1\/2019\/ICT02\/UKM\/01\/1"]}],"id":[{"id":"10.13039\/501100003093","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004515","name":"Universiti Kebangsaan Malaysia","doi-asserted-by":"publisher","award":["DIP- 2016-024"],"award-info":[{"award-number":["DIP- 2016-024"]}],"id":[{"id":"10.13039\/501100004515","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hadhramout Foundation, Yemen"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s00521-023-09000-2","type":"journal-article","created":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T16:02:16Z","timestamp":1695052936000},"page":"24069-24090","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Q-learning whale optimization algorithm for test suite generation with constraints support"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4635-7385","authenticated-orcid":false,"given":"Ali Abdullah","family":"Hassan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Salwani","family":"Abdullah","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kamal Z.","family":"Zamli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rozilawati","family":"Razali","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,9,18]]},"reference":[{"key":"9000_CR1","doi-asserted-by":"publisher","first-page":"192288","DOI":"10.1109\/ACCESS.2020.3032851","volume":"8","author":"AA Hassan","year":"2020","unstructured":"Hassan AA, Abdullah S, Zamli KZ, Razali R (2020) Combinatorial test suites generation strategy utilizing the whale optimization algorithm. IEEE Access 8:192288\u2013192303","journal-title":"IEEE Access"},{"key":"9000_CR2","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.cie.2013.10.009","volume":"67","author":"S Abdullah","year":"2014","unstructured":"Abdullah S, Sabar NR, Nazri MZA, Ayob M (2014) An exponential Monte-Carlo algorithm for feature selection problems. Comput Ind Eng 67:160\u2013167","journal-title":"Comput Ind Eng"},{"key":"9000_CR3","doi-asserted-by":"crossref","unstructured":"Sabar, N. R., Ayob, M., & Kendall, G. (2009). Tabu exponential monte-carlo with counter heuristic for examination timetabling. In 2009 IEEE Symposium on Computational Intelligence in Scheduling (pp. 90-94). IEEE.","DOI":"10.1109\/SCIS.2009.4927020"},{"issue":"1","key":"9000_CR4","doi-asserted-by":"publisher","first-page":"2057","DOI":"10.32604\/cmc.2022.026310","volume":"73","author":"AA Hassan","year":"2022","unstructured":"Hassan AA, Abdullah S, Zamli KZ, Razali R (2022) Whale optimization algorithm strategies for higher interaction strength t-way testing. Comput Mater Cont 73(1):2057\u20132077. https:\/\/doi.org\/10.32604\/cmc.2022.026310","journal-title":"Comput Mater Cont"},{"issue":"1,2","key":"9000_CR5","first-page":"125","volume":"59","author":"CJ Colbourn","year":"2004","unstructured":"Colbourn CJ (2004) Combinatorial aspects of covering arrays. Le Matematiche 59(1,2):125\u2013172","journal-title":"Le Matematiche"},{"issue":"2","key":"9000_CR6","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/s11831-020-09415-3","volume":"28","author":"R Behmanesh","year":"2021","unstructured":"Behmanesh R, Rahimi I, Gandomi AH (2021) Evolutionary many-objective algorithms for combinatorial optimization problems: a comparative study. Arch Comput Meth Eng 28(2):673\u2013688","journal-title":"Arch Comput Meth Eng"},{"issue":"6","key":"9000_CR7","doi-asserted-by":"publisher","first-page":"4451","DOI":"10.1007\/s11063-021-10607-6","volume":"53","author":"S Kassaymeh","year":"2021","unstructured":"Kassaymeh S, Abdullah S, Al-Laham M, Alweshah M, Al-Betar MA, Othman Z (2021) Salp swarm optimizer for modeling software reliability prediction problems. Neural Process Lett 53(6):4451\u20134487","journal-title":"Neural Process Lett"},{"key":"9000_CR8","doi-asserted-by":"publisher","first-page":"27404","DOI":"10.1109\/ACCESS.2022.3157400","volume":"10","author":"AA Muazu","year":"2022","unstructured":"Muazu AA, Hashim AS, Sarlan A (2022) Review of nature inspired metaheuristic algorithm selection for combinatorial t-way testing. IEEE Access 10:27404\u201327431","journal-title":"IEEE Access"},{"key":"9000_CR9","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"},{"issue":"8","key":"9000_CR10","doi-asserted-by":"publisher","first-page":"2821","DOI":"10.1007\/s13369-015-2022-1","volume":"41","author":"S Sabharwal","year":"2016","unstructured":"Sabharwal S, Bansal P, Mittal N, Malik S (2016) Construction of mixed covering arrays for pair-wise testing using probabilistic approach in genetic algorithm. Arab J Sci Eng 41(8):2821\u20132835","journal-title":"Arab J Sci Eng"},{"key":"9000_CR11","unstructured":"Bansal P, Sabharwal S, Mittal N, Arora S (2015) Construction of variable strength covering array for combinatorial testing using a greedy approach to genetic algorithm, e-Inf Softw Eng J 9(1)"},{"issue":"4","key":"9000_CR12","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 Evolut Comput 19(4):575\u2013591","journal-title":"IEEE Trans Evolut Comput"},{"key":"9000_CR13","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.infsof.2015.05.005","volume":"66","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:13\u201329","journal-title":"Inf Softw Technol"},{"issue":"6","key":"9000_CR14","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"},{"issue":"5","key":"9000_CR15","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0195675","volume":"13","author":"KZ Zamli","year":"2018","unstructured":"Zamli KZ, Din F, Ahmed BS, Bures M (2018) A hybrid q-learning sine-cosine-based strategy for addressing the combinatorial test suite minimization problem. PloS One 13(5):e0195675","journal-title":"PloS One"},{"issue":"22","key":"9000_CR16","doi-asserted-by":"publisher","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. Exp Syst Appl 42(22):8753\u20138765","journal-title":"Exp Syst Appl"},{"key":"9000_CR17","doi-asserted-by":"crossref","unstructured":"Zamli KZ, Ahmed BS, Mahmoud T, Afzal W (2018) Fuzzy adaptive tuning of a particle swarm optimization algorithm for variable-strength combinatorial test suite generation, arXiv preprint arXiv:1810.05824","DOI":"10.1049\/PBCE119H_ch22"},{"key":"9000_CR18","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.engappai.2016.12.014","volume":"59","author":"KZ Zamli","year":"2017","unstructured":"Zamli KZ, Din F, Baharom S, Ahmed BS (2017) Fuzzy adaptive teaching learning-based optimization strategy for the problem of generating mixed strength t-way test suites. Eng Appl Artif Intell 59:35\u201350","journal-title":"Eng Appl Artif Intell"},{"key":"9000_CR19","doi-asserted-by":"crossref","unstructured":"Nasser AB, Zamli KZ, Ahmed BS (2019) Dynamic solution probability acceptance within the flower pollination algorithm for t-way test suite generation, arXiv preprint arXiv:1902.11160","DOI":"10.1007\/978-981-13-6031-2_4"},{"issue":"8","key":"9000_CR20","first-page":"4860","volume":"34","author":"KM Htay","year":"2021","unstructured":"Htay KM, Othman RR, Amir A, Alkanaani JMH (2021) Gravitational search algorithm based strategy for combinatorial t-way test suite generation. J King Saud Univ Comput Inf Sci 34(8):4860\u20134873","journal-title":"J King Saud Univ Comput Inf Sci"},{"issue":"1","key":"9000_CR21","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evolut Comput 1(1):67\u201382","journal-title":"IEEE Trans Evolut Comput"},{"key":"9000_CR22","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51\u201367","journal-title":"Adv Eng Softw"},{"issue":"3\u20134","key":"9000_CR23","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF00992698","volume":"8","author":"CJ Watkins","year":"1992","unstructured":"Watkins CJ, Dayan P (1992) Q-learning. Mach Learn 8(3\u20134):279\u2013292","journal-title":"Mach Learn"},{"key":"9000_CR24","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.asoc.2016.01.006","volume":"43","author":"H Samma","year":"2016","unstructured":"Samma H, Lim CP, Saleh JM (2016) A new reinforcement learning-based memetic particle swarm optimizer. Appl Soft Comput 43:276\u2013297","journal-title":"Appl Soft Comput"},{"key":"9000_CR25","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","DOI":"10.14569\/IJACSA.2019.0100431"},{"key":"9000_CR26","unstructured":"Jenkins B (2016) Jenny test tool. http:\/\/www.burtleburtle.net.\/bob\/math\/jenny.html"},{"key":"9000_CR27","doi-asserted-by":"crossref","unstructured":"Williams AW (2000) Determination of test configurations for pair-wise interaction coverage. In: Testing of communicating systems, Springer, pp 59\u201374","DOI":"10.1007\/978-0-387-35516-0_4"},{"key":"9000_CR28","unstructured":"Czerwonka J, Butt D, Gens C (2006) Pairwise testing in real word: practical extensions to test case generators. In: Proceedings of the 24th pacific northwest software quality conf, Vol. 2006"},{"issue":"3","key":"9000_CR29","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/stvr.381","volume":"18","author":"Y Lei","year":"2008","unstructured":"Lei Y, Kacker R, Kuhn DR, Okun V, Lawrence J (2008) Ipog\/ipog-d: efficient test generation for multi-way combinatorial testing. Softw Test Verif Reliab 18(3):125\u2013148","journal-title":"Softw Test Verif Reliab"},{"key":"9000_CR30","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: 14th Annual IEEE international conference and workshops on the engineering of computer-based systems (ECBS\u201907), IEEE, pp 549\u2013556","DOI":"10.1109\/ECBS.2007.47"},{"key":"9000_CR31","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.ins.2018.10.048","volume":"477","author":"J Torres-Jimenez","year":"2019","unstructured":"Torres-Jimenez J, Perez-Torres JC (2019) A greedy algorithm to construct covering arrays using a graph representation. Inf Sci 477:234\u2013245","journal-title":"Inf Sci"},{"issue":"2","key":"9000_CR32","first-page":"52","volume":"6","author":"A Alsewari","year":"2015","unstructured":"Alsewari A, Zamli KZ, Al-Kazemi B (2015) Generating t-way test suite in the presence of constraints. J Eng Technol (JET) 6(2):52\u201366","journal-title":"J Eng Technol (JET)"},{"key":"9000_CR33","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, pp 129\u2013139","DOI":"10.1145\/1273463.1273482"},{"issue":"10","key":"9000_CR34","doi-asserted-by":"publisher","first-page":"7245","DOI":"10.1166\/asl.2018.12922","volume":"24","author":"YA Alsariera","year":"2018","unstructured":"Alsariera YA, Ahmed HAS, Alamri HS, Majid MA, Zamli KZ (2018) A bat-inspired testing strategy for generating constraints pairwise test suite. Adv Sci Lett 24(10):7245\u20137250","journal-title":"Adv Sci Lett"},{"key":"9000_CR35","doi-asserted-by":"crossref","unstructured":"Alazzawi AK, Rais HM, Basri S, Alsariera YA (2019) Phabc: a hybrid artificial bee colony strategy for pairwise test suite generation with constraints support. In: 2019 IEEE student conference on research and development (SCOReD), IEEE, pp 106\u2013111","DOI":"10.1109\/SCORED.2019.8896324"},{"issue":"9","key":"9000_CR36","doi-asserted-by":"publisher","first-page":"1741","DOI":"10.1016\/j.ins.2011.01.002","volume":"181","author":"KZ Zamli","year":"2011","unstructured":"Zamli KZ, Klaib MF, Younis MI, Isa NAM, Abdullah R (2011) Design and implementation of a t-way test data generation strategy with automated execution tool support. Inf Sci 181(9):1741\u20131758","journal-title":"Inf Sci"},{"key":"9000_CR37","unstructured":"Vlad-Roubtsov, Emma: a free java code coverage tool (2006). http:\/\/emma.sourceforge.net"},{"issue":"5","key":"9000_CR38","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s11253-018-1526-8","volume":"70","author":"Z Altawallbeh","year":"2018","unstructured":"Altawallbeh Z, Al-Smadi M, Komashynska I, Ateiwi A (2018) Numerical solutions of fractional systems of two-point bvps by using the iterative reproducing kernel algorithm. Ukrain Math J 70(5):687\u2013701","journal-title":"Ukrain Math J"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-09000-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-023-09000-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-09000-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,3]],"date-time":"2023-11-03T13:04:58Z","timestamp":1699016698000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-023-09000-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,18]]},"references-count":38,"journal-issue":{"issue":"34","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["9000"],"URL":"https:\/\/doi.org\/10.1007\/s00521-023-09000-2","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,18]]},"assertion":[{"value":"24 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no known competing financial interest or personal relationship that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}