Application of Ant Algorithm for Software Optimization

Shafagat Mahmudova ()

Review of Information Engineering and Applications, 2020, vol. 7, issue 1, 6-17

Abstract: Different technologies, methods and algorithms are used when developing high-quality software systems. There are various ways to create optimal software. One of them is an ant algorithm. The ant algorithm can be attributed to the field of biomimetic. Ant algorithm is one of the most effective polynomial algorithms for finding approximate solutions, and it also solves similar route search problems in graphs. Various methods, including the ant algorithm, are used to improve software efficiency and optimize it. The essence of the concept is to analyze, use, and meta-heuristically optimize the behavior of ants in search of paths to the food source of the colony. This article analyzes the studies in this area, and explains the idea of the algorithm used, compares different ant systems, shows program code operators as ants, and applies the ant algorithm to them. As a result of applying the algorithm, the shortest path to some operators (cycle, condition) contained in the program code is found. The experiments perform good results.

Keywords: Software; Optimization; Ant algorithm; Soft computing; Technology; Method (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
https://archive.conscientiabeam.com/index.php/79/article/view/2684/4201 (application/pdf)
https://archive.conscientiabeam.com/index.php/79/article/view/2684/4829 (text/html)

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:pkp:roieaa:v:7:y:2020:i:1:p:6-17:id:2684

Access Statistics for this article

More articles in Review of Information Engineering and Applications from Conscientia Beam
Bibliographic data for series maintained by Dim Michael ().