{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:00:37Z","timestamp":1781107237535,"version":"3.54.1"},"reference-count":19,"publisher":"IGI Global Scientific Publishing","issue":"1","license":[{"start":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T00:00:00Z","timestamp":1655424000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/deed.en_US"},{"start":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T00:00:00Z","timestamp":1655424000000},"content-version":"am","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/deed.en_US"},{"start":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T00:00:00Z","timestamp":1655424000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/deed.en_US"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,17]]},"abstract":"<p>Software Product Lines(SPLs) covers a mixture of features for testing Software Application Program(SPA). Testing cost reduction is a major metric of software testing. In combinatorial testing(CT), maximization of fault type coverage and test suite reduction plays a key role to reduce the testing cost of SPA. Metaheuristic Genetic Algorithm(GA) do not offer best outcome for test suite optimization problem due to mutation operation and required more computational time. So, Fault-Type Coverage Based Ant Colony Optimization(FTCBACO) algorithm is offered for test suite reduction in CT. FTCBACO algorithm starts with test cases in test suite and assign separate ant to each test case. Ants elect best test cases by updating of pheromone trails and selection of higher probability trails. Best test case path of ant with least time are taken as optimal solution for performing CT. Hence, FTCBACO Technique enriches reduction rate of test suite and minimizes computational time of reducing test cases efficiently for CT.<\/p>","DOI":"10.4018\/ijamc.2022010106","type":"journal-article","created":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T08:51:09Z","timestamp":1635497469000},"page":"1-23","source":"Crossref","is-referenced-by-count":8,"title":["Optimum Test Suite Using Fault-Type Coverage-Based Ant Colony Optimization Algorithm"],"prefix":"10.4018","volume":"13","author":[{"given":"M.","family":"Bharathi","sequence":"first","affiliation":[{"name":"Department of Computer Science, Government Arts and Science College, Pennagaram, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"issue":"2","key":"IJAMC.2022010106-0","article-title":"Neuro-Fuzzy Modeling for Multi-Objective Test Suite Optimization.","volume":"25","author":"AhsanAnwar","year":"2015","journal-title":"Journal of Intelligent Systems"},{"issue":"12","key":"IJAMC.2022010106-1","article-title":"Test Case Optimization for Enhancing System Software Quality using Genetic Algorithm.","volume":"8","year":"2019","journal-title":"International Journal of Innovative Technology and Exploring Engineering"},{"key":"IJAMC.2022010106-2","doi-asserted-by":"publisher","DOI":"10.1007\/s11219-014-9265-z"},{"key":"IJAMC.2022010106-3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cl.2013.04.001"},{"key":"IJAMC.2022010106-4","doi-asserted-by":"crossref","unstructured":"Haider, Ali, Nadeem, Aamer, Rafiq, & Shahzad. (2014). Multiple objective test suite optimization: A fuzzy logic based approach. Journal of Intelligent & Fuzzy Systems, 27(2), 863-875.","DOI":"10.3233\/IFS-131045"},{"issue":"1","key":"IJAMC.2022010106-5","first-page":"17","article-title":"A greedy approach for coverage-based Test Suite reduction","volume":"12","author":"P.Harris","year":"2015","journal-title":"The International Arab Journal of Information Technology"},{"key":"IJAMC.2022010106-6","doi-asserted-by":"publisher","DOI":"10.1145\/152388.152391"},{"key":"IJAMC.2022010106-7","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2005.88"},{"key":"IJAMC.2022010106-8","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.08.437"},{"issue":"11","key":"IJAMC.2022010106-9","first-page":"1","article-title":"An Efficient Technique to Test Suite Minimization using Hierarchical Clustering Approach.","volume":"3","year":"2015","journal-title":"International Journal of Emerging Science and Engineering"},{"key":"IJAMC.2022010106-10","doi-asserted-by":"publisher","DOI":"10.1109\/INMIC.2006.358177"},{"key":"IJAMC.2022010106-11","doi-asserted-by":"crossref","unstructured":"Lam, Raju, Kiran, & Srivastav. (2012). Automated Generation of Independent Paths and Test Suite Optimization Using Artificial Bee Colony. Procedia Engineering, 30, 191-200.","DOI":"10.1016\/j.proeng.2012.01.851"},{"key":"IJAMC.2022010106-12","article-title":"An Effective Strategy to Build Up a Balanced Test Suite for Spectrum-Based Fault Localization.","author":"N.Li","year":"2016","journal-title":"Mathematical Problems in Engineering"},{"key":"IJAMC.2022010106-13","doi-asserted-by":"crossref","unstructured":"Li, Zheng, Harman, & Hieron. (2007). Search Algorithms for Regression Test Case Prioritization. IEEE Transactions on Software Engineering, 33(4), 225-237.","DOI":"10.1109\/TSE.2007.38"},{"key":"IJAMC.2022010106-14","doi-asserted-by":"publisher","DOI":"10.1145\/248233.248262"},{"issue":"4","key":"IJAMC.2022010106-15","first-page":"372","article-title":"An Effective Test Suite Reduction Using Priority Cost Technique.","volume":"4","year":"2013","journal-title":"International Journal of Computer Science and Engineering Technology"},{"key":"IJAMC.2022010106-16","first-page":"1","article-title":"State-Model-Based Regression Test Reduction for Component-Based Software. International Scholarly Research Network, ISRN","volume":"2012","year":"2012","journal-title":"Software Engineering"},{"key":"IJAMC.2022010106-17","first-page":"252","article-title":"An Analysis of Test Suite Minimization Techniques.","volume":"5","year":"2016","journal-title":"International Journal of Engineering Sciences & Research Technology"},{"key":"IJAMC.2022010106-18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2009.11.706"}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=284577","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T17:23:16Z","timestamp":1673889796000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJAMC.2022010106"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2022,6,17]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"URL":"https:\/\/doi.org\/10.4018\/ijamc.2022010106","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"value":"1947-8283","type":"print"},{"value":"1947-8291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,17]]}}}