By Topic

Balancing the selection pressures and migration schemes in parallel genetic algorithms for planning multiple paths

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)
Sang-Keon Oh ; Dept. of Electr. Eng. & Comput. St., Korea Adv. Inst. of Sci. & Technol., Seoul, South Korea ; Cheol Taek Kim ; Ju-Jang Lee

Parallel genetic algorithms are particularly easy to implement and promise substantial gains in performance. Its basic idea is to keep several sub-populations that are processed by genetic algorithms. Furthermore, a migration mechanism produces a chromosome exchange between sub-population. In this paper, a new selection method based on nonlinear fitness assignment is presented. The use of the proposed ranking selection permits higher local exploitation search, where the diversity of population is maintained by a parallel sub-population structure. Experimental results show the relation between the local-global search balance and probabilities of reaching the desired solutions using test functions and nonstationary route-planning problems.

Published in:

Robotics and Automation, 2001. Proceedings 2001 ICRA. IEEE International Conference on  (Volume:4 )

Date of Conference:

2001