Social Welfare Improvement by TCSC using Real Code Based Genetic Algorithm in Double-Sided Auction Market
This paper presents a genetic algorithm (GA) to maximize total system social welfare and alleviate congestion by best placement and sizing of TCSC device, in a double-sided auction market. To introduce more accurate modeling, the valve loading effects is incorporated to the conventional quadratic sm...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
Faculty of Electrical Engineering and Computer Science, University of Suceava
2011
|
| Online Access: | http://hdl.handle.net/20.500.11937/37877 |
| _version_ | 1848755167941361664 |
|---|---|
| author | Nabavi, S. Kazemi, A. Masoum, Mohammad Sherkat |
| author_facet | Nabavi, S. Kazemi, A. Masoum, Mohammad Sherkat |
| author_sort | Nabavi, S. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | This paper presents a genetic algorithm (GA) to maximize total system social welfare and alleviate congestion by best placement and sizing of TCSC device, in a double-sided auction market. To introduce more accurate modeling, the valve loading effects is incorporated to the conventional quadratic smooth generator cost curves. By adding the valve point effect, the model presents nondifferentiable and nonconvex regions that challenge most gradient-based optimization algorithms. In addition, quadratic consumer benefit functions integrated in the objective function to guarantee that locational marginal prices charged at the demand buses is less than or equal to DisCos benefit, earned by selling that power to retail customers. The proposed approach makes use of the genetic algorithm to optimal schedule GenCos, DisCos and TCSC location and size, while the Newton-Raphson algorithm minimizes the mismatch of the power flow equations. Simulation results on the modified IEEE 14-bus and 30-bus test systems (with/without line flow constraints, before and after the compensation) are used to examine the impact of TCSC on the total system social welfare improvement. Several cases are considered to test and validate the consistency of detecting best solutions. Simulation results are compared to solutions obtained by sequential quadratic programming (SQP) approaches. |
| first_indexed | 2025-11-14T08:52:00Z |
| format | Journal Article |
| id | curtin-20.500.11937-37877 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T08:52:00Z |
| publishDate | 2011 |
| publisher | Faculty of Electrical Engineering and Computer Science, University of Suceava |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-378772017-09-13T14:27:25Z Social Welfare Improvement by TCSC using Real Code Based Genetic Algorithm in Double-Sided Auction Market Nabavi, S. Kazemi, A. Masoum, Mohammad Sherkat This paper presents a genetic algorithm (GA) to maximize total system social welfare and alleviate congestion by best placement and sizing of TCSC device, in a double-sided auction market. To introduce more accurate modeling, the valve loading effects is incorporated to the conventional quadratic smooth generator cost curves. By adding the valve point effect, the model presents nondifferentiable and nonconvex regions that challenge most gradient-based optimization algorithms. In addition, quadratic consumer benefit functions integrated in the objective function to guarantee that locational marginal prices charged at the demand buses is less than or equal to DisCos benefit, earned by selling that power to retail customers. The proposed approach makes use of the genetic algorithm to optimal schedule GenCos, DisCos and TCSC location and size, while the Newton-Raphson algorithm minimizes the mismatch of the power flow equations. Simulation results on the modified IEEE 14-bus and 30-bus test systems (with/without line flow constraints, before and after the compensation) are used to examine the impact of TCSC on the total system social welfare improvement. Several cases are considered to test and validate the consistency of detecting best solutions. Simulation results are compared to solutions obtained by sequential quadratic programming (SQP) approaches. 2011 Journal Article http://hdl.handle.net/20.500.11937/37877 10.4316/aece.2011.02016 Faculty of Electrical Engineering and Computer Science, University of Suceava unknown |
| spellingShingle | Nabavi, S. Kazemi, A. Masoum, Mohammad Sherkat Social Welfare Improvement by TCSC using Real Code Based Genetic Algorithm in Double-Sided Auction Market |
| title | Social Welfare Improvement by TCSC using Real Code Based Genetic Algorithm in Double-Sided Auction Market |
| title_full | Social Welfare Improvement by TCSC using Real Code Based Genetic Algorithm in Double-Sided Auction Market |
| title_fullStr | Social Welfare Improvement by TCSC using Real Code Based Genetic Algorithm in Double-Sided Auction Market |
| title_full_unstemmed | Social Welfare Improvement by TCSC using Real Code Based Genetic Algorithm in Double-Sided Auction Market |
| title_short | Social Welfare Improvement by TCSC using Real Code Based Genetic Algorithm in Double-Sided Auction Market |
| title_sort | social welfare improvement by tcsc using real code based genetic algorithm in double-sided auction market |
| url | http://hdl.handle.net/20.500.11937/37877 |