Please use this identifier to cite or link to this item:
https://hdl.handle.net/10216/98706Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | João Tomé Saraiva | |
| dc.creator | Mário Helder Gomes | |
| dc.date.accessioned | 2022-09-13T04:24:08Z | - |
| dc.date.available | 2022-09-13T04:24:08Z | - |
| dc.date.issued | 2002 | |
| dc.identifier.other | sigarra:65420 | |
| dc.identifier.uri | https://hdl.handle.net/10216/98706 | - |
| dc.description.abstract | In this paper we present four models of increasing complexity and completeness to evaluate the technical feasibility of a set of contracted powers according to commercial agreements established between generation entities and retailers, distribution companies or eligible consumers. In order to solve these optimization problems we used Simulated Annealing, SA, due to its capacity in escaping from local optima and its implementation easiness. The developed approach is illustrated using a Case Study based on the IEEE 24 bus system. | |
| dc.language.iso | eng | |
| dc.relation.ispartof | Proceedings of the VIII SEPOPE | |
| dc.rights | restrictedAccess | |
| dc.subject | Engenharia electrotécnica, electrónica e informática | |
| dc.subject | Electrical engineering, Electronic engineering, Information engineering | |
| dc.title | A simulated annealing approach to deal with congestion problems in transmission netwoks | |
| dc.type | Artigo em Livro de Atas de Conferência Internacional | |
| dc.contributor.uporto | Faculdade de Engenharia | |
| dc.subject.fos | Ciências da engenharia e tecnologias::Engenharia electrotécnica, electrónica e informática | |
| dc.subject.fos | Engineering and technology::Electrical engineering, Electronic engineering, Information engineering | |
| Appears in Collections: | FEUP - Artigo em Livro de Atas de Conferência Internacional | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 65420.pdf Restricted Access | VIIISEPOPE_2 | 51.39 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.