By Topic

Parallel Gray code optimization for high dimensional 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)
Wang, H. ; Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN, USA ; Ersoy, O.K.

A parallel Gray code optimization (PGCO) algorithm is proposed in this paper. The Gray code optimization (GCO) shares some similarities with genetic algorithm (GA) and evolutionary programming (EP). It uses a binary representation, but the only operator is the mutation of a number of bits. The evolving strategy utilizes the adjacency property of the Gray code. By controlling how many bits to flip, it keeps a balance between global search and local search. Another property of the GCO is that the population size is not fixed. It grows linearly with the dimension of the problem, which help to alleviate the curse of the dimensionality. In order to avoid the slow convergence of high dimensional problems, a parallel Gray code algorithm using message passing interface (MPI) was implemented. Its scalability in a Beowulf Windows Cluster was investigated.

Published in:

Computational Intelligence and Multimedia Applications, 2005. Sixth International Conference on

Date of Conference:

16-18 Aug. 2005