{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T22:11:01Z","timestamp":1768342261401,"version":"3.49.0"},"reference-count":69,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100003093","name":"Ministry of Education, Malaysia","doi-asserted-by":"publisher","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":"publisher"}]},{"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"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3032851","type":"journal-article","created":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T19:49:09Z","timestamp":1603309749000},"page":"192288-192303","source":"Crossref","is-referenced-by-count":27,"title":["Combinatorial Test Suites Generation Strategy Utilizing the Whale Optimization Algorithm"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4635-7385","authenticated-orcid":false,"given":"Ali Abdullah","family":"Hassan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0037-841X","authenticated-orcid":false,"given":"Salwani","family":"Abdullah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4626-0513","authenticated-orcid":false,"given":"Kamal Z.","family":"Zamli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rozilawati","family":"Razali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2973696"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.07.015"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2015.01.010"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-3-642-12538-6_6","article-title":"A new metaheuristic bat-inspired algorithm","author":"yang","year":"2010","journal-title":"Nature Inspired Cooperative Strategies for Optimization (NICSO)"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.06.044"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.04.126"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.03.004"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"kirkpatrick","year":"1983","journal-title":"Science"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.10.048"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.12.022"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.07.029"},{"key":"ref63","first-page":"19","article-title":"Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems","volume":"7","author":"venkata rao","year":"2016","journal-title":"Int J Ind Eng Comput"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"ref64","first-page":"240","article-title":"Flower pollination algorithm for global optimization","author":"yang","year":"2012","journal-title":"Proc Int Conf Unconventional Comput Natural Comput"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2010.05.011"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-011-0241-y"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.07.012"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-007-9149-x"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/2001420.2001451"},{"key":"ref68","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1145\/2970276.2970335","article-title":"Greedy combinatorial test case generation using unsatisfiable cores","author":"yamada","year":"2016","journal-title":"Proc 31st IEEE\/ACM Int Conf Automated Softw Eng (ASE)"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/ICCKE.2017.8167914"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2004.24"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.09.024"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.381"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-0-387-35516-0_4","article-title":"Determination of test configurations for pair-wise interaction coverage","author":"williams","year":"2000","journal-title":"Testing of Communicating Systems"},{"key":"ref21","author":"jenkins","year":"2016","journal-title":"Jenny Test Tool"},{"key":"ref24","author":"goldberg","year":"1989","journal-title":"Genetic Algorithms in Search Optimization and Machine Learning"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.07.006"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.919004"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008202821328"},{"key":"ref50","first-page":"352","article-title":"An improved jaya algorithm-based strategy for t-way test suite generation","author":"nasser","year":"2019","journal-title":"Proc Int Conf Reliable Inf Commun Technol"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/AMS.2010.14"},{"key":"ref59","first-page":"419","article-title":"Pairwise testing in real word: practical extensions to test case generators","author":"czerwonka","year":"2006","journal-title":"Proc Pacific Northwest Software Quality Conf"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.14569\/IJACSA.2019.0100431"},{"key":"ref57","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.infsof.2017.10.007","article-title":"A tuned version of genetic algorithm for efficient test suite generation in interactive t-way testing strategy","volume":"94","author":"esfandyari","year":"2018","journal-title":"Inf Softw Technol"},{"key":"ref56","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/j.infsof.2012.01.002","article-title":"Design and implementation of a harmony-search-based variable-strength t-way testing strategy with constraints support","volume":"54","author":"alsewari","year":"2012","journal-title":"Inf Softw Technol"},{"key":"ref55","first-page":"431","article-title":"Constructing a t-way interaction test suite using the particle swarm optimization approach","volume":"8","author":"ahmed","year":"2012","journal-title":"Int J Innov Comput Inf Control"},{"key":"ref54","article-title":"Metaheuristics and the search for covering and packing arrays [microform]","author":"stardom","year":"2001"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2017.02.004"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-017-1401-7"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ymssp.2018.12.034"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3356718"},{"key":"ref40","article-title":"A review on recent T-way combinatorial testing strategy","volume":"140","author":"ramli","year":"2017","journal-title":"Proc MATEC Web Conf"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908200"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1247-6"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.enconman.2018.08.053"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ITCE.2018.8316594"},{"key":"ref16","first-page":"252","article-title":"An analysis of test suite minimization techniques","volume":"5","author":"singh","year":"2016","journal-title":"Int J Sci Tech Res"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-2317-5_12"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2016.12.014"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ECBS.2007.47"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2015.05.005"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2010.17"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICED.2016.7804713"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSCE.2015.7482175"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2016.01.008"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.03.021"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1166\/asl.2018.12929"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.08.027"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICCOINS.2018.8510601"},{"key":"ref45","first-page":"103","article-title":"Artificial bee colony algorithm for pairwise test generation","volume":"9","author":"alazzawi","year":"2017","journal-title":"J Telecommun Electron Comput Eng"},{"key":"ref48","first-page":"936","article-title":"Firefly combinatorial testing strategy","author":"alsewari","year":"2018","journal-title":"Proc Sci Inf Conf"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICSEngT.2017.8123413"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2362532"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2015.61"},{"key":"ref44","first-page":"71","article-title":"Benchmarking of Bat-inspired interaction testing strategy","volume":"7","author":"alsariera","year":"2016","journal-title":"Int J Comput Sci Inf Eng (IJCSIE)"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICIEA.2015.7334096"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09234407.pdf?arnumber=9234407","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T22:40:23Z","timestamp":1643150423000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9234407\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":69,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3032851","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}