A NEW HYBRID APPROACH TO TRAVELLING SALESMAN PROBLEM BY REINFORCEMENT LEARNING AND IMPROVEMENT BY TWO-OPT ALGORITHM

Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/3503

Title:	A NEW HYBRID APPROACH TO TRAVELLING SALESMAN PROBLEM BY REINFORCEMENT LEARNING AND IMPROVEMENT BY TWO-OPT ALGORITHM
Authors:	Brindha T Saurabhee, Sakthivel
Keywords:	TSP Hybrid Approach Reinforcement Learning Two-Opt RL and Improvement by Two-Opt
Issue Date:	30-Mar-2023
Publisher:	The Seybold Report
Abstract:	Travelling Salesman Problem is a well-known problem in combinatorial optimization theory that is still being extensively studied up to date. Various approaches have been analyzed and developed to find an optimal solution to this problem. This paper focuses on a new hybrid approach to the Travelling Salesman Problem using Reinforcement Learning and its improvement by Two-Opt algorithm. The proposed algorithm has been applied to three real world problems, which are the three South Indian states namely, Tamil Nadu, Kerala and Andhra Pradesh which has 32, 16 and 27 cities respectively. The proposed algorithm is also compared to the classical algorithms, especially the Two- Opt algorithm to analyse and find the best of the two given here
URI:	http://localhost:8080/xmlui/handle/123456789/3503
ISSN:	1533 -9211
Appears in Collections:	National Journals

Files in This Item:

File	Description	Size	Format
A NEW HYBRID APPROACH TO TRAVELLING SALESMAN PROBLEM BY REINFORCEMENT LEARNING AND IMPROVEMENT BY TWO-OPT ALGORITHM.docx		469 kB	Microsoft Word XML	View/Open