By Topic

Global optimization of continuous problems using stochastic 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

2 Author(s)
Tu, Z. ; Sch. of Civil & Environ. Eng., Nanyang Technol. Univ., Singapore ; Lu, Y.

A stochastic genetic algorithm (StGA) technique is presented to deal with global optimization of continuous problems. In this algorithm, a novel coding scheme called "stochastic coding" is employed, so that the search space is explored in terms of stochastic regions towards the near-global solution. The effectiveness and efficiency of the algorithm are demonstrated through performing optimization on several test functions and the results are compared with the well established fast evolutionary programming (FEP) technique in terms of the global optimization accuracy and the computational efficiency. Comparisons show that StGA can improve the accuracy of the optimization results on these functions by up to several orders as compared with FEP, whereas computational effort required by StGA is on average about ten times less than FEP.

Published in:

Evolutionary Computation, 2003. CEC '03. The 2003 Congress on  (Volume:2 )

Date of Conference:

8-12 Dec. 2003