Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/674
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mishra, Sanjib | - |
dc.contributor.author | Patra, S K | - |
dc.date.accessioned | 2008-04-25T08:08:11Z | - |
dc.date.available | 2008-04-25T08:08:11Z | - |
dc.date.issued | 2008 | - |
dc.identifier.citation | Proceedings of the National Conference on "Power Conversion, systems, drives, control technology conferences - 2008 Dindigul, Tamilnadu | en |
dc.identifier.uri | http://hdl.handle.net/2080/674 | - |
dc.description | Copyright for the paper belongs to the proceedings publisher | en |
dc.description.abstract | A computationally efficient artificial neural network for the purpose of short term load forecasting is proposed. The major drawback of feed forward neural networks such as a multilayer perceptron (MLP) or dynamic neural network such as Hopfield, Elman, MFLNN trained with back propagation algorithm is that it requires a large amount of computation for learning. We propose a three-layer multi layer neural network trained with genetic algorithm in which the need for computationally intensive back propagation is eliminated. The results of which are better than a MLP trained by back propagation algorithm, which require more number of hidden neurons. The whole project is carried out for Orissa Power Transmission Corporation Limited, taking into the load data of Orissa. | en |
dc.format.extent | 273185 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.subject | Short term load forecasting | en |
dc.subject | Genetic Algorithm | en |
dc.subject | Back Propagation | en |
dc.title | Short Term Load Forecasting using Neural Network trained with Genetic Algorithm | en |
dc.type | Article | en |
Appears in Collections: | Conference Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
smishra-conf.pdf | 266.78 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.