IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v11y2025i2id1317.html

A Comparative Analysis of Computational Complexity in Genetic Algorithm Variants: Evaluating Time and Space Trade-offs

Author

Listed:
  • Madhur Jain
  • Shilpi Jain
  • Avinash Kumar

Abstract

Inspired by the evolution principle, GA becomes a more powerful optimization technique, although the authors have already implemented them in a rather different way in other algorithms; hence their differences concerning computational efficiency are extremely visible (Goldberg, 1989) [1]. This work aims to evaluate the computational complexity of the three GA variants: the Standard Genetic Algorithm (SGA), the Elitist Genetic Algorithm (EGA), and the Parallel Genetic Algorithm (PGA) (Mitchell, 1998) [2]. It will study computational complexity in terms of time (with respect to speed of convergence), number of function evaluations, and space complexity in terms of memory size, and memory needed to store the population (Deb, 2001) [3]. The experiment results show how time and memory consumption are related in executing it, hence providing insight on selecting the most appropriate type of GA when the resources used by environments are of paramount importance (Eiben & Smith, 2015) [6]. This might be followed by work on hybrid strategies and adaptive approaches that enhance performance further in GA algorithms (Srinivas & Patnaik, 1994) [12].

Suggested Citation

  • Madhur Jain & Shilpi Jain & Avinash Kumar, 2025. "A Comparative Analysis of Computational Complexity in Genetic Algorithm Variants: Evaluating Time and Space Trade-offs," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 11(2), pages 2730-2738, March.
    • Handle: RePEc:jbh:ijsrcs:v11:y2025:i2:id:1317
    DOI: 10.32628/CSEIT25112749
    Note: Article URL: https://ijsrcseit.com/home/article/view/CSEIT25112749
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/home/article/view/CSEIT25112749
    File Function: Article URL
    Download Restriction: no
    File URL: https://ijsrcseit.com/home/article/download/CSEIT25112749/CSEIT25112749
    File Function: Full text
    Download Restriction: no
    File URL: https://libkey.io/10.32628/CSEIT25112749?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
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:jbh:ijsrcs:v11:y2025:i2:id:1317. 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: Pankaj Sharma (USA) (email available below). General contact details of provider: https://ijsrcseit.com/home .

    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.