Hybrid Algorithm Based on Ant Colony Optimization and Simulated Annealing Applied to the Dynamic Traveling Salesman Problem

The dynamic traveling salesman problem (DTSP) falls under the category of combinatorial dynamic optimization problems. The DTSP is composed of a primary TSP sub-problem and a series of TSP iterations; each iteration is created by changing the previous iteration. In this article, a novel hybrid metah...

Descripción completa

Detalles Bibliográficos
Autores principales: Stodola, Petr, Michenka, Karel, Nohel, Jan, Rybanský, Marian
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7517487/
https://www.ncbi.nlm.nih.gov/pubmed/33286654
http://dx.doi.org/10.3390/e22080884

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7517487/
https://www.ncbi.nlm.nih.gov/pubmed/33286654
http://dx.doi.org/10.3390/e22080884

Ejemplares similares