Distributed agent-based ant colony optimization for solving traveling salesman problem on a partitioned map

  • Authors:
  • Sorin Ilie;Amelia Bădică;Costin Bădică

  • Affiliations:
  • University of Craiova, Craiova, Romania;University of Craiova, Craiova, Romania;University of Craiova, Craiova, Romania

  • Venue:
  • Proceedings of the International Conference on Web Intelligence, Mining and Semantics
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we discuss the experimental evaluation of an improved configuration of our recent framework ACODA (Ant Colony Optimization on a Distributed Architecture) for solving the Traveling Salesman Problem (TSP). ACODA is a novel multi-agent system architecture for distributed Ant Colony Optimization in a decentralized environment. This new configuration improves the execution time by allowing each software agent of ACODA to manage a part of the TSP map rather than a single map node. Experimental results support this claim of improved efficiency while showing that the scalability of the system is preserved.