Please use this identifier to cite or link to this item:
http://dspace.dtu.ac.in:8080/jspui/handle/123456789/487
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | KAPOOR, RAJAT | - |
dc.date.accessioned | 2010-12-01T06:23:39Z | - |
dc.date.available | 2010-12-01T06:23:39Z | - |
dc.date.issued | 2009-11-27 | - |
dc.identifier.uri | http://dspace.dtu.ac.in:8080/jspui/handle/123456789/487 | - |
dc.description | ME THESIS | en_US |
dc.description.abstract | Ensuring a smooth electrical energy to the consumer has been identified as the main role of electric supply utility. The power utility needs to ensure that the electrical power is generated with minimum cost. Hence, for economic operation of the system, the total demand must be appropriately shared among the generating units with an objective to minimize the total generation cost for the system. Thus, Economic load dispatch is one of the important problems of power system operation and control. This work proposes evolutionary optimization technique namely Genetic Algorithm to solve Economic Load Dispatch in the electric power system, which are generic population, based probabilistic search optimization algorithms and can be applied to real world problem. In this report, Genetic Algorithm technique has been applied to solve Economic Load Dispatch problems for IEEE 5, 14 & 30 Bus system using Matlab. And after that Surrogate Worth Tradeoff Technique has been applied on the obtained resu... | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartofseries | TD607;114 | - |
dc.subject | GENETIC | en_US |
dc.subject | ALGORITHM | en_US |
dc.title | ECONOMIC LOAD DISPATCH USING GENETIC ALGORITHMS | en_US |
Appears in Collections: | M.E./M.Tech. Control and Instumentation Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
eco+Contents.doc | 56.5 kB | Microsoft Word | View/Open | |
eco+LOAD+DISPATCH.doc | 1.14 MB | Microsoft Word | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.