Professional Documents
Culture Documents
J. Shu, L. Wu, L. Zhang and B. Han, "Spatial Power Network Expansion Planning
Considering Generation Expansion," in IEEE Transactions on Power Systems, vol. 30,
no. 4, pp. 1815-1824, July 2015.
doi: 10.1109/TPWRS.2014.2358237
Abstract: This paper introduces an efficient approach on static spatial power
network expansion planning integrated with generation expansion, while considering
complicated environments based on the raster map in geographic information systems
(GIS). Candidate plants could be built on any cell in the map, which means that
terminals of candidate lines connected to candidate plants are not fixed. This is a
remarkable difference from the literature in which the terminals of candidate lines
are fixed. The objective is to minimize the total system cost, subject to
prevailing investment and operation constraints. The model is formulated as a
mixed-integer linear programming (MILP) problem via integer algebra techniques. A
two-step approach is proposed to address the computational complexity. The first
step searches optimal electric line routes via dynamic programming, while the
second step solves a simplified MILP problem for obtaining final optimal generation
and transmission planning strategies based on optimal line routes derived from the
first step. In most cases, the proposed two-step approach would derive the same
global optimal solutions as those by solving the original formulation directly.
Thus, the proposed two-step approach can significantly improve the computational
efficiency while maintaining the solution optimality. Numerical examples
demonstrate the effectiveness of the proposed approach.
keywords: {algebra;computational complexity;geographic information systems;integer
programming;investment;linear programming;power generation economics;power
generation planning;power transmission planning;generation expansion;static spatial
power network expansion planning;geographic information systems;GIS;system
cost;mixed-integer linear programming;MILP problem;integer algebra
techniques;computational complexity;optimal electric line routes;dynamic
programming;optimal generation;transmission planning strategies;optimal line
routes;computational efficiency;Planning;Investment;Routing;Geographic information
systems;Power systems;Indexes;Vectors;Dynamic programming;generation
expansion;geographic information systems;mixed-integer linear programming;power
network planning;routing},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=6913023&isnumber=7124560
C. Batlle and P. Rodilla, "An Enhanced Screening Curves Method for Considering
Thermal Cycling Operation Costs in Generation Expansion Planning," in IEEE
Transactions on Power Systems, vol. 28, no. 4, pp. 3683-3691, Nov. 2013.
doi: 10.1109/TPWRS.2013.2249540
Abstract: Generation capacity expansion trends have clearly evolved in the last
decades. In the present context, renewable generation technologies are expected to
reach large penetration levels. Among other effects, these technologies are
changing the scheduling regime (and thus the unit-commitment costs) of the rest of
the generating facilities, increasing for instance the need of cycling conventional
thermal generation. In this paper we further develop the traditional screening
curves technique so as to incorporate a sound representation of the cycling
operation of thermal units. The so-resulting approach provides a more comprehensive
representation of thermal operation while keeping the screening curves well-known
capability to provide valuable analytic insights on the capacity expansion problem.
keywords: {power generation dispatch;power generation economics;power generation
planning;renewable energy sources;enhanced screening curves method;thermal cycling
operation costs;generation expansion planning;generation capacity
expansion;renewable generation technologies;unit commitment costs;thermal
operation;capacity expansion problem;Renewable energy sources;Power generation
dispatch;Cycling operation costs;generation capacity expansion;power generation
dispatch;renewable energy},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=6527360&isnumber=6627990
H. Cong, X. Wang and C. Jiang, "Two-stage nested bilevel model for generation
expansion planning in combined electricity and gas markets," in IET Generation,
Transmission & Distribution, vol. 13, no. 15, pp. 3443-3454, 6 8 2019.
doi: 10.1049/iet-gtd.2019.0293
Abstract: The growing utilisation of natural gas and renewable energy resources
brings more challenges to generation expansion planning problems. Short-term
operational constraints are equally important for long-term capacity planning. This
work studies the interdependence between electricity and natural gas systems and
presents a combined market mechanism that allows two-stage energy trading and
planning based on asynchronous electricity and gas markets. In the first stage, the
gas market is cleared with the objective of maximum social welfare (lower level),
at the same time obtaining the optimal strategies offered by gas producers and gas-
fired units (upper level). In the second stage, generation companies and consumer
companies aim to maximise their corresponding profits in the planning horizon
(upper level), and electricity market is cleared on principle of maximum social
welfare (lower level). Then, the authors develop a modified alternative direction
method of multiplier algorithm to solve the two-stage nested bilevel model. To
improve operational flexibility of expansion plans, uncertainties of renewable
energy generation and integrated demand response are also included and analysed in
different risk scenarios. Case studies validate the effectiveness of the proposed
methodology.
keywords: {power generation planning;power markets;capacity planning
(manufacturing);optimisation;profitability;power generation economics;renewable
energy sources;long-term capacity planning;natural gas;combined market
mechanism;two-stage energy trading;asynchronous electricity;gas markets;gas
market;maximum social welfare;gas producers;upper level;generation
companies;planning horizon;electricity market;two-stage nested bilevel
model;expansion plans;renewable energy generation;combined electricity;growing
utilisation;renewable energy resources;generation expansion planning
problems;short-term operational constraints},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=8826752&isnumber=8826718
K. Saxena and R. Bhakar, "Impact of LRIC pricing and demand response on generation
and transmission expansion planning," in IET Generation, Transmission &
Distribution, vol. 13, no. 5, pp. 679-685, 12 3 2019.
doi: 10.1049/iet-gtd.2018.5328
Abstract: Traditional expansion planning models reflect usage-based practices and
do not consider the complete utilisation of existing resources. This problem arises
due to non-inclusion of price-based incentives provided to the consumers who incur
additional network reinforcement or expansion cost. The paper proposes a generation
and transmission expansion planning framework that includes price-based incentives
to define the future nodal load growth. The framework implements long-run
incremental cost (LRIC)-based pricing signals for economically distributed demand
to minimise consumer usage charges as well as network investment. Peak demand
conditions by consumers are further minimised by the time-of-use-based demand
response mechanism. The combined effects of price-based response and demand
response are reflected in the future demand which serves as the basis for combined
generation and transmission expansion planning. The case studies highlight the
drawbacks of the conventional approaches which does not maximise the utilisation of
existing grid resources while the proposed framework results in delayed investment
strategies as a collective effort of the users and planner to optimise grid
resources and the cost of assessing the electricity.
keywords: {costing;demand side management;investment;optimisation;power generation
planning;power transmission economics;power transmission planning;power
transmission reliability;pricing;resource allocation;LRIC pricing;traditional
expansion planning models;usage-based practices;complete utilisation;existing
resources;price-based incentives;consumers;expansion cost;transmission expansion
planning framework;future nodal load growth;incremental cost-based pricing
signals;economically distributed demand;consumer usage charges;network
investment;financially beneficial framework;peak demand conditions;time-of-use-
based demand response mechanism;price-based response;future demand;combined
generation;proposed expansion planning models;grid resources;network
reinforcement;generation expansion planning},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=8665387&isnumber=8665385
L. Baringo and A. Baringo, "A Stochastic Adaptive Robust Optimization Approach for
the Generation and Transmission Expansion Planning," in IEEE Transactions on Power
Systems, vol. 33, no. 1, pp. 792-802, Jan. 2018.
doi: 10.1109/TPWRS.2017.2713486
Abstract: This paper proposes a stochastic adaptive robust optimization approach
for the generation and transmission expansion planning problem. The problem is
formulated under the perspective of a central planner, e.g., the transmission
system operator, that aims at determining the generation and transmission expansion
plans that minimize both the expansion and operation costs. This central planner
builds the transmission facilities and promotes the building of the most suitable
generating units among private profit-oriented investors. Uncertainties in the
future peak demand and the future generation (fuel) cost are modeled using
confidence bounds, while uncertainties in the demand variability and the production
of stochastic units are modeled using a number of operating conditions. Results of
an illustrative example and a case study based on the IEEE 118-bus test system show
the effectiveness of the proposed approach.
keywords: {optimisation;power generation planning;power transmission
planning;stochastic processes;stochastic adaptive robust optimization
approach;transmission expansion planning problem;central planner;transmission
system operator;transmission facilities;stochastic units;Uncertainty;Stochastic
processes;Production;Investment;Planning;Programming;Power transmission
lines;Generation expansion;robust optimization;stochastic programming;transmission
expansion;uncertainty},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=7944676&isnumber=8231802
D. Pozo, E. E. Sauma and J. Contreras, "A Three-Level Static MILP Model for
Generation and Transmission Expansion Planning," in IEEE Transactions on Power
Systems, vol. 28, no. 1, pp. 202-210, Feb. 2013.
doi: 10.1109/TPWRS.2012.2204073
Abstract: We present a three-level equilibrium model for the expansion of an
electric network. The lower-level model represents the equilibrium of a pool-based
market; the intermediate level represents the Nash equilibrium in generation
capacity expansion, taking into account the outcomes on the spot market; and the
upper-level model represents the anticipation of transmission expansion planning to
the investment in generation capacity and the pool-based market equilibrium. The
demand has been considered as exogenous and locational marginal prices are obtained
as endogenous variables of the model. The three-level model is formulated as a
mixed integer linear programming (MILP) problem. The model is applied to a
realistic power system in Chile to illustrate the methodology and proper
conclusions are reached.
keywords: {game theory;integer programming;linear programming;power generation
planning;power transmission planning;three-level static MILP model;transmission
expansion planning;generation expansion planning;three-level equilibrium
model;electric network;lower-level model;pool-based market;Nash equilibrium;upper-
level model;locational marginal price;exogenous marginal price;mixed integer linear
programming problem;power system;Chile;Investments;Planning;Mathematical
model;Companies;Generators;Nash equilibrium;Indexes;Equilibrium problem subject to
equilibrium constraints (EPEC);mathematical program subject to equilibrium
constraints (MPEC);Nash equilibrium;power systems economics;power transmission
planning},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=6244821&isnumber=6414672
C. Dai, L. Wu, B. Zeng and C. Liu, "System state model based multi-period robust
generation, transmission, and demand side resource co-optimisation planning," in
IET Generation, Transmission & Distribution, vol. 13, no. 3, pp. 345-354, 12 2
2019.
doi: 10.1049/iet-gtd.2018.5936
Abstract: This study discusses a multi-period co-optimised generation and
transmission expansion planning (GTEP) problem while considering a proliferation of
demand side resources (DSR). Uncertain renewable energy variations and load
fluctuations in the long-term planning horizon are addressed, and a system state
model derived via k-means clustering algorithm is adopted to capture temporal
operation features. The problem is formulated as a two-stage robust optimisation
model with mixed-integer recourse, in which annual investment decisions of
generation, transmission, and DSR assets are determined in the first stage and
short-term operation decisions of individual system states are made in the second
stage. In recognising that considering DSR deployment and the system state model
brings significant computational complexity, an extended column-and-constraint-
generation algorithm is adopted to effectively solve the proposed planning problem.
Numerical studies show that integrating DSRs into multi-period GTEP could
effectively postpone or even avoid expensive generation/transmission investment in
the planning stage, and improve economic efficiency in the operation stage.
keywords: {computational complexity;integer programming;investment;numerical
analysis;pattern clustering;power generation economics;power generation
planning;power transmission economics;power transmission planning;extended column-
and-constraint-generation algorithm;computational complexity;investment
decision;mixed-integer recourse;multiperiod cooptimised generation and transmission
expansion planning problem;k-means clustering algorithm;multiperiod GTEP
problem;multiperiod robust transmission;generation-transmission investment;demand
side resource cooptimisation planning;DSR deployment;short-term operation
decisions;two-stage robust optimisation model;temporal operation features;long-term
planning horizon;uncertain renewable energy variations;multiperiod robust
generation;system state model;planning stage},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=8641745&isnumber=8641741
Jong-Bae Park, Young-Moon Park, Jong-Ryul Won and K. Y. Lee, "An improved genetic
algorithm for generation expansion planning," in IEEE Transactions on Power
Systems, vol. 15, no. 3, pp. 916-922, Aug. 2000.
doi: 10.1109/59.871713
Abstract: This paper presents a development of an improved genetic algorithm (IGA)
and its application to a least-cost generation expansion planning (GEP) problem.
Least-cost GEP problem is concerned with a highly constrained nonlinear dynamic
optimization problem that can only be fully solved by complete enumeration, a
process which is computationally impossible in a real-world GEP problem. In this
paper, an improved genetic algorithm incorporating a stochastic crossover technique
and an artificial initial population scheme is developed to provide a faster search
mechanism. The main advantage of the IGA approach is that the "curse of
dimensionality" and a local optimal trap inherent in mathematical programming
methods can be simultaneously overcome. The IGA approach is applied to two test
systems, one with 15 existing power plants, 5 types of candidate plants and a 14-
year planning period, and the other, a practical long-term system with a 24-year
planning period.
keywords: {power generation planning;genetic algorithms;mathematical
programming;genetic algorithm;generation expansion planning;least-cost generation
expansion planning;constrained nonlinear dynamic optimization;stochastic crossover
technique;artificial initial population scheme;local optimal trap;mathematical
programming methods;Genetic algorithms;Power system planning;Mathematical
programming;Constraint optimization;Power generation;Stochastic processes;System
testing;Decision making;Power industry;Capacity planning},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=871713&isnumber=18883
Li Wenyuan and R. Billinton, "A minimum cost assessment method for composite
generation and transmission system expansion planning," in IEEE Transactions on
Power Systems, vol. 8, no. 2, pp. 628-635, May 1993.
doi: 10.1109/59.260818
Abstract: Composite generation and transmission system expansion analysis should
take into account both economic considerations and adequacy requirements. An
optimum expansion plan should achieve the minimum total investment, operation and
damage cost. A minimum cost assessment method for composite system expansion
planning, which can be used to consider generation expansion and transmission
expansion simultaneously, is presented. The minimization model proposed to
incorporate both operating and outage costs can recognize different customer damage
functions at different load buses and includes the duration of the simulated
contingency system states . A computer program based on the presented method has
been developed to provide a set of line, load bus, generator bus and system indices
which can be used to select optimal expansion plans at different load growth
levels. Case studies in which the method is applied to the IEEE Modified
Reliability Test System indicate its effectiveness.<>
keywords: {economics;minimisation;power system analysis computing;power system
planning;generation planning;operation cost;minimum cost assessment
method;transmission system expansion planning;optimum expansion plan;minimum total
investment;damage cost;load buses;contingency system states;computer program;IEEE
Modified Reliability Test System;Cost function;Power system planning;Interconnected
systems;Investments;System testing;Senior members;Power system analysis
computing;Power generation;Power system reliability;Power system economics},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=260818&isnumber=6592
Jinxiang Zhu and Mo-yuen Chow, "A review of emerging techniques on generation
expansion planning," in IEEE Transactions on Power Systems, vol. 12, no. 4, pp.
1722-1728, Nov. 1997.
doi: 10.1109/59.627882
Abstract: Power system generation expansion planning is a challenging problem due
to the large-scale, long-term, nonlinear and discrete nature of generation unit
size. Since the computation revolution, several emerging techniques have been
proposed to solve large scale optimization problems. Many of these techniques have
been reported as used in generation expansion planning. This paper describes these
emerging optimization techniques (including expert systems, fuzzy logic, neural
networks, analytic hierarchy process, network flow, decomposition method, simulated
annealing and genetic algorithms) and their potential usage in solving the
challenging generation expansion planning in future competitive environments in the
power industry. This paper provides useful information and resources for future
generation expansion planning.
keywords: {power system planning;electric power generation;power system CAD;expert
systems;fuzzy logic;neural nets;simulated annealing;genetic algorithms;power system
generation expansion planning;emerging optimization techniques;expert systems;fuzzy
logic;neural networks;analytic hierarchy process;network flow;decomposition
method;simulated annealing;genetic algorithms;competitive environments;power
industry;Power system planning;Power generation;Large-scale systems;Power system
analysis computing;Optimization methods;Expert systems;Fuzzy logic;Neural
networks;Algorithm design and analysis;Computational modeling},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=627882&isnumber=13647
C. Yuan, C. Gu, F. Li, B. Kuri and R. W. Dunn, "New Problem Formulation of Emission
Constrained Generation Mix," in IEEE Transactions on Power Systems, vol. 28, no. 4,
pp. 4064-4071, Nov. 2013.
doi: 10.1109/TPWRS.2013.2263230
Abstract: This paper proposes an enhanced optimization formulation to help
determine the type of power generation mix that can meet a given carbon emission
target at the minimum cost. Compared to the previous studies, the model proposed in
this paper takes account of the emission cost at operational level and explores its
impacts on the long-term emission target oriented generation planning innovatively.
Meanwhile, the model is able to take account of the integer variables and
nonlinearity of the operational cost together with network constraints and
renewable generation expansion in one long-term generation planning model. The
problem is solved by an innovative discrete gradient search method, and a new
concept, emission reduction cost (ERC), is developed, which helps determine which
generation technology is the most cost efficient in emission reduction during
different stages of generation expansion. A case study on a modified IEEE 30-bus
system is presented to demonstrate the application of this model and the value of
considering short-term emission costs and the network constraints on the long-term
generation expansion. The results and sensitivity analysis are provided to show
that a higher short-term financial pressure can help realize the emission target at
a lower total cost (investment and operational costs). Optimization without
considering it may overestimate the total cost required for the generation mix
restructuring. Additionally, a comparative study shows that optimization without
considering network constraints may underestimate the total cost required for
realizing the specified emission reduction target.
keywords: {air pollution control;costing;gradient methods;investment;power
generation economics;power generation planning;search problems;emission constrained
generation mix;enhanced optimization formulation;power generation mix;carbon
emission target;long-term emission target oriented generation planning;operational
cost;network constraints;renewable generation expansion;long-term generation
planning model;innovative discrete gradient search method;emission reduction
cost;generation technology;emission reduction;cost efficient;modified IEEE 30-bus
system;short-term emission costs;sensitivity analysis;short-term financial
pressure;operational costs;investment costs;generation mix restructuring;emission
reduction target;Emission cost;emission target;generation mix;network
constraints;renewable generation},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=6519958&isnumber=6627990
X. Han, L. Zhao, J. Wen, X. Ai, J. Liu and D. Yang, "Transmission network expansion
planning considering the generators' contribution to uncertainty accommodation," in
CSEE Journal of Power and Energy Systems, vol. 3, no. 4, pp. 450-460, Dec. 2017.
doi: 10.17775/CSEEJPES.2015.01190
Abstract: This paper presents an optimization for transmission network expansion
planning (TNEP) under uncertainty circumstances. This TNEP model introduces the
approach of parameter sets to describe the range that all possible realizations of
uncertainties in load and renewable generation can reach. While optimizing the TNEP
solution, the output of each generator is modeled as an uncertain variable to
linearly respond to changes caused by uncertainties, which is constrained by the
extent to which uncertain parameters may change the operational range of
generators, and network topology. This paper demonstrates that the robust
optimization approach is effective to make the problem with uncertainties tractable
by converting it into a deterministic optimization, and with the genetic algorithm,
the optimal TNEP solution is derived iteratively. Compared with other robust TNEP
results tested on IEEE 24-bus systems, the proposed method produces a least-cost
expansion plan without losing robustness. In addition, the contribution that each
generator can make to accommodate with every uncertainty is optimally quantified.
Effects imposed by different uncertainty levels are analyzed to provide a
compromise of the conservativeness of TNEP solutions.
keywords: {optimisation;power transmission planning;deterministic
optimization;robust optimization approach;network topology;operational
range;uncertain parameters;renewable generation;TNEP model;uncertainty
circumstances;uncertainty accommodation;transmission network expansion
planning;least-cost expansion plan;robust TNEP results;optimal TNEP solution;IEEE
24-bus systems;uncertainty levels;Uncertainty;Generators;Renewable energy
sources;Robustness;Optimization;Planning;Load modeling;Expansion planning;renewable
energy;robustoptimization;transmission network;uncertainty},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=8233590&isnumber=8233576
Jaeseok Choi, A. A. El-Keib and T. Tran, "A fuzzy branch and bound-based
transmission system expansion planning for the highest satisfaction level of the
decision maker," in IEEE Transactions on Power Systems, vol. 20, no. 1, pp. 476-
484, Feb. 2005.
doi: 10.1109/TPWRS.2004.840446
Abstract: This work proposes a new method for choosing the best transmission system
expansion plan for the highest satisfaction level of the decision maker. The
proposed method considers the permissibility and ambiguity of the investment budget
(economics) for constructing new transmission lines and the delivery marginal rate
(reliability criterion) of the system. This is achieved by modeling the
transmission expansion problem as a fuzzy integer programming one. The method
solves for the optimal strategy (a reasonable and flexible plan that would not be
significantly worsened by any assumed changes in the surrounding situations) using
a fuzzy set theory-based branch and bound method that utilizes a network flow
approach and the maximum flow-minimum cut set theorem. When only a very limited
size database is available to evaluate probabilistic reliability indices, the
proposed technique provides the decision maker with a valuable and practical tool
to solve the transmission expansion problem, considering problem uncertainties.
Test results on an existing 21-bus system show that the proposed method is suitable
for solving the transmission expansion planning problem subject to practical
ambiguities.
keywords: {fuzzy set theory;power transmission planning;integer
programming;decision making;tree searching;branch and bound-based transmission
system planning;decision maker;transmission lines;fuzzy integer programming;fuzzy
set theory;transmission expansion problem;Fuzzy systems;Electricity supply
industry;Power system planning;Power system
reliability;Investments;Uncertainty;Power generation economics;Environmental
economics;Electricity supply industry deregulation;Power system
economics;Flexibility and ambiguity;fuzzy branch and bound;fuzzy integer
programming;satisfaction level of decision maker;transmission expansion planning},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1388542&isnumber=30215
Young-Moon Park, Jong-Ryul Won, Jong-Bae Park and Dong-Gee Kim, "Generation
expansion planning based on an advanced evolutionary programming," in IEEE
Transactions on Power Systems, vol. 14, no. 1, pp. 299-305, Feb. 1999.
doi: 10.1109/59.744547
Abstract: This paper proposes an efficient evolutionary programming algorithm for
solving a generation expansion planning (GEP) problem known as a highly-nonlinear
dynamic problem. Evolutionary programming (EP) is an optimization algorithm based
on the simulated evolution (mutation, competition and selection). In this paper,
some improvements are presented to enhance the efficiency of the EP algorithm for
solving the GEP problem. First, by a domain mapping procedure, yearly cumulative
capacity vectors are transformed into one dummy vector, whose change can field a
kind of trend in the cost value. Next quadratic approximation technique and
tournament selection are utilized. To validate the proposed approach, these
algorithms are tested on two cases of expansion planning problems. Simulation
results show that the proposed algorithm can provide successful results within a
reasonable computational time compared with conventional EP and dynamic
programming.
keywords: {power generation planning;evolutionary computation;approximation
theory;dynamic programming;vectors;power generation expansion planning;advanced
evolutionary programming;highly-nonlinear dynamic problem;optimization
algorithm;simulated evolution;mutation;competition;selection;domain mapping
procedure;yearly cumulative capacity vectors;dummy vector;quadratic approximation
technique;tournament selection;dynamic programming;Genetic programming;Dynamic
programming;Cost function;Power system planning;Evolution (biology);Genetic
mutations;Quadratic programming;Power system dynamics;Genetic algorithms;Biological
system modeling},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=744547&isnumber=16090
Z. Wu, P. Zeng and X. Zhang, "Two-stage stochastic dual dynamic programming for
transmission expansion planning with significant renewable generation and N-k
criterion," in CSEE Journal of Power and Energy Systems, vol. 2, no. 1, pp. 3-10,
March 2016.
doi: 10.17775/CSEEJPES.2016.00003
Abstract: The large-scale integration of renewable energy sources (RES) is the
global trend to deal with the energy crisis and greenhouse emissions. Due to the
intermittent nature of RES together with the uncertainty of load demand, the
problem of transmission expansion planning (TEP) is facing more and more challenges
from uncertainties. In this paper, the TEP problem is modeled as a two-stage
formulation, so as to minimize the total of investment costs and generation costs.
To ensure the utilization level of the RES generation, the expansion plan is
required to provide sufficient transmission capacity for the integration of RES.
Also, N-k security criterion is considered into the model, so the expansion plan
can meet the required security criteria. The stochastic dual dynamic programming
(SDDP) approach is applied to consider the uncertainties, and the whole model is
solved by Benders' decomposition technique. Two case studies are carried out to
compare the performance of the SDDP approach and the deterministic approach.
Results show that the expansion plan obtained by the SDDP approach has a better
performance than that of the deterministic approach.
keywords: {air pollution;dynamic programming;power system security;renewable energy
sources;stochastic processes;two-stage stochastic dual dynamic
programming;transmission expansion planning;significant renewable
generation;renewable energy sources;energy crisis;greenhouse emissions;TEP
problem;N-k security criterion;SDDP approach;Benders' decomposition technique;N-k
security criterion;stochastic dual dynamicprogramming;transmission expansion
planning;two-stageproblem.},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=7439077&isnumber=7439073
J. Qiu et al., "A Linear Programming Approach to Expansion Co-Planning in Gas and
Electricity Markets," in IEEE Transactions on Power Systems, vol. 31, no. 5, pp.
3594-3606, Sept. 2016.
doi: 10.1109/TPWRS.2015.2496203
Abstract: In a carbon-constrained world, the continuing and rapid growth of gas-
fired power generation (GPG) will lead to the increasing demand for natural gas.
The reliable and affordable gas supply hence becomes an important factor to
consider in power system planning. Meanwhile, the installation of GPG units should
take into account not only the fuel supply constraints but also the capability of
sending out the generated power. In this paper, a novel expansion co-planning (ECP)
model is proposed, aiming to minimize the overall capital and operational costs for
the coupled gas and power systems. Moreover, linear formulations are introduced to
deal with the nonlinear nature of the objective functions and constraints.
Furthermore, the physical and economic interactions between the two systems are
simulated by an iterative process. The proposed linear co-planning approach is
tested on a simple six-bus power system with a seven-node gas system and a modified
IEEE 118-bus system with a 14-node gas system. Numerical results have demonstrated
that our co-planning approach can allow systematic investigations on supporting
cost-effective operating and planning decisions for power systems.
keywords: {iterative methods;linear programming;power markets;power system
planning;linear programming approach;expansion coplanning;gas markets;electricity
markets;six-bus power system;seven-node gas system;modified IEEE 118-bus system;14-
node gas system;power systems planning;Contracts;Planning;Power
generation;Reliability;Power systems;Pipelines;Electricity supply industry;Co-
optimization;expansion co-planning;natural gas systems;linear programming},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=7350261&isnumber=7546948
Y. Fukuyama and Hsaio-Dong Chiang, "A parallel genetic algorithm for generation
expansion planning," in IEEE Transactions on Power Systems, vol. 11, no. 2, pp.
955-961, May 1996.
doi: 10.1109/59.496180
Abstract: This paper presents an application of parallel genetic algorithm to
optimal long-range generation expansion planning. The problem is formulated as a
combinatorial optimization problem that determines the number of newly introduced
generation units of each technology during different time intervals. A new string
representation method for the problem is presented. Binary and decimal coding for
the string representation method are compared. The method is implemented on
transputers, one of the practical multi-processors. The effectiveness of the
proposed method is demonstrated on a typical generation expansion problem with four
technologies, five intervals, and a various number of generation units. It is
compared favorably with dynamic programming and conventional genetic algorithm. The
results reveal the speed and effectiveness of the proposed method for solving this
problem.
keywords: {power system planning;power system CAD;dynamic programming;parallel
algorithms;combinatorial mathematics;multiprocessing systems;electric power
generation;transputers;power systems;parallel genetic algorithm;long-range
generation expansion planning;combinatorial optimization problem;time
intervals;CAD;binary coding;decimal coding;transputers;multi-processors;generation
units;Genetic algorithms;Dynamic programming},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=496180&isnumber=10801
X. Cao, J. Wang and B. Zeng, "A Chance Constrained Information-Gap Decision Model
for Multi-Period Microgrid Planning," in IEEE Transactions on Power Systems, vol.
33, no. 3, pp. 2684-2695, May 2018.
doi: 10.1109/TPWRS.2017.2747625
Abstract: This paper presents a chance constrained information gap decision model
for multi-period microgrid expansion planning (MMEP) considering two categories of
uncertainties, namely random and non-random uncertainties. The main task of MMEP is
to determine the optimal sizing, type selection, and installation time of
distributed energy resources (DER) in microgrid. In the proposed formulation,
information gap decision theory (IGDT) is applied to hedge against the non-random
uncertainties of long-term demand growth. Then, chance constraints are imposed in
the operational stage to address the random uncertainties of hourly renewable
energy generation and load variation. The objective of chance constrained
information gap decision model is to maximize the robustness level of DER
investment meanwhile satisfying a set of operational constraints with a high
probability. The integration of IGDT and chance constrained program, however, makes
it very challenging to compute. To address this challenge, we propose and implement
a strengthened bilinear Benders decomposition method. Finally, the effectiveness of
proposed planning model is verified through the numerical studies on both the
simple and practical complex microgrid. Also, our new computational method
demonstrates a superior solution capacity and scalability. Compared to directly
using a professional mixed integer programming solver, it could reduce the
computational time by orders of magnitude.
keywords: {decision theory;distributed power generation;integer programming;power
distribution planning;renewable energy sources;chance constrained information gap
decision model;multiperiod microgrid expansion planning;nonrandom
uncertainties;information gap decision theory;random uncertainties;distributed
energy resources;DER;IGDT;long-term demand growth;professional mixed integer
programming solver;computational
time;Uncertainty;Microgrids;Planning;Investment;Load modeling;Computational
modeling;Capacity planning;Microgrid;multi-period expansion planning;information
gap decision theory;chance constrained program;bilinear Benders decomposition},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=8023807&isnumber=8340241
Q. Ploussard, L. Olmos and A. Ramos, "An Efficient Network Reduction Method for
Transmission Expansion Planning Using Multicut Problem and Kron Reduction," in IEEE
Transactions on Power Systems, vol. 33, no. 6, pp. 6120-6130, Nov. 2018.
doi: 10.1109/TPWRS.2018.2842301
Abstract: This paper provides a new methodology to compute a reduced but accurate
network representation in a transmission expansion planning (TEP) context.
Considering this reduced network should lead to the same investment decisions as if
the whole original network were considered. A set of relevant lines to be preserved
is defined based on a proxy of the TEP solution. An optimal network partition,
resulting from solving the multicut problem, is computed in such a way that the two
ends of each of these relevant lines are allocated to two different areas. An
iterative Kron reduction is then applied to each area to eliminate most of the
buses that are not connected to any interarea line. This two-step process results
in a compact but representative reduced network. Our algorithm has been implemented
in General Algebraic Modelling Software and Matrix Laboratory and has been tested
on the standard IEEE 118 bus system and a case study based on the European power
system. The method produces very promising results and, in the considered case
studies, leads to the same, or equally efficient, investment decisions and
essentially the same total costs as when considering the whole original network.
keywords: {computational complexity;optimisation;power transmission
planning;multicut problem;transmission expansion planning context;TEP
solution;standard IEEE 118 bus system;Kron Reduction;Network theory
(graphs);Integer linear programming;Partitioning algorithms;Power generation
planning;Clustering;dimension reduction;integer linear programming;network theory
(graphs);partitioning algorithms;transmission expansion planning;relaxation
methods},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=8370048&isnumber=8496918
Y. Hong and K. Pen, "Optimal VAR Planning Considering Intermittent Wind Power Using
Markov Model and Quantum Evolutionary Algorithm," in IEEE Transactions on Power
Delivery, vol. 25, no. 4, pp. 2987-2996, Oct. 2010.
doi: 10.1109/TPWRD.2010.2044897
Abstract: Techniques for distributed generations (DGs) have attracted increasing
attention due to their effects on environmental sustainability and the reduction in
traditional megawatt (MW) generation expansion. Wind farms are one of the DGs and
have intermittent characteristics. This paper presents a method for static VAR
planning considering existing wind generator voltages and transformer taps as
controllers to regulate the voltage profile in a distribution system with wind
farms. Wind power generations and bus loads are modeled with the Markov model. The
probabilities and durations of the operation states are obtained. Through a quantum
evolutionary algorithm, the cost of static VAR compensators and MW loss in the
system are minimized and the operational constraints are fulfilled. The
applicability of the proposed method is verified through simulations using a
standalone 25-bus (Penghu) system and a 17-bus system.
keywords: {distributed power generation;evolutionary computation;Markov
processes;power system planning;static VAr compensators;voltage control;wind power
plants;intermittent wind power;Markov model;quantum evolutionary
algorithm;distributed generations;environmental sustainability;megawatt generation
expansion;Wind farms;static VAR planning;wind generator voltages;transformer
taps;voltage regulation;17-bus system;Reactive power;Wind energy;Evolutionary
computation;Wind energy generation;Wind farms;Power system modeling;Distributed
control;Green products;Distributed power generation;Power
generation;Intermittence;Markov model;quantum evolutionary algorithm;VAR
planning;voltage fluctuation},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=5453026&isnumber=5570058
A. Vafamehr, M. E. Khodayar, S. D. Manshadi, I. Ahmad and J. Lin, "A Framework for
Expansion Planning of Data Centers in Electricity and Data Networks Under
Uncertainty," in IEEE Transactions on Smart Grid, vol. 10, no. 1, pp. 305-316, Jan.
2019.
doi: 10.1109/TSG.2017.2738444
Abstract: This paper presents the expansion planning for data centers and data
routes in the data and electricity networks considering the uncertainties in the
planning horizon to ensure an acceptable rate of service to the requests received
from the end-users in the data network. The objective is to determine the location
and capacity of the data centers as well as the required data routes while
considering the imposed constraints in the electricity and data networks. The
installation cost of data centers and data routes, as well as the expected
operation cost of the data centers, are minimized. The proposed problem addressed
the uncertainties in the expansion planning of the electricity networks including
the availability of renewable generation resources, the variations in electricity
demand, the availability of generation and transmission components in the
electricity network, and the uncertainties in the number of requests received by
the user groups in the data network. The problem is formulated as a mixed integer
linear programming problem and Bender decomposition and electricity price signals
are used to capture the interaction among the data and electricity networks. The
presented case study shows the effectiveness of the proposed approach.
keywords: {integer programming;linear programming;power markets;pricing;expansion
planning;data centers;data network;electricity network;renewable generation
resources;electricity demand;mixed integer linear programming;Bender
decomposition;electricity price signals;Planning;Servers;Uncertainty;Security;Cloud
computing;Reliability;Electronic mail;Data center;expansion planning;data
route;Benders decomposition},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=8007231&isnumber=8595470
E. Du et al., "The Role of Concentrating Solar Power Toward High Renewable Energy
Penetrated Power Systems," in IEEE Transactions on Power Systems, vol. 33, no. 6,
pp. 6630-6641, Nov. 2018.
doi: 10.1109/TPWRS.2018.2834461
Abstract: Achieving high renewable energy penetrated power systems requires
considerable operational flexibility to hedge the variability and uncertainty of
variable renewable energy (VRE) generation. Compared with VRE sources,
concentrating solar power (CSP) is an emerging controllable renewable generation
technique that utilizes solar thermal power to generate electricity. The
operational dispatchability of CSP would contribute to the power system transition
toward high renewable penetration. In this paper, we explore how the generation
portfolio will change toward high renewable energy penetrations, how much cost is
involved, and what role CSP will play in realizing a high renewable energy
penetrated power system. This study relies on a stochastic two-stage generation and
transmission expansion planning model with CSP plants. The model captures the
uncertainty and variability of renewable generation and the flexibility limits of
thermal plants. With the target of achieving a renewable-dominated minimum-cost
system with an expected renewable energy penetration level, the investments of both
generation and transmission facilities are optimized. A case study on IEEE test
systems with renewable technology cost data in 2050 is performed to analyze the
value of CSP toward high renewable energy penetrated power systems.
keywords: {investment;power generation economics;power generation reliability;power
transmission planning;renewable energy sources;solar power;solar power
stations;thermal power stations;variable renewable energy generation;CSP;solar
thermal power;power system transition;high renewable energy penetrated power
system;two-stage generation;transmission expansion planning model;expected
renewable energy penetration level;renewable technology cost data;concentrating
solar power;controllable renewable generation technique;Renewable energy
sources;Power system planning;Uncertainty;Investment;Wind power generation;Load
modeling;Concentrating solar power;variable renewable energy;high renewable
penetration;power system planning},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=8356090&isnumber=8496918
J. Zhan, C. Y. Chung and A. Zare, "A Fast Solution Method for Stochastic
Transmission Expansion Planning," in IEEE Transactions on Power Systems, vol. 32,
no. 6, pp. 4684-4695, Nov. 2017.
doi: 10.1109/TPWRS.2017.2665695
Abstract: Stochastic programming is a cost-effective approach to model the
transmission expansion planning (TEP) considering the uncertainties of wind and
load, which is known as stochastic TEP (STEP). The uncertainty can be accurately
represented by a large number of scenarios, which need to be reduced to a
relatively small number in order to shorten the computational time required by the
STEP. The forward selection algorithm (FSA) is an accurate scenario reduction
method which, however, is quite time consuming. An improved FSA (IFSA) is proposed
in order to shorten the computational time. The STEP is a large-scale mixed-integer
programming problem, and, therefore, is difficult to be solved directly. Benders
decomposition algorithm is suitable to solve the STEP by decomposing it into master
and multiple slave problems. The slave problems are nonlinear and thereby are
difficult and time consuming to be solved. In this regard, a linearization method
is proposed to solve the slave problems faster and to calculate the Lagrangian
multipliers needed by the master problem. Two medium and a large datasets are used
to demonstrate the efficiency of the IFSA and a 24-, a 300-, and a 2383-bus test
systems are used to verify the efficiency of the linearization method.
keywords: {integer programming;power transmission planning;stochastic
programming;stochastic transmission expansion planning;stochastic
programming;stochastic TEP;STEP;forward selection algorithm;improved
FSA;IFSA;mixed-integer programming problem;benders decomposition algorithm;multiple
slave problems;linearization method;Wind power generation;Integrated circuit
modeling;Uncertainty;Programming;Mathematical model;Random variables;Stochastic
processes;Benders decomposition algorithm;Lagrangian
multipliers;linearization;scenario reduction method;stochastic
programming;transmission expansion planning (TEP)},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=7847432&isnumber=8071072