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

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ó completa

Dades bibliogràfiques
Autors principals: Łukasz Strąk, Rafał Skinderowicz, Urszula Boryczka, Arkadiusz Nowakowski
Format: Article
Idioma:English
Publicat: MDPI AG 2019-07-01
Col·lecció:Entropy
Matèries:
dynamic traveling salesman problem
pheromone
discrete particle swarm optimization
heterogeneous
homogeneous
Accés en línia:https://www.mdpi.com/1099-4300/21/8/738

Internet

https://www.mdpi.com/1099-4300/21/8/738

Ítems similars