| dc.contributor | Universidade Estadual de Campinas (UNICAMP) | |
| dc.contributor | Universidade Estadual Paulista (Unesp) | |
| dc.date.accessioned | 2014-05-20T15:26:33Z | |
| dc.date.available | 2014-05-20T15:26:33Z | |
| dc.date.created | 2014-05-20T15:26:33Z | |
| dc.date.issued | 1996-02-01 | |
| dc.identifier | IEEE Transactions on Power Systems. New York: IEEE-Inst Electrical Electronics Engineers Inc., v. 11, n. 1, p. 68-73, 1996. | |
| dc.identifier | 0885-8950 | |
| dc.identifier | http://hdl.handle.net/11449/36706 | |
| dc.identifier | 10.1109/59.485987 | |
| dc.identifier | WOS:A1996TX79400024 | |
| dc.description.abstract | An approach for solving reactive power planning problems is presented, which is based on binary search techniques and the use of a special heuristic to obtain a discrete solution. Two versions were developed, one to run on conventional (sequential) computers and the other to run on a distributed memory (hypercube) machine. This latter parallel processing version employs an asynchronous programming model. Once the set of candidate buses has been defined, the program gives the location and size of the reactive sources needed(if any) in keeping with operating and security constraints. | |
| dc.language | eng | |
| dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | |
| dc.relation | IEEE Transactions on Power Systems | |
| dc.relation | 5.255 | |
| dc.relation | 2,742 | |
| dc.rights | Acesso restrito | |
| dc.source | Web of Science | |
| dc.subject | reactive power planning | |
| dc.subject | parallel processing | |
| dc.subject | binary search | |
| dc.subject | heuristic methods | |
| dc.title | A heuristic method for reactive power planning | |
| dc.type | Artículos de revistas | |
