Close category search window
 

A Improved Genetic Algorithm for Random-Fuzzy Programming Model in Electricity Market

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

4 Author(s)
Quanle Zhu ; Dept. of Electr. Eng., North China Electr. Power Univ., Baoding, China ; Xinshun Ma ; Jinsha Yuan ; Qiaolin Ding

In the sealed-auction-based electricity markets, to fast and accurately solve the random-fuzzy programming problem, which is for building optimal bidding strategies of generation companies and can simultaneously deal with both random variable and fuzzy variable, a improved genetic algorithm (IGA) is proposed based on a genetic algorithm with hybrid Laplace crossover and power mutation (HLCPM). The IGA can fast find the optimal solution in some area and guarantee the enough search area. The performance of IGA is verified by 10 benchmark global optimization test problems and the random-fuzzy programming problem. A very good performance of IGA is shown by the results.

Published in:
Power and Energy Engineering Conference (APPEEC), 2011 Asia-Pacific

Date of Conference: 25-28 March 2011

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.