|2/2011 - 16|
Social Welfare Improvement by TCSC using Real Code Based Genetic Algorithm in Double-Sided Auction MarketNABAVI, S. M. H. , KAZEMI, A. , MASOUM, M. A. S.
|Click to see author's profile on SCOPUS, IEEE Xplore, Web of Science|
|Download PDF (639 KB) | Citation | Downloads: 1,066 | Views: 2,934|
congestion management, real code based-GA, rescheduling, social welfare maximization, TCSC
power(22), management(8), congestion(7), systems(6), optimal(6), electric(6), research(5), flow(5), transmission(4), system(4)
No common words between the references section and the paper title.
About this article
Date of Publication: 2011-05-30
Volume 11, Issue 2, Year 2011, On page(s): 99 - 106
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2011.02016
Web of Science Accession Number: 000293840500016
SCOPUS ID: 79958828876
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.
|References|||||Cited By «-- Click to see who has cited this paper|
| D. Shirmohammadi, B. Wollenberg, A. Vojdani, P. Sandrin, M. Pereira, F. Rahimi, T. Schneider and B. Stott, "Transmission dispatch and congestion management in the emerging energy market structures", IEEE Trans. Power Syst., vol. 13, Issue 4, pp. 1466 - 1474, Nov. 1998. |
[CrossRef] [Web of Science Times Cited 72] [SCOPUS Times Cited 99]
 J. Hazra and A.K. Sinha, "Congestion management using multi objective particle swarm optimization", IEEE Trans. Power Syst., vol. 22, Issue 4, pp. 1726-1734, Nov. 2007.
[CrossRef] [Web of Science Times Cited 77] [SCOPUS Times Cited 133]
 S. M. H. Nabavi, S. Jadid, M. A. S. Masoum and A. Kazemi, "Congestion management in nodal pricing with genetic algorithm", International Conference on Power Electronics, Drives and Energy Syst., PEDES '06, pp. 1-5, 12-15 Dec. 2006.
 C. Z. Karatekin and C. Ucak, "Sensitivity analysis based on transmission line susceptances for congestion management", Electric Power Systems Research, vol. 78, Issue 9, pp. 1485-1493, Sept. 2008.
[CrossRef] [Web of Science Times Cited 13] [SCOPUS Times Cited 13]
 S. Gerbex, R. Cherkaoui and A. J. Germond, "Optimal location of multitype FACTS devices in a power system by means of genetic algorithms", IEEE Trans. Power Syst., vol. 16, pp. 537-544, 2001.
[CrossRef] [Web of Science Times Cited 269] [SCOPUS Times Cited 468]
 S. N. Singh and A. K. David, "Optimal location of FACTS devices for congestion management", Electric Power Systems Research, vol. 58, Issue 2, pp. 71-79, 21 June 2001.
[CrossRef] [Web of Science Times Cited 87] [SCOPUS Times Cited 149]
 S. Bruno and M. LaScala, "Unified power flow controllers for security constrained transmission management", IEEE Trans. Power Syst., pp. 418-426, 18 February 2004.
[CrossRef] [Web of Science Times Cited 23] [SCOPUS Times Cited 31]
 K. S. Verma, S. N. Singh and H. O. Gupta, "Location of unified power flow controller for congestion management", Electric Power Systems Research, vol. 58, Issue 2, pp. 89-96, 21 June 2001.
[CrossRef] [Web of Science Times Cited 75] [SCOPUS Times Cited 113]
 J. Zhang and A. Yokoyama, "Optimal power flow control for congestion management by interline power flow controller (IPFC)", International Conference on Power System Technology, PowerCon, pp.1-6, Oct. 2006.
 G. B. Shrestha and W. Feng, "Effects of series compensation on spot price power markets", Electric Power Systems Research, vol. 27, pp. 428-436, 2005.
[CrossRef] [Web of Science Times Cited 25] [SCOPUS Times Cited 39]
 R. S. Fang and A. K. David, "Optimal dispatch under transmission contracts," IEEE Trans. Power Syst., vol. 14, no. 2, pp. 732-737, May 1999.
[CrossRef] [Web of Science Times Cited 73] [SCOPUS Times Cited 117]
 X. P. Wang and L. P. Cao, "Genetic algorithms-theory, application and software realization", Xi'an Jiaotong University, Xi'an, China, 1998.
 S. Sayah and Kh. Zehar, "Modified differential evolution algorithm for optimal power flow with non-smooth cost functions", Electric Power Systems Research, vol. 49, pp. 3036-3042, 2008.
 A. Ulinuha, M. A. S. Masoum and S. M. Islam, "Optimal Scheduling of LTC and Shunt Capacitors in Large Distorted Distribution Systems using Genetic Algorithms", IEEE Trans. on Power Delivery, Vol.23, No.1, pp.434-441, Jan 2008.
[CrossRef] [Web of Science Times Cited 19] [SCOPUS Times Cited 26]
 M, Shiddehpour, H. Yamin and Z. Y. LI, "Market Operations in Electric Power System", New York: Wiley, pp. 477-478, 2002
 R. D. Zimmerman, C. E. Murillo-Sanchez, and D. Gan, MATPOWER: A Matlab Power System Simulation Package 2006.
Web of Science® Citations for all references: 733 TCR
SCOPUS® Citations for all references: 1,188 TCR
Web of Science® Average Citations per reference: 43 ACR
SCOPUS® Average Citations per reference: 70 ACR
TCR = Total Citations for References / ACR = Average Citations per Reference
We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more
Citations for references updated on 2016-12-04 02:21 in 56 seconds.
Note1: Web of Science® is a registered trademark of Thomson Reuters.
Note2: SCOPUS® is a registered trademark of Elsevier B.V.
Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.