IDEAS home Printed from https://ideas.repec.org/a/igg/jaec00/v12y2021i3p44-61.html
   My bibliography  Save this article

Novel Discrete Rao Algorithms for Solving the Travelling Salesman Problem

Author

Listed:
  • Ankit Kumar Nikum

    (Sardar Vallabhbhai National Institute of Technology, India)

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

Suggested Citation

  • Ankit Kumar Nikum, 2021. "Novel Discrete Rao Algorithms for Solving the Travelling Salesman Problem," International Journal of Applied Evolutionary Computation (IJAEC), IGI Global, vol. 12(3), pages 44-61, July.
    • Handle: RePEc:igg:jaec00:v:12:y:2021:i:3:p:44-61
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAEC.2021070104
    Download Restriction: no
    ---><---

    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:igg:jaec00:v:12:y:2021:i:3:p:44-61. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.