Cargando…
Hybrid pointer networks for traveling salesman problems optimization
In this work, we proposed a hybrid pointer network (HPN), an end-to-end deep reinforcement learning architecture is provided to tackle the travelling salesman problem (TSP). HPN builds upon graph pointer networks, an extension of pointer networks with an additional graph embedding layer. HPN combine...
Autores principales: | Stohy, Ahmed, Abdelhakam, Heba-Tullah, Ali, Sayed, Elhenawy, Mohammed, Hassan, Abdallah A., Masoud, Mahmoud, Glaser, Sebastien, Rakotonirainy, Andry |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8670669/ https://www.ncbi.nlm.nih.gov/pubmed/34905571 http://dx.doi.org/10.1371/journal.pone.0260995 |
Ejemplares similares
-
Solving pickup and drop-off problem using hybrid pointer networks with deep reinforcement learning
por: Alharbi, Majed G., et al.
Publicado: (2022) -
Solving the clustered traveling salesman problem via traveling salesman problem methods
por: Lu, Yongliang, et al.
Publicado: (2022) -
The traveling salesman problem and its variations
por: Gutin, Gregory, et al.
Publicado: (2007) -
The multi-stripe travelling salesman problem
por: Çela, Eranda, et al.
Publicado: (2017) -
Genetic codes optimized as a traveling salesman problem
por: Attie, Oliver, et al.
Publicado: (2019)