Parallel cooperating A-Teams solving instances of the Euclidean planar travelling salesman problem

Authors:
Piotr Jędrzejowicz;Izabela Wierzbowska
Affiliations:
Department of Information Systems, Gdynia Maritime Academy, Gdynia, Poland;Department of Information Systems, Gdynia Maritime Academy, Gdynia, Poland
Venue:
KES-AMSTA'11 Proceedings of the 5th KES international conference on Agent and multi-agent systems: technologies and applications
Year:
2011

Citing 7
Cited 2

Punctuated equilibria: a parallel genetic algorithm

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Collaboration rules for autonomous software agents

Decision Support Systems - Special issue on restructuring the electric power business—a new paradigm for reducing regulation
Asynchronous Teams: Cooperation Schemes for Autonomous Agents

Journal of Heuristics
Distributed Genetic Algorithms

Proceedings of the 3rd International Conference on Genetic Algorithms
JADE-Based A-Team as a Tool for Implementing Population-Based Algorithms

ISDA '06 Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications - Volume 03
A-Team Middleware on a Cluster

KES-AMSTA '09 Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
JADE-Based a-team environment

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III

Parallel cooperating A-teams

ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part II
Study of the migration scheme influence on performance of a-teams solving the job shop scheduling problem

ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper proposes an architecture for solving difficult combinatorial optimization problems through cooperation of several A-Teams working in parallel. The idea extends JABAT environment through integrating the team of asynchronous agent paradigm with the island-based genetic algorithm concept. The proposed architecture has been tested on instances of the Euclidean planar travelling salesman problem. Computational experiment has confirmed that the proposed architecture is competitive in terms of the quality of solutions in comparison with using traditional, non-cooperating A-Teams.