Close category search window
 

Genetic algorithm solution to the economic dispatch problem

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 $31
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)
Bakirtzis, A. ; Fac. of Electr. Eng., Aristotelian Univ. of Thessaloniki, Greece ; Petridis, V. ; Kazarlis, S.

Two genetic algorithm (GA) solutions to the economic dispatch problem are presented. An advantage of the GA solutions is that they do not impose any convexity restrictions on the generator cost functions. Another advantage is that GAs can be very effectively coded to work on parallel machines. Test results with systems of up to 72 generating units with nonconvex cost functions show that both GAs outperform the dynamic programming solution to the economic dispatch problem. Furthermore, the execution time of the second GA solution increases almost linearly with the number of generators

Published in:
Generation, Transmission and Distribution, IEE Proceedings-  (Volume:141 ,  Issue: 4 )

Date of Publication: Jul 1994

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.