Optimal Individual Selection Algorithm Based on Layer Proximity and Branch Distance Functions

An Yingjian () and La Ping
Additional contact information
An Yingjian: Shanghai Construction Management Vocational and Technical College
La Ping: Shanghai Construction Management Vocational and Technical College

Annals of Data Science, 2025, vol. 12, issue 3, No 10, 1054 pages

Abstract: Abstract Automatic generation of test cases using heuristic methods is a hot research topic nowadays. Although its advantages are obvious, it is slightly insufficient in the selection of optimal individuals. Aiming at the existing problems in the evaluation and selection of the optimal individual, this paper proposes a test case evaluation algorithm based on the comprehensive analysis of the characteristics of layer proximity and branch distance function, which is a joint structure of “layer proximity and branch distance function”. The basic idea of this algorithm is that when selecting pilot individuals in the evolutionary process, we first select the individuals with high proximity between the actual execution path and the target path, and then select the individuals with the smallest branching distances among these individuals, so as to obtain the individuals with the optimal piloting ability. Experiments show that the proposed algorithm can quickly find the optimal test cases, especially for the test case generation of multi-layer nested programs.

Keywords: Layer proximity; Evaluation function; Particle swarm algorithm; Heuristics; Optimal individual (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s40745-025-00600-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:aodasc:v:12:y:2025:i:3:d:10.1007_s40745-025-00600-4

Ordering information: This journal article can be ordered from
https://www.springer ... gement/journal/40745

DOI: 10.1007/s40745-025-00600-4

Access Statistics for this article

Annals of Data Science is currently edited by Yong Shi

More articles in Annals of Data Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().