6533b827fe1ef96bd1287084
RESEARCH PRODUCT
A grid ant colony algorithm for the orienteering problem
José H. CanósJ.a. MocholiJavier Jaensubject
Theoretical computer scienceSpeedupComputer scienceDistributed computingAnt colony optimization algorithmsMathematicsofComputing_NUMERICALANALYSISGraph theoryOrienteeringGridcomputer.software_genreComputingMethodologies_ARTIFICIALINTELLIGENCEGrid computingDistributed algorithmSex pheromoneGraph (abstract data type)computerdescription
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
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2005-12-13 |