| Full text | |
| Author(s): |
Total Authors: 3
|
| Affiliation: | [1] UNESP Univ Estadual Paulista, Fac Engn Ilha Solteira, Dept Engn Eletr, Ilha Solteira, SP - Brazil
Total Affiliations: 1
|
| Document type: | Journal article |
| Source: | IEEE Transactions on Power Systems; v. 28, n. 3, p. 2164-2173, AUG 2013. |
| Web of Science Citations: | 24 |
| Abstract | |
This paper proposes strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem (TEP). The concept of the binary numeral system (BNS) is used to reduce the number of binary and continuous variables related to the candidate transmission lines and network constraints that are connected with them. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) and additional constraints, obtained from power flow equilibrium in an electric power system are employed for more reduction in search space. The multistage TEP problem is modeled like a mixed binary linear programming problem and solved using a commercial solver with a low computational time. The results of one test system and two real systems are presented in order to show the efficiency of the proposed solution technique. (AU) | |
| FAPESP's process: | 09/14816-7 - Analysis of new mathematical models for the transmission network expansion problem. |
| Grantee: | Mohsen Rahmani |
| Support Opportunities: | Scholarships in Brazil - Doctorate |