By Topic

D3G2A : a new dynamic distributed double guided genetic algorithm for ΣCSPs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. Bouamanta ; Departement of Comput. Sci., Univ. of Tunis, Bouchoucha, Tunisia ; K. Ghedira

Inspired by the guided genetic algorithm (GGA) and by the dynamic distributed double guided genetic algorithm for Max_CSPs, D3G2A is a new multi-agent approach which addresses additive constraint satisfaction problems (ΣCSPs). This algorithm consists of agents dynamically created and cooperating in order to solve the problem. Each agent performs its own GA, guided by both the template concept and the min-conflict-heuristic. In one hand, genetic algorithms (GAs) efficiency provides good solution quality for additive CSPs and, in the other hand, multi-agent principles reduces GA temporal complexity. First, our approach is enhanced by a new parameter called guidance operator. The latter allows not only diversification but also an escaping from local optima. In the second step, the performed GAs no longer have the same cross-over and mutation probabilities. This is done on the basis of NEO-DARWINISM theory and the nature laws. In fact the new algorithm let the species agents able to count their GA parameters. In order to show D3G2A advantages, experimental comparison with GGA is provided.

Published in:

2005 IEEE Congress on Evolutionary Computation  (Volume:2 )

Date of Conference:

2-5 Sept. 2005