Enhancing the Traveling Salesman Problem Solutions with Reinforcement Learning: A Variant Exploration-Exploitation Approach Beyond ε-Greedy

El Jaghaoui, Sanaa; Elmiad, Aissa Kerkour; Lmah, Abdelhamid Benaini

doi:10.1109/sita60746.2023.10373716

2023 14th International Conference on Intelligent Systems: Theories and Applications (SITA) 2023

DOI: 10.1109/sita60746.2023.10373716

|View full text |Cite

Enhancing the Traveling Salesman Problem Solutions with Reinforcement Learning: A Variant Exploration-Exploitation Approach Beyond ε-Greedy

Sanaa El Jaghaoui,

Aissa Kerkour Elmiad,

Abdelhamid Benaini Lmah

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Combining reinforcement learning algorithm and genetic algorithm to solve the traveling salesman problem

Ruan,

Cai,

Wang

2024

The Journal of Engineering

View full text Add to dashboard Cite

With the growing recognition of the unique advantages of reinforcement learning and genetic algorithms in addressing combinatorial optimization problems, this study aims to integrate these two methods to collectively tackle the classic combinatorial optimization challenge of the travelling salesman problem (TSP). The TSP stands as a quintessential combinatorial optimization challenge, tasked with determining the shortest path among designated cities. This paper introduces an innovative approach by amalgamating reinforcement learning's path selection prowess with genetic algorithms' global search strategy, aiming to uncover superior solutions in TSP. Specifically, the experiment employs a dual Q‐learning algorithm within reinforcement learning to identify multiple optimal paths, serving as progenitors for the genetic algorithm to further enhance performance. The paper meticulously outlines the problem modelling process, elucidating TSP instance definitions, descriptions, and precise objective function definitions. Experimental findings underscore the substantial enhancements achievable in TSP optimization through this comprehensive approach, offering a fresh perspective and methodology for tackling combinatorial optimization challenges.

show abstract

Combining reinforcement learning algorithm and genetic algorithm to solve the traveling salesman problem

Ruan,

Cai,

Wang

2024

The Journal of Engineering

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Enhancing the Traveling Salesman Problem Solutions with Reinforcement Learning: A Variant Exploration-Exploitation Approach Beyond ε-Greedy

Cited by 1 publication

References 17 publications

Combining reinforcement learning algorithm and genetic algorithm to solve the traveling salesman problem

Combining reinforcement learning algorithm and genetic algorithm to solve the traveling salesman problem

Contact Info

Product

Resources

About