Please use this identifier to cite or link to this item:
http://acervodigital.unesp.br/handle/11449/37098
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gallego, R. A. | - |
dc.contributor.author | Alves, A. B. | - |
dc.contributor.author | Monticelli, A. | - |
dc.date.accessioned | 2014-05-20T15:27:03Z | - |
dc.date.accessioned | 2016-10-25T18:01:45Z | - |
dc.date.available | 2014-05-20T15:27:03Z | - |
dc.date.available | 2016-10-25T18:01:45Z | - |
dc.date.issued | 1997-02-01 | - |
dc.identifier | http://dx.doi.org/10.1109/59.574938 | - |
dc.identifier.citation | IEEE Transactions on Power Systems. New York: IEEE-Inst Electrical Electronics Engineers Inc., v. 12, n. 1, p. 181-186, 1997. | - |
dc.identifier.issn | 0885-8950 | - |
dc.identifier.uri | http://hdl.handle.net/11449/37098 | - |
dc.identifier.uri | http://acervodigital.unesp.br/handle/11449/37098 | - |
dc.description.abstract | The simulated annealing optimization technique has been successfully applied to a number of electrical engineering problems, including transmission system expansion planning. The method is general in the sense that it does not assume any particular property of the problem being solved, such as linearity or convexity. Moreover, it has the ability to provide solutions arbitrarily close to an optimum (i.e. it is asymptotically convergent) as the cooling process slows down. The drawback of the approach is the computational burden: finding optimal solutions may be extremely expensive in some cases. This paper presents a Parallel Simulated Annealing, PSA, algorithm for solving the long term transmission network expansion planning problem. A strategy that does not affect the basic convergence properties of the Sequential Simulated Annealing algorithm have been implementeded and tested. The paper investigates the conditions under which the parallel algorithm is most efficient. The parallel implementations have been tested on three example networks: a small 6-bus network, and two complex real-life networks. Excellent results are reported in the test section of the paper: in addition to reductions in computing times, the Parallel Simulated Annealing algorithm proposed in the paper has shown significant improvements in solution quality for the largest of the test networks. | en |
dc.format.extent | 181-186 | - |
dc.language.iso | eng | - |
dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | - |
dc.source | Web of Science | - |
dc.subject | combinatorial optimization | pt |
dc.subject | simulated annealing | pt |
dc.subject | network static expansion planning | pt |
dc.subject | large scale optimization | pt |
dc.subject | parallel computing | pt |
dc.title | Parallel simulated annealing applied to long term transmission network expansion planning | en |
dc.type | outro | - |
dc.contributor.institution | Universidade Estadual Paulista (UNESP) | - |
dc.description.affiliation | UNESP,FEIS,SAO PAULO,BRAZIL | - |
dc.description.affiliationUnesp | UNESP,FEIS,SAO PAULO,BRAZIL | - |
dc.identifier.doi | 10.1109/59.574938 | - |
dc.identifier.wos | WOS:A1997WK94500063 | - |
dc.rights.accessRights | Acesso restrito | - |
dc.relation.ispartof | IEEE Transactions on Power Systems | - |
Appears in Collections: | Artigos, TCCs, Teses e Dissertações da Unesp |
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.