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

Comparison between hybrid genetic-SPSA algorithm and GA for solving random fuzzy dependent-chance programming

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)
Yu-Fu Ning ; Inst. of Syst. Eng., Tianjin Univ., China ; Wan-Sheng Tang ; Lei Su

This paper proposes a hybrid genetic-SPSA algorithm based on random fuzzy simulation for solving dependent-chance programming in random fuzzy environments. In the algorithm, random fuzzy simulation is designed to estimate the mean chance of a random fuzzy event, genetic algorithm (GA) is employed to search for the optimal solution in the entire space, and simultaneous perturbation stochastic approximation (SPSA) is used to improve the chromosomes obtained by crossover and mutation operations at each generation in GA. In order to illustrate the effectiveness of the presented algorithm, the comparison between the algorithm and GA is made, and an example is provided.

Published in:

Machine Learning and Cybernetics, 2005. Proceedings of 2005 International Conference on  (Volume:5 )

Date of Conference:

18-21 Aug. 2005

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.