|Author:||So, Wai-sing James|
|Title:||Economic dispatch in power system by Genetic Algorithm and Dynamic Programming|
|Subject:||Electric power systems|
Hong Kong Polytechnic University -- Dissertations
Department of Electrical Engineering
|Pages:||64 leaves : ill. ; 30 cm|
|Abstract:||This paper develops an economic dispatch algorithm for the determination of the optimum dispatch solution. Genetic algorithm and Dynamic Programming are two approaches widely used in problem solving. Genetic Algorithms are general-purpose search algorithms based upon the principles of evolution observed in nature. While Dynamic Programming is a nature, powerful and effectiveness approach to reveal the basic solution with a more spreads of operations. In the algorithm, the load balance constraint, the operating limit constraints are accounted for. Adjustment and modification for the two approaches are discussed. In the development of the algorithm, transmission losses are incorporated in the algorithm through the use of the B-matrix loss formula. A test system is used to demonstrate the economic dispatch application of the Genetic Algorithm and Dynamic Programming. Furthermore, the comparison between the two approaches has been discussed.|
|Rights:||All rights reserved|
Files in This Item:
|b1599630x.pdf||For All Users (off-campus access for PolyU Staff & Students only)||2.49 MB||Adobe PDF||View/Open|
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item: