Novel Discrete Rao Algorithms for Solving the Travelling Salesman Problem

Ankit Kumar Nikum
Additional contact information
Ankit Kumar Nikum: Sardar Vallabhbhai National Institute of Technology, India

International Journal of Applied Evolutionary Computation (IJAEC), 2021, vol. 12, issue 3, 44-61

Abstract: Rao algorithms are population-based metaphor-less optimization algorithms. Rao algorithms consist of three algorithms characterized by three mathematical equations. These algorithms use the characteristics of the best and worst solution to modify the current population along with some characteristics of a random solution. These algorithms are found to be very efficient for continuous optimization problems. In this paper, efforts are made to convert Rao 1 algorithm to its discrete form. This paper proposes three techniques for converting these continuous Rao algorithms to their discrete form. One of the techniques is based on swap operator used for transforming PSO to discrete PSO, and the other two techniques are based on two novel mutating techniques. The algorithms are applied to symmetric TSP problems, and the results are compared with different state of the art algorithms, including discrete bat algorithm (DBA), discrete cuckoo search (DCS), ant colony algorithm, and GA. The results of Rao algorithms are highly competitive compared to the rest of the algorithms

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/IJAEC.2021070104 (application/pdf)

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:igg:jaec00:v:12:y:2021:i:3:p:44-61

Access Statistics for this article

International Journal of Applied Evolutionary Computation (IJAEC) is currently edited by Sukhpal Singh Gill

More articles in International Journal of Applied Evolutionary Computation (IJAEC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().