A Grid Ant Colony Algorithm for the Orienteering Problem

descriptionPublicationkeyboard_double_arrow_right Article , Conference object 13 Dec 2005Publisher:IEEEJournal:2005 IEEE Congress on Evolutionary Computation, volume 1, pages 942-949

Authors: José A. Mocholí; Javier Jaén Martínez; José H. Canós;

doi: 10.1109/cec.2005.1554784

A Grid Ant Colony Algorithm for the Orienteering Problem

- Summary
- Metrics

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

Related Organizations

University of Valencia
Spain
Universitat Politècnica de València
Spain

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	8
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average