Solving Travelling Salesman Problem and Mapping to Solve Robot Motion Planning through Genetic Algorithm Principle

K  S  Suresh; V  Vaithiyanathan  and S  Venugopal

doi:10.17485/ijst/2015/v8i35/86809

Article

Solving Travelling Salesman Problem and Mapping to Solve Robot Motion Planning through Genetic Algorithm Principle

VIEWS 693
PDF 201

Abstract
Full-Text HTML
Full-Text PDF
How to Cite

Indian Journal of Science and Technology

DOI: 10.17485/ijst/2015/v8i35/86809

Year: 2015, Volume: 8, Issue: 35, Pages: 1-7

Original Article

Solving Travelling Salesman Problem and Mapping to Solve Robot Motion Planning through Genetic Algorithm Principle

K. S. Suresh^1* , V. Vaithiyanathan¹ and S. Venugopal²

¹School of Computing, SASTRA University, Thanjavur - 613401, Tamil Nadu, India; [email protected], [email protected]
² Indira Gandhi Centre for Atomic Research, Kalpakkam - 603102, Tamil Nadu, India; [email protected]

This work is licensed under a Creative Commons Attribution 4.0 International License.

Abstract

Travelling Salesman Problem (TSP) is a very old problem which has been solved in so many methodologies. The solution for the Robot Path Planning (RPP) can be derived using the methodologies used for the TSP.In this paper, Genetic Algorithm (GA) principle is employed to solve the TSP and is mapped to solve the RPP with the same principle. The both problems are defined to observe similarity between these problems and enumerated the conversion phases. In these two cases how the solutions are to be derived to implement the GA technique to accomplish the optimal path in both cases and tested for different number of cities, population space and generations. The minimum cost and mean cost of the solution space proves its giving the optimal result.
Keywords: ASCII, Encryption, Hackers, Random Number, Symmetric Key