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
-
An Optimized Discrete Dragonfly Algorithm Tackling the Low Exploitation Problem for Solving TSP
by: Bibi Aamirah Shafaa Emambocus, et al.
Published: (2022-10-01) -
The Pheromone-Based Harmony Search Algorithm for the Asymmetric Traveling Salesman Problem
by: Krzysztof Szwarc, et al.
Published: (2020-09-01) -
Discrete Salp Swarm Algorithm for symmetric traveling salesman problem
by: Peng Chen, et al.
Published: (2023-03-01) -
The traveling salesman : computational solutions for TSP applications /
by: 304805 Reinelt, Gerhard
Published: (1994) -
A Novel Discrete Group Teaching Optimization Algorithm for TSP Path Planning with Unmanned Surface Vehicles
by: Shaolong Yang, et al.
Published: (2022-09-01)