An ant-based technique for the dynamic generalized traveling salesman problem

Authors:
Camelia M. Pintea;Petrica C. Pop;D. Dumitrescu
Affiliations:
Department of Computer Science, Faculty of Mathematics and Computer Science, Babes-Bolyai University, Cluj-Napoca, Romania;Department of Mathematics and Computer Science, Faculty of Sciences, North University of Baia Mare, Baia-Mare, Romania;Department Computer Science, Faculty of Mathematics and Computer Science, Babes-Bolyai University, Cluj-Napoca, Romania
Venue:
ISTASC'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Systems Theory and Scientific Computation - Volume 7
Year:
2007

Citing 2
Cited 3

Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Ant Focused Crawling Algorithm

ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
New formulations for the generalized traveling salesman problem

ASM'12 Proceedings of the 6th international conference on Applied Mathematics, Simulation, Modelling
Parallel ACO with a Ring Neighborhood for Dynamic TSP

Journal of Information Technology Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an effective metaheuristic algorithm based on ant colony system in the case of the dynamic generalized traveling salesman problem. The same technique can be used for other dynamic large scale NP- hard problems encountered in telecommunications, transportation, network design, etc. In the dynamic versions that we consider, if we look at the distance between nodes as travel times they are no longer fixed. Computational results are reported in the case of dynamic generalized traveling salesman problem for some real data sets.