Security dispatch using the Hopfield neural network
dc.authorid | 0000-0002-8291-1419 | |
dc.contributor.author | Yalcinoz, T | |
dc.contributor.author | Short, MJ | |
dc.contributor.author | Cory, BJ | |
dc.date.accessioned | 2019-08-01T13:38:39Z | |
dc.date.available | 2019-08-01T13:38:39Z | |
dc.date.issued | 1999 | |
dc.department | Niğde ÖHÜ | |
dc.description.abstract | A restructuring of the improved Hopfield neural network (NN) approach, which has previously been proposed for solving economic dispatch, is proposed for solving real time economic dispatch problem with security constraints. A new mapping process is formulated and a computational method for obtaining the weights and biases is described using a slack variable technique for handling inequality constraints. Side constraints are handled by a modified activation function for which a symmetric ramp function is chosen for the input-output function and applied to each element of the variable set. The Hopfield NN approach is tested on the IEEE 30-bus system for different demands. | |
dc.identifier.doi | 10.1049/ip-gtd:19990506 | |
dc.identifier.endpage | 470 | |
dc.identifier.issn | 1350-2360 | |
dc.identifier.issue | 5 | |
dc.identifier.scopus | 2-s2.0-0000002834 | |
dc.identifier.scopusquality | N/A | |
dc.identifier.startpage | 465 | |
dc.identifier.uri | https://dx.doi.org/10.1049/ip-gtd:19990506 | |
dc.identifier.uri | https://hdl.handle.net/11480/5796 | |
dc.identifier.volume | 146 | |
dc.identifier.wos | WOS:000088478500010 | |
dc.identifier.wosquality | Q3 | |
dc.indekslendigikaynak | Web of Science | |
dc.indekslendigikaynak | Scopus | |
dc.institutionauthor | [0-Belirlenecek] | |
dc.language.iso | en | |
dc.publisher | IEE-INST ELEC ENG | |
dc.relation.ispartof | IEE PROCEEDINGS-GENERATION TRANSMISSION AND DISTRIBUTION | |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | |
dc.rights | info:eu-repo/semantics/closedAccess | |
dc.title | Security dispatch using the Hopfield neural network | |
dc.type | Article |