COSATS, X-COSATS: two multi-agent systems cooperating simulated annealing, tabu search and x-over operator for the k-graph partitioning problem

Authors:
Moez Hammami;Khaled Ghédira
Affiliations:
Unité de recherche stratégies d'optimisation de l'information et de la connaissance (SOIE), Le Bardo, Tunisie;Unité de recherche stratégies d'optimisation de l'information et de la connaissance (SOIE), Le Bardo, Tunisie
Venue:
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part IV
Year:
2005

Citing 3
Cited 1

A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

SIAM Journal on Scientific Computing
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference
Solving the mesh-partitioning problem with an ant-colony algorithm

Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications

Metaheuristic Agent Teams for Job Shop Scheduling Problems

HoloMAS '07 Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose two multi-agent systems gathering several metaheuristics for the K-Graph Partitioning Problem(K-GPP). In the first model COSATS, two metaheuristic agents, namely Tabu Search and Simulated Annealing run simultaneously to solve the K-GPP. These agents are mutually guided during their search process by means of a new mechanism of information exchange based on statistical analysis of search space. In the second model X-COSATS, a crossover agent is added to the model in order to make a crossover between the local optima found by simulated annealing and tabu agents. COSATS and X-COSATS are tested on several large graph benchmarks. The experiments demonstrated that our models achieve partitions with significantly higher quality than those generated by simulated annealing and tabu search operating separately.