A STUDY OF TRAVELLING SALESMAN PROBLEM USING REINFORCEMENT LEARNING OVER GENETIC ALGORITHM
Main Article Content
Abstract
This paper represents the applications of Genetic Algorithm (GA) to solve a Travelling Salesman
problem (TSP). TSP is a simple to describe and mathematically well characterized problem but it is quite difficult to solve. This is a NP-hard type problem i.e. this problem is hard as the hardest problem in NPcomplete space. We present the Crossover and Mutation operators, sorting of the solutions to calculate the bestoptimal solutions. Previously, a numerical illustration was used to signify the model with the techniques. This paper employs Reinforcement Learning to solve the Traveling Salesman problem in the mean of Genetic Algorithm. The technique proposes a model (actions, states, reinforcements).
Downloads
Metrics
Article Details
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
