Sciweavers

Share
IMCSIT
2010

Effectiveness of Solving Traveling Salesman Problem Using Ant Colony Optimization on Distributed Multi-Agent Middleware

3 years 1 months ago
Effectiveness of Solving Traveling Salesman Problem Using Ant Colony Optimization on Distributed Multi-Agent Middleware
Recently we have setup the goal of investigating new truly distributed forms of Ant Colony Optimization. We proposed a new distributed approach for Ant Colony Optimization (ACO) algorithms called Ant Colony Optimization on a Distributed Architecture (ACODA). ACODA was designed to allow efficient implementation of ACO algorithms on state-of-the art distributed multi-agent middleware. In this paper we present experimental results that support the feasibility of ACODA by considering a distributed version of the Ant Colony System (ACS). In particular we show the effectiveness of this approach for solving Traveling Salesperson Problem by comparing experimental results of ACODA versions of distributed ACS with distributed random searches on a high-speed cluster network.
Sorin Ilie, Costin Badica
Added 05 Mar 2011
Updated 05 Mar 2011
Type Journal
Year 2010
Where IMCSIT
Authors Sorin Ilie, Costin Badica
Comments (0)
books