{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T16:57:39Z","timestamp":1782406659647,"version":"3.54.5"},"reference-count":22,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T00:00:00Z","timestamp":1744243200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Intelligent Decision Technologies"],"published-print":{"date-parts":[[2025,7]]},"abstract":"<jats:p>Complex software systems often possess complex logical structures, and automatic test case generation may be difficult to fully cover complex business logic. To address this issue, an evolutionary test case generation model with radial basis function neural network and improved genetic algorithm is proposed. Firstly, traditional genetic algorithm is improved, and then evolutionary test case generation model is established. The results show that the average execution time of the improved genetic algorithm proposed in the study is 50.878 s, which is approximately 0.18\u2005s faster than that of the improved adaptive genetic algorithm. The average number of iterations for the improved genetic algorithm in triangle classification is 95.27, and in date calculation, it is 74.51. These figures are 14.11 and 18.36 lower than those of the improved adaptive genetic algorithm, respectively. The proposed model achieves 100% average and maximum coverage in five classic benchmark programs, and significantly reduces the number of iterations compared to traditional genetic algorithms. To sum up, model developed in the study has a good application effect in automatic generation of test cases and promoting computer software applications.<\/jats:p>","DOI":"10.1177\/18724981251332529","type":"journal-article","created":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T10:02:47Z","timestamp":1744279367000},"page":"2310-2323","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["Evolutionary test case generation with improved genetic algorithm"],"prefix":"10.1177","volume":"19","author":[{"given":"Dandan","family":"He","sequence":"first","affiliation":[{"name":"School of Information Science and Technology, Dalian University of Science and Technology, Dalian, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danni","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, Dalian University of Science and Technology, Dalian, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lin","family":"Li","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, Dalian University of Science and Technology, Dalian, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","published-online":{"date-parts":[[2025,4,10]]},"reference":[{"key":"e_1_3_2_2_2","first-page":"126","article-title":"Reliable automated software testing through hybrid optimization algorithm","volume":"2","author":"Shakya S","year":"2020","unstructured":"Shakya S, Smys S. Reliable automated software testing through hybrid optimization algorithm. J Ubiquitous Comput Commun Technol 2020; 2: 126\u2013135.","journal-title":"J Ubiquitous Comput Commun Technol"},{"key":"e_1_3_2_3_2","first-page":"465","article-title":"Software testing using an adaptive genetic algorithm","volume":"9","author":"Damia AH","year":"2021","unstructured":"Damia AH, Esnaashari M, Parvizimosaed MR. Software testing using an adaptive genetic algorithm. J AI Data Min 2021; 9: 465\u2013474.","journal-title":"J AI Data Min"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2019.05.004"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/suco.202000047"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1121\/10.0002656"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.15575\/join.v5i1.532"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-020-00398-3"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1080\/23744731.2019.1624095"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/er.5608"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asej.2020.07.003"},{"key":"e_1_3_2_12_2","first-page":"135","article-title":"Design an adaptive hybrid approach for genetic algorithm to detect effective malware detection in android division","volume":"3","author":"Vivekanandam B","year":"2021","unstructured":"Vivekanandam B. Design an adaptive hybrid approach for genetic algorithm to detect effective malware detection in android division. J Ubiquit Comput Commun Technol 2021; 3: 135\u2013149.","journal-title":"J Ubiquit Comput Commun Technol"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ceramint.2020.12.167"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2020.2998503"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2022.3184842"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2020.2999884"},{"key":"e_1_3_2_17_2","first-page":"96","article-title":"Developer centric test amplification: the interaction between automatic generation human exploration","volume":"27","author":"Brandt C","year":"2022","unstructured":"Brandt C, Zaidman A. Developer centric test amplification: the interaction between automatic generation human exploration. Imper Softw Eng 2022; 27: 96.","journal-title":"Imper Softw Eng"},{"key":"e_1_3_2_18_2","first-page":"19","article-title":"Automated test data generation using a combination of fire algorithm and annual reproduction optimization algorithm","volume":"3","author":"Damia AH","year":"2020","unstructured":"Damia AH, Esnaashari MM. Automated test data generation using a combination of fire algorithm and annual reproduction optimization algorithm. Int J Web Res 2020; 3: 19\u201328.","journal-title":"Int J Web Res"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2021.3068784"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-019-00170-6"},{"key":"e_1_3_2_21_2","first-page":"103","article-title":"Research on internet security situation awareness prediction technology based on improved RBF neural network algorithm","volume":"1","author":"Chen Z","year":"2022","unstructured":"Chen Z. Research on internet security situation awareness prediction technology based on improved RBF neural network algorithm. J Computat Cooperat Eng 2022; 1: 103\u2013108.","journal-title":"J Computat Cooperat Eng"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.3390\/info14030166"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0242812"}],"container-title":["Intelligent Decision Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/18724981251332529","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/18724981251332529","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/18724981251332529","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:21:27Z","timestamp":1777454487000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/18724981251332529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,10]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["10.1177\/18724981251332529"],"URL":"https:\/\/doi.org\/10.1177\/18724981251332529","relation":{},"ISSN":["1872-4981","1875-8843"],"issn-type":[{"value":"1872-4981","type":"print"},{"value":"1875-8843","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,10]]}}}