Dynamic sub-route-based self-adaptive beam search Q-learning algorithm for traveling salesman problem

In this paper, a dynamic sub-route-based self-adaptive beam search Q-learning (DSRABSQL) algorithm is proposed that provides a reinforcement learning (RL) framework combined with local search to solve the traveling salesman problem (TSP). DSRABSQL builds upon the Q-learning (QL) algorithm. Consideri...

Descripción completa

Detalles Bibliográficos
Autores principales: Zhang, Jin, Liu, Qing, Han, XiaoHang
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2023
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10030033/
https://www.ncbi.nlm.nih.gov/pubmed/36943840
http://dx.doi.org/10.1371/journal.pone.0283207

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10030033/
https://www.ncbi.nlm.nih.gov/pubmed/36943840
http://dx.doi.org/10.1371/journal.pone.0283207

Ejemplares similares