Cart (Loading....) | Create Account
Close category search window
 

Toward a parallel genetic algorithm approach based on collective intelligence for combinatorial optimization problems

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
$31 $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)
Hidrobo, F. ; Fac. de Ciencias, Los Andes Univ., Merida, Venezuela ; Aguilar, J.

This paper addresses collective intelligence routes used in artificial life. Preliminary results are used to optimize the performance of genetic algorithms. Due to interested in the behaviour oriented artificial intelligence, specific attention is placed on the biological phenomena that reveals something about collective intelligence. Then, we propose a parallel reinforced search algorithm for the GA that use a collective memory of the better structural changes in the individuals through the generations, in order to use that information like trace of search

Published in:

Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE International Conference on

Date of Conference:

4-9 May 1998

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.