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

Improving orchestra using distributed parallel genetic algorithm

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

3 Author(s)
Yong-Xiang Peng ; Sch. of Comput. Sci. & Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China ; Si-Yu Zhan ; Xian-Liang Lu

Orchestra is proposed to change the traditional design process of routing protocols and it firstly introduces the concept of evolution into routing design. The disadvantage of traditional genetic algorithm, such as the bad searching quality and long computation time, makes the Orchestra has a bad performance and can not be applied to large scale network routing design. To improve Orchestra, a distributed parallel genetic algorithm is proposed. It adopts the improved genetic simulated annealing algorithm and uses distributed parallel technique to implement the distributed computing. With the distributed parallel genetic algorithm, the Orchestra will be more practical.

Published in:

Apperceiving Computing and Intelligence Analysis (ICACIA), 2010 International Conference on

Date of Conference:

17-19 Dec. 2010

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.