IDEAS home Printed from https://ideas.repec.org/a/hin/complx/3988288.html
   My bibliography  Save this article

A Modified Horse Herd Optimization Algorithm and Its Application in the Program Source Code Clustering

Author

Listed:
  • Bahman Arasteh
  • Peri Gunes
  • Asgarali Bouyer
  • Farhad Soleimanian Gharehchopogh
  • Hamed Alipour Banaei
  • Reza Ghanbarzadeh
  • Roberto Natella

Abstract

Maintenance is one of the costliest phases in the software development process. If architectural design models are accessible, software maintenance can be made more straightforward. When the software’s source code is the only available resource, comprehending the program profoundly impacts the costs associated with software maintenance. The primary objective of comprehending the source code is extracting information used during the software maintenance phase. Generating a structural model based on the program source code is an effective way of reducing overall software maintenance costs. Software module clustering is considered a tremendous reverse engineering technique for constructing structural design models from the program source code. The main objectives of clustering modules are to reduce the quantity of connections between clusters, increase connections within clusters, and improve the quality of clustering. Finding the perfect clustering model is considered an NP-complete problem, and many previous approaches had significant issues in addressing this problem, such as low success rates, instability, and poor modularization quality. This paper applied the horse herd optimization algorithm, a distinctive population-based and discrete metaheuristic technique, in clustering software modules. The proposed method’s effectiveness in addressing the module clustering problem was examined by ten real-world standard software test benchmarks. Based on the experimental data, the quality of the clustered models produced is approximately 3.219, with a standard deviation of 0.0718 across the ten benchmarks. The proposed method surpasses former methods in convergence, modularization quality, and result stability. Furthermore, the experimental results demonstrate the versatility of this approach in effectively addressing various real-world discrete optimization challenges.

Suggested Citation

  • Bahman Arasteh & Peri Gunes & Asgarali Bouyer & Farhad Soleimanian Gharehchopogh & Hamed Alipour Banaei & Reza Ghanbarzadeh & Roberto Natella, 2023. "A Modified Horse Herd Optimization Algorithm and Its Application in the Program Source Code Clustering," Complexity, Hindawi, vol. 2023, pages 1-16, December.
  • Handle: RePEc:hin:complx:3988288
    DOI: 10.1155/2023/3988288
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2023/3988288.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2023/3988288.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2023/3988288?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

    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:hin:complx:3988288. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.