Please use this identifier to cite or link to this item:
https://ir.swu.ac.th/jspui/handle/123456789/14222
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sum-Im T. | |
dc.contributor.author | Ongsakul W. | |
dc.date.accessioned | 2021-04-05T03:33:39Z | - |
dc.date.available | 2021-04-05T03:33:39Z | - |
dc.date.issued | 2012 | |
dc.identifier.other | 2-s2.0-84874483133 | |
dc.identifier.uri | https://ir.swu.ac.th/jspui/handle/123456789/14222 | - |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84874483133&doi=10.1109%2fPECon.2012.6450196&partnerID=40&md5=8a579cbf582bca017c0f36951c176cc1 | |
dc.description.abstract | In this paper, a self-adaptive differential evolution algorithm (SaDEA) is applied directly to the DC power flow based model in order to efficiently solve transmission network expansion planning (TNEP) problem. The purpose of TNEP is to minimize the transmission investment cost associated with the technical operation and economical constraints. The TNEP problem is a large-scale, complex and nonlinear combinatorial problem of mixed integer nature where the number of candidate solutions to be evaluated increases exponentially with system size. In addition, the TNEP problem with system losses consideration is also investigated in this paper. The efficiency of the proposed method is initially demonstrated via the analysis of low and medium complexity transmission network test cases. A detailed comparative study among conventional genetic algorithm (CGA), tabu search (TS), artificial neural networks (ANNs), hybrid artificial intelligent techniques and the proposed method is presented. From the obtained experimental results, the proposed technique provides the accurate solution, the feature of robust computation, the simple implementation and the satisfactory computational time. © 2012 IEEE. | |
dc.subject | Artificial intelligent techniques | |
dc.subject | Candidate solution | |
dc.subject | Combinatorial problem | |
dc.subject | Comparative studies | |
dc.subject | Computational time | |
dc.subject | DC power flow | |
dc.subject | Medium complexity | |
dc.subject | Mixed integer | |
dc.subject | Robust computation | |
dc.subject | Self-adaptive differential evolution algorithms | |
dc.subject | System loss | |
dc.subject | System size | |
dc.subject | Technical operations | |
dc.subject | Transmission investments | |
dc.subject | Transmission line loss | |
dc.subject | Transmission network expansion planning | |
dc.subject | Electric power transmission | |
dc.subject | Investments | |
dc.subject | Neural networks | |
dc.subject | Tabu search | |
dc.subject | Electric power transmission networks | |
dc.title | A self-adaptive differential evolution algorithm for transmission network expansion planning with system losses consideration | |
dc.type | Conference Paper | |
dc.rights.holder | Scopus | |
dc.identifier.bibliograpycitation | PECon 2012 - 2012 IEEE International Conference on Power and Energy. Vol , No. (2012), p.151-156 | |
dc.identifier.doi | 10.1109/PECon.2012.6450196 | |
Appears in Collections: | Scopus 1983-2021 |
Files in This Item:
There are no files associated with this item.
Items in SWU repository are protected by copyright, with all rights reserved, unless otherwise indicated.