A Self-Adaptive Discrete PSO Algorithm with Heterogeneous Parameter Values for Dynamic TSP

This paper presents a discrete particle swarm optimization (DPSO) algorithm with heterogeneous (non-uniform) parameter values for solving the dynamic traveling salesman problem (DTSP). The DTSP can be modeled as a sequence of static sub-problems, each of which is an instance of the TSP. In the propo...

Descripción completa

Detalles Bibliográficos
Autores principales: Strąk, Łukasz, Skinderowicz, Rafał, Boryczka, Urszula, Nowakowski, Arkadiusz
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2019
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7515267/
https://www.ncbi.nlm.nih.gov/pubmed/33267452
http://dx.doi.org/10.3390/e21080738

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7515267/
https://www.ncbi.nlm.nih.gov/pubmed/33267452
http://dx.doi.org/10.3390/e21080738

Ejemplares similares