By Topic

Bi-Level Game Approaches for Coordination of Generation and Transmission Expansion Planning Within a Market Environment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jenabi, M. ; Amirkabir Univ. of Technol., Tehran, Iran ; Fatemi Ghomi, S.M.T. ; Smeers, Y.

The main purpose of this paper is to develop methodologies for simultaneous generation and transmission expansion planning problem of power networks while investigating interactions between these two important sections. In the proposed methodologies, a transmission operator (TO) operating under different incentives decides about investment in transmission network while anticipating the outcome of a purely competitive electricity market where several rival generation firms complete with each other to determine operating level of their generators, amount of their sales and amount of their investment in generation capacity. The proposed methodologies rely on bi-level programming models whose upper level model represent the problem of investment in transmission by TO and the lower level problems represent market outcomes obtained from clearing the market. These bi-level models are reduced to mixed-integer linear and nonlinear programming using the duality theory and Karush-Kuhn-Tucker (KKT) optimality conditions. The results of the proposed models are analyzed and compared using two illustrative examples.

Published in:

Power Systems, IEEE Transactions on  (Volume:28 ,  Issue: 3 )