Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
A Study of Global Optimization Using Particle Swarms
Journal of Global Optimization
Preserving diversity in particle swarm optimisation
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
Adaptive particle swarm optimization: detection and response to dynamic systems
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Particle swarm optimization-based algorithms for TSP and generalized TSP
Information Processing Letters
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
A parallel multi-start search algorithm for dynamic traveling salesman problem
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
A new approach to solving dynamic traveling salesman problems
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
| Hi-index | 0.00 |
This paper introduces a new Discrete Particle Swarm Optimization algorithm for solving Dynamic Traveling Salesman Problem (DTSP). An experimental environment is stochastic and dynamic, based on Benchmark Generator was prepared for testing DTSP solvers. Changeability requires quick adaptation ability from the algorithm. The introduced technique presents a set of advantages that fulfill this requirement. The proposed solution is based on the virtual pheromone first applied in Ant Colony Optimization. The pheromone serves as a communication topology and information about the landscape of global discrete space. Experimental results demonstrate the effectiveness and efficiency of the algorithm.