Research Repository

Solving a practical clustering problem via GTMAS

Töreyen, O and Salhi, A (2010) Solving a practical clustering problem via GTMAS. In: UNSPECIFIED, ? - ?.

Full text not available from this repository.

Abstract

The Game Theory-based Multi-Agent System (GTMAS) of Salhi and Töreyen, [10] and [12], implements a loosely coupled hybrid algorithm that may involve any number of algorithms suitable, a priori, for the solution of a given optimisation problem. The system allows the available algorithms to cooperate toward the solution of the problem in hand as well as compete for the computing facilities they require to run. This co-operative/competitive aspect is captured through the implementation of the Prisoners' Dilemma paradigm of game theory. In this paper, we apply GTMAS to the problem of clustering European Union (EU) economies, including Turkey, to find out whether the latter, based on a number of criteria, can fit in the EU and find out which countries, if any, it has strong similaries with. This clustering problem is first converted into a Travelling Salesman Problem (TSP) before being solved with GTMAS involving two players (agents) each implementing a standard compbinatorial optimisation algorithm. Computational results are included.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Additional Information: Published proceedings: 2010 UK Workshop on Computational Intelligence, UKCI 2010
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science and Health > Mathematical Sciences, Department of
Depositing User: Jim Jamieson
Date Deposited: 06 Aug 2013 10:48
Last Modified: 30 Jan 2019 16:17
URI: http://repository.essex.ac.uk/id/eprint/7254

Actions (login required)

View Item View Item