By Topic

Multiple bit encoding-based search algorithms

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)
Xinchao Zhao ; Sch. of Sci., Beijing Univ. of Posts & Telecommun., China ; Hongliang Long

For a given real-world problem, we do not know a priori which representation suits this problem. Schnier and Yao showed the benefit of using the multiple real-coded evolutionary algorithm. This paper discusses the multiple bit encoding-based (standard binary and reflected Gray code) search algorithms. The population-based genetic algorithm and single individual-based random bit climber algorithm are used to show the efficacy of the multiple encoding. Each algorithm has three versions which are based on the standard binary encoding, standard reflected Gray code and multiple encoding scheme respectively. The experiments on two search algorithms show the robust and better performance than the single encoding scheme and also show empirically how multiple representations can benefit search as much as a good search operator could.

Published in:

Evolutionary Computation, 2005. The 2005 IEEE Congress on  (Volume:3 )

Date of Conference:

2-5 Sept. 2005