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...
Main Authors: | Łukasz Strąk, Rafał Skinderowicz, Urszula Boryczka, Arkadiusz Nowakowski |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-07-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/21/8/738 |
Similar Items
-
The Pheromone-Based Harmony Search Algorithm for the Asymmetric Traveling Salesman Problem
by: Krzysztof Szwarc, et al.
Published: (2020-09-01) -
On Applying Methods for Graph-TSP to Metric TSP
by: Desjardins, Nicholas
Published: (2016) -
KL Divergence-Based Pheromone Fusion for Heterogeneous Multi-Colony Ant Optimization
by: Mingxia Liu, et al.
Published: (2019-01-01) -
TSP – Infrastructure for the Traveling Salesperson Problem
by: Michael Hahsler, et al.
Published: (2007-11-01) -
TSP - Infrastructure for the Traveling Salesperson
Problem
by: Hahsler, Michael, et al.
Published: (2007)