IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v12y2021i6d10.1007_s13198-021-01319-0.html
   My bibliography  Save this article

Teaching–learning-based genetic algorithm (TLBGA): an improved solution method for continuous optimization problems

Author

Listed:
  • Foroogh Behroozi

    (Alzahra University)

  • Seyed Mohammad Hassan Hosseini

    (Shahrood University of Technology)

  • Shib Sankar Sana

    (Kishore Bharati Bhagini Nivedita College)

Abstract

The mutation is one of the most important stages in the genetic algorithm (GA) because of its influence on exploring solution space and overcoming premature convergence. Since there are many types of mutation operators, the problem lies in selecting the appropriate type, and so, researchers usually need more trial and error. This paper investigates a new mutation operator based on teaching–learning-based optimization (TLBO) to enhance the performance of genetic algorithms. This new mutation operator treats intelligently instead of the random type, enhances the quality of solution, and speeds up the convergence of GA simultaneously. Several experiments are conducted on six standard test functions to evaluate the effect of the proposed mutation operator. First, proper comparisons are made between the performance of the proposed mutation to the classic mutation of GA and their combinatorial format. The result indicates the effect of the proposed mutation operator on the significant enhancement of the genetic algorithms’ performance particularly. Due to computational analysis with Intel(R) Core(TM) i5-2430 M CPU @ 2.40 GHz processor, this method causes 32–53.3% reduction in essential iteration to present zero amount as the final value for four test functions (i.e., Beale, Himmelblau, Booth, and Rastrigin). For the two other functions that provides a non-zero value (i.e., Ackley and Sphere), the proposed method improves nearly 100% in average of objective. According to the result, the final solutions of the proposed method are equal or better than the classic GA in all six problems. Then, the performance of the proposed algorithm in comparison to five well-known algorithms ensures its superiority. In all comparisons, the proposed method performs equal or better than five other algorithms in CPU time and quality solutions.

Suggested Citation

  • Foroogh Behroozi & Seyed Mohammad Hassan Hosseini & Shib Sankar Sana, 2021. "Teaching–learning-based genetic algorithm (TLBGA): an improved solution method for continuous optimization problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 12(6), pages 1362-1384, December.
  • Handle: RePEc:spr:ijsaem:v:12:y:2021:i:6:d:10.1007_s13198-021-01319-0
    DOI: 10.1007/s13198-021-01319-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-021-01319-0
    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/s13198-021-01319-0?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.

    References listed on IDEAS

    as
    1. Bin Wang & Xiaopeng Wei & Jing Dong & Qiang Zhang, 2015. "Improved Lower Bounds of DNA Tags Based on a Modified Genetic Algorithm," PLOS ONE, Public Library of Science, vol. 10(2), pages 1-10, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Swarupa Pinninti & Srinivasa Rao Sura, 2023. "Renewables based dynamic cost-effective optimal scheduling of distributed generators using teaching–learning-based optimization," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 14(1), pages 353-373, March.
    2. Debasmita Sarkar & Pankaj Kumar Srivastava, 2024. "Recent development and applications of neutrosophic fuzzy optimization approach," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 15(6), pages 2042-2066, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:ijsaem:v:12:y:2021:i:6:d:10.1007_s13198-021-01319-0. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.