DocumentCode :
2727819
Title :
A grid ant colony algorithm for the orienteering problem
Author :
Mocholí, Jose A. ; Jaén, Javier ; Canós, Jose H.
Author_Institution :
Polytech. Univ. of Valencia
Volume :
1
fYear :
2005
fDate :
5-5 Sept. 2005
Firstpage :
942
Abstract :
In this paper we propose a distributed ant colony algorithm to solve large scale orienteering problem instances. Our approach is based on a multi-colony strategy where each colony works in an independent portion (cluster) in the original graph. This results in no need for communicating pheromones information among colonies and in increasing speedup. We have implemented our algorithm as a .NET Web services infrastructure following a grid computing philosophy and we provide some promising experimental results to show the feasibility and effectiveness of our approach
Keywords :
artificial life; distributed algorithms; graph theory; grid computing; optimisation; .NET Web services; distributed ant colony algorithm; graph theory; grid computing; multicolony strategy; orienteering problem; Ant colony optimization; Clustering algorithms; Grid computing; Handheld computers; Insects; Large-scale systems; Machine learning algorithms; Routing; Stochastic processes; Web services;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 2005. The 2005 IEEE Congress on
Conference_Location :
Edinburgh, Scotland
Print_ISBN :
0-7803-9363-5
Type :
conf
DOI :
10.1109/CEC.2005.1554784
Filename :
1554784
Link To Document :
بازگشت