IDEAS home Printed from https://ideas.repec.org/a/spr/aodasc/v12y2025i3d10.1007_s40745-025-00600-4.html
   My bibliography  Save this article

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

Author

Listed:
  • An Yingjian

    (Shanghai Construction Management Vocational and Technical College)

  • La Ping

    (Shanghai Construction Management Vocational and Technical College)

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.

Suggested Citation

  • An Yingjian & La Ping, 2025. "Optimal Individual Selection Algorithm Based on Layer Proximity and Branch Distance Functions," Annals of Data Science, Springer, vol. 12(3), pages 1041-1054, June.
    • Handle: RePEc:spr:aodasc:v:12:y:2025:i:3:d:10.1007_s40745-025-00600-4
    DOI: 10.1007/s40745-025-00600-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s40745-025-00600-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s40745-025-00600-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:aodasc:v:12:y:2025:i:3:d:10.1007_s40745-025-00600-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.