Two-stage algorithm for efficient transmission expansion planning with renewable energy resources

In this study, a ‘two-stage’ deterministic algorithm an for efficient transmission expansion planning with renewable energy (RE) resources under the assumption that existing conventional generators provide the reserve to mitigate RE generation forecast error has been proposed. Zero-RE penetration ha...

Full description

Saved in:
Bibliographic Details
Published in:IET renewable power generation 2017-02, Vol.11 (3), p.320-329
Main Authors: Majumder, Subir, Shereef, R. M, Khaparde, Shrikrishna A
Format: Article
Language:English
Subjects:
Algorithms
Congestion
congestion cost
cost‐minimisation objective
Criteria
Degradation
delayed investment
deterministic algorithms
efficient transmission expansion planning
Financing
IEEE 24‐bus reliability test system
investment
locational marginal prices
minimisation
network performance
Networks
planning horizon
power generation scheduling
power transmission planning
power transmission reliability
RE generation forecast error mitigation
reference scenario
Renewable energy
renewable energy resources
renewable energy sources
Research Article
Reserves
two‐stage deterministic algorithm
unit scheduling problem
zero‐RE penetration
Citations: Items that this one cites
Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this study, a ‘two-stage’ deterministic algorithm an for efficient transmission expansion planning with renewable energy (RE) resources under the assumption that existing conventional generators provide the reserve to mitigate RE generation forecast error has been proposed. Zero-RE penetration has been considered as a ‘reference scenario’, as well as cost-minimisation objective has been considered as a planning criterion in Stage 1. In the proposed algorithm, Stage 2 is required to be solved only if the network performance degrades in relation to the reference scenario. In Stage 2, congestion cost is also incorporated as a sub-objective. Here, the locational marginal prices of the unit scheduling problem obtained from the solution of Stage 1 have been used to calculate the congestion cost. In addition to being computationally tractable, the proposed algorithm guarantees performance improvement in the network. The planning horizon is divided into smaller blocks to facilitate delayed investment. When implemented on an IEEE 24-bus reliability test system, the proposed algorithm generated minimum cost plan with better performance.
ISSN:1752-1416
1752-1424
1752-1424
DOI:10.1049/iet-rpg.2016.0085