Professional Documents
Culture Documents
A Multi Objective PMU Placement Method Considering Measurement Redundancy and Observability Value Under Contingencies
A Multi Objective PMU Placement Method Considering Measurement Redundancy and Observability Value Under Contingencies
A Multi Objective PMU Placement Method Considering Measurement Redundancy and Observability Value Under Contingencies
net/publication/260497777
CITATIONS READS
44 170
4 authors, including:
Alireza Fereidunian
Khaje Nasir Toosi University of Technology
70 PUBLICATIONS 381 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
All content following this page was uploaded by Seyed Mahdi Mazhari on 12 June 2015.
Penalty function of PMUs’ unreliability. at every node of a wide-area interconnected network. Hence,
optimal PMU placement is formulated as a power system opti-
Penalty function of lines unreliability.
mization problem and is investigated in various studies [5]–[18].
Penalty function of buses’ redundancies. Considerable research has been devoted to PMU placement
problem in literature. The performance of genetic algorithm
Penalty function of buses unobservability.
and simulated annealing is investigated for solving the PMU
Probability of selecting action at the th iteration. placement problem in [5] and [6], respectively. In [7], immunity
Observability value of each disturbance. genetic algorithm is applied to a standard test system. While
satisfactory results are presented, obtained results may hardly
Variables: meet the topological observability constraints [15]. Although
Binary decision variable that is equal to 1 if PMU these methods can find minimum number of PMUs, measure-
is installed at bus and 0 otherwise. ment redundancy, as a conflicting and progressive objective,
is rarely considered. Non-dominated sorting genetic algorithm
Binary decision variable that is equal to 1 if bus (NSGA) is proposed in [8] for simultaneous minimization of
is observed and 0 otherwise. number of PMUs and maximization of measurement redun-
Binary decision variable that is equal to 1 if bus dancy; however, this method may not lead to the minimum
is zero-injection bus or there is a power injection number of PMUs that can make the system observable [9]. A
measurement at bus and 0 otherwise. binary search algorithm is proposed in [9] for system observ-
ability, which is capable of finding the global optimum, yet it is
Binary decision variable that is equal to 1 if there computationally expensive.
is a voltage measurement at bus and 0 otherwise. Moreover, integer programming has been widely used for
Binary decision variable that is equal to 1 if there PMU placement [10]–[13]. In [10], integer quadratic program-
is a flow injection measurement between buses ming is proposed, considering single line outages and loss of
and 0 otherwise. PMUs. However, effects of zero-injection buses are not consid-
ered in the developed algorithm. A generalized integer linear
Binary decision variable that is equal to 0 if the
programming is also used in [11]. The method considers power
th power injection measurement has observed a
network with and without conventional measurements; never-
network bus and 1 otherwise.
theless, it needs some modifications to be used in multistage
planning. Moreover, it is not studied the contingencies. A new
I. INTRODUCTION integer linear programming based formulation is proposed for
multi-stage scheduling of PMU placement in [12]. Although the
II. PROBLEM FORMULATION In the first term of (1), the total costs imposed for placing a
PMU at a bus are affected by its geographical position, type of
A. Mathematical Modeling PMU, and status of the existing telecommunication system at
that bus [13].
In this paper, the multi-objective PMU placement problem is The second term of (1), guarantees the achievement of max-
formulated as in (1)–(12). Equation (1) represents the objective imum measurement redundancy while minimizing the number
function of the PMU placement problem, in which, the first term of PMUs during the optimization process. In this term,
represents total cost of PMUs installed throughout the network. shows penalty function of buses redundancy and is calculated
The second term represents a penalty factor for observability re- through (4). In this equation, is the maximum number of
dundancies in normal operation; and the third and fourth terms network redundancies, which appears when PMUs are installed
provide penalty functions for buses unobservability under con- at all of the network buses. Equation (5) shows how is
tingencies. Finally, the fifth term is a penalty function which ac- calculated for a network. Accordingly, minimizing a penalty
counts for the network unobservability in normal operation. The function as , can guarantee the achievement
PMU placement problem constraints are represented in (2)–(3). of maximum measurement redundancy. Since, the mentioned
While (2) assures that whole buses possess their least prede- penalty parameter and the first term of (1) are not as the same
fined redundancies, and (3) guarantees that total project cost is type, simultaneous optimization of these terms by a single
less than the project budget: objective function cannot lead to the optimal solution [8]. To
overcome this deficiency, the penalty function is divided by
maximum network redundancy and the obtained result is mul-
tiplied by minimum PMU cost as shown in (1) and (4). In (4),
(1) is a small quantity, which ensures that in all situations.
It is empirically seen in simulations that if ,
Subject to: the optimization algorithm always converges to the optimal
solution. In (1), the redundancy penalty function, , is multi-
(2) plied by PMU cost to increase the worth of redundancy during
(3) optimization process. Moreover, is selected, in order
to ensure that is always less than a PMU cost
Hence, although an increase in number of PMUs decreases
where: the , increases in the first term of (1) would be more than
decrease of the second term, thus leading to an increase in the
objective function. Therefore, the possibility of entrapping in
(4)
local minima is reduced, while the first two terms of (1) are
minimized.
(5)
Third and fourth terms of (1) show effects of PMU losses and
line outages, respectively; considering worth of observability
in contingencies. The aim of PMU placement is to make the
(6) system topologically observable. Therefore, the system opera-
tors expect to observe all network disturbances (including faults,
blackouts, or ones which are cleared by the protective devices
(7) and etc.) by efficient utilization of a number of PMUs at proper
buses. However, PMU losses and line outages may cause a set of
This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination.
disturbances not to be observed in contingency situations. To re- bance is calculated by dividing the total PMU costs by
solve this issue, the researchers have solved the PMU placement total number of network disturbances as formulated in (8).
problem with respect to contingency criterion [10]–[15]. It must be noted that, (6) and (7) are formed based on single
This criterion guarantees that the system is observable under contingencies [12]–[14]. However, they can easily be extended
single contingencies. Although the criterion substan- to consider multiple simultaneous contingencies. Nevertheless,
tially improves the system reliability, it may be economically unlike [12]–[14] in which power network remains observable
inefficient as it proposes excessive PMUs, comparing to the situ- during contingencies, that might not be necessarily economical,
ation without this criterion [14], [15]. Similarly, observability of our proposed method may not lead to complete observability
some lines may have little significance [19]. On the other hand, in contingencies unless it is economically efficient. Since the
from the technical point of view, the system operator may tend third and fourth terms of (1) represents the monetary worth of
to observe the current flows through a corridor in any situation, observability in contingencies, the first four terms of (1) have
thus need to consider higher orders of reliability like and the same unit ($); hence, they can be simultaneously optimized
so on. Therefore, it is not reasonable to limit the observability through a single objective function as reported in (1).
level of such lines by criterion [20], [21]. Addressing The fifth term of (1) shows penalty parameter of network un-
these concerns is the motivation behind proposing the observ- observability in which is the penalty function of bus un-
ability value in this work, i.e., the third and fourth terms of the observability and is calculated through (9). In this equation,
objective function. is a binary decision variable that is equal to 1 if bus i is ob-
Therefore, worth of observability in contingencies is evalu- servable and is set to 0 otherwise. Moreover, as illustrated in
ated and the PMU placement is conducted based upon an eco- the fifth term of (1), the unobservability penalty function
nomic objective function. Third and fourth terms of (1) show is multiplied by a very large number . If all of the network
effects of PMU losses and line outages, respectively. It is as- buses are observed, the will return zero and no penalty is
sumed that a PMU is the main element for sensing a set of line added to the objective function. Hence, the objective function
disturbances which are observed directly or by the aid of this will return the least value for the feasible solutions, comparing
PMU. Therefore, it can be said that the PMU cost is depreci- to those of infeasible ones. It is empirically seen in simulations
ated to sense a set of disturbance during its lifecycle. Hence, that if ), the optimization algorithm always
each disturbance has a monetary value like (8). Since some of converges to the optimal solution.
network disturbance may be missed without PMUs within con-
tingencies, it would be economical to place a PMU at a bus, if
that helps a considerable number of disturbances to be sensed C. Proposed Observability Function
in such situation. Thus the financial benefit of installing a PMU
is significant comparing to its cost. A new observability function is proposed in (10). This
Worth of un-sensed disturbances due to PMU losses and line equation remains unchanged in presence of conventional
outages are formulated through (6) and (7), respectively. In (6), non-synchronous measurements and zero-injection buses.
the annual PMU outage time is multiplied by the While the first term represents direct observability from neigh-
set of disturbances which are not sensed during its outage time. boring PMUs, the effects of conventional measurements are
It should be noted that the set of disturbance that are sensed considered within the second and third terms. In the third term,
directly or by the aid of PMU is calculated as . shows observability due to installation of a conventional
Since the cost of PMU is depreciated to observe these distur- voltage phasor measurement at bus . If a voltage measurement
bances, (6) is able to calculate worth of disturbances which are is installed on a bus, it measures voltage phasor of that bus, and
not sensed because of the PMU outages. In this equation, the the bus becomes observable [15], [22].
union operator is used to represent the simultaneous occur- In addition, which is calculated as (11) represents the
rence of disturbances in contingencies. times by which the th bus is observed due to the effects of zero-
A monetary factor for observability value of line is consid- injection buses or conventional measurements that are placed
ered in the penalty function, to represent the criticality of the at bus (or between buses and ). Since a branch flow mea-
line. A line may have strategic role regarding its usage, the path surement can easily measure the branch current, if the voltage
which it construct, and so on. For instance, transmission lines phasor at one end of the branch is observed, the voltage phasor
which export electrical energy between two countries or two re- at the other end becomes observable according to Ohm’s Law
gions might have more importance for the system operator. In [15], [16], [22]. This effect is considered in the first term of (11).
order to meet these constraints in the proposed penalty function, For a set of buses that coincide to a zero-injection bus, plus that
, which shows the monetary factor for observability value of zero-injection bus, if the voltage phasors are all observable ex-
line , is added to (6). The factor can be set equal to 1 for cept one, the unobservable bus also will be observed via KCL
a simple network or when the actual value of is not deter- [11]–[16]. This situation is modeled through the second term
mined. However, if is set to , the optimization algorithm of (11). In this term, is a floor square bracket function and
tries to find the PMU layout in which line shall be observed guarantees the second term of (11) to be binary. Assume bus
under contingencies. as a zero-injection bus. If members of the set are all ob-
In (7), similar to (6), the annual line outage time servable except one, would equal to
is multiplied by the set of disturbances which 1 and the remaining bus also became observable, otherwise the
are not sensed during its outage time. Worth of each distur- second term of (11) would equal to 0.
This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination.
(13)
(15)
other
Step 2) Calculate (12) for the entire network buses. In the above equation, represents total number of
Step 3) Update using (10)–(11). actions for each automaton. If , the recurrence (14)
Step 4) Repeat steps (2)–(3) until for and (15) are called linear reward-penalty algorithm,
all buses. if , the given equations are called linear reward-
penalty , and finally if they are called linear
III. CELLULAR LEARNING AUTOMATA reward-inaction .
The overall procedure of the CLA can be described as fol-
Cellular automata are dynamically discrete systems which
lows: each cell contains a learning automaton which initially se-
their behavior relies on their local relevance [23], [24]. Cellular
lects an action in random, from a finite set of its allowed actions.
automata are composed of a regular array of cells and each fol-
Then, the selected actions are rewarded or penalized according
lows a simple rule. While each cell can assume a state from
to the actions selected by their neighbors (local rules) and also
a finite set of states, they act together to improve themselves
the new state of the CLA (an environmental rule). Afterwards,
and to express complicated behavioral patterns [25]. The time
the entire learning automata update their probability function
goes discrete and the cells update their states synchronously ac-
based on the amount of received rewards or penalties. In the next
cording to a local rule. The present state of each cell depends on
step, the same process is repeated except that the probability of
the previous states of a set of cells, including the cell itself, and
choosing a particular action is increased more than the others for
constitutes its neighborhood [26]. A cell is called a neighboring
each automaton. By repeating the algorithm for several times,
of another cell if they can affect each other in a period of time
convergence to the optimal solution is achieved [24]–[26].
[25].
Cellular automata can be reinforced by learning automata to
be used as a powerful mathematical model for various problems IV. SOLUTION APPROACH
[26]. Learning automata are adaptive decision-making units CLA is a robust algorithm, established on a network struc-
which select their current action based on past experiences ture, where its cells cooperate to achieve a unique aim [25],
earned from the environment. Their performances are im- [28]. Hence, it can easily be adapted to the transmission net-
proved by learning how to choose the best action from a finite work and PMU placement problem. In CLA, state of each cell
set of allowed actions through repeated interactions with their depends on the state of neighboring cells. Similarly, in the PMU
environment [24]. placement problem, installing a PMU at a bus depends on the
Automata are guided to the optimal actions considering in- state of neighboring buses. Therefore, a CLA based algorithm
teractions between automata and the adaptive unit, which is is completely consistent with the PMU placement problem, as it
called random environment. Fig. 1 illustrates how a stochastic structurally emulates the PMU placement problem. Moreover,
automaton works in feedback connected with a random envi- implementing the proposed reliability model needs to create a
ronment. Accordingly, an action is chosen at random based on a set of sub-graphs which are similar to the neighboring
probability distribution kept over the action-set. Then, the given cells of each automaton. Therefore, the CLA based algorithm
action is sent as the input to the random environment. The en- reduces the computational burden while solving the PMU place-
vironment responds the listed actions proportional to reinforce- ment problem. Moreover, the CLA algorithm has been used for
ment signals, and the action probability vector is updated con- solving various problems so far and satisfactory results were
sidering feedback from the environment [24]–[26]. Prevalent reported [26]–[31]. According to the above discussion, in this
learning automata try to find the optimal actions, so that average paper the PMU placement problem is modeled through CLA;
penalty received from the environment is minimized. The objec- though it could also be solved using other evolutionary algo-
tive of a learning automaton can be changed by maximizing av- rithms.
erage reward received from the environment or other multi-ob- Each network bus is considered as a cell which reinforced
jective approaches [25]. by an automaton. The motivations behind employing
This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination.
Fig. 2. Neighboring lines of a CLA cell and CLA local rules. (a) First CLA local rule. (b) Second CLA local rule. (c) Third CLA local rule.
the automata are as follows: As it is mathematically • If the cell action equals to the previous actions of some
proven that the automata are “ -optimal” [24], [25], of its neighbors, and if none have changed their actions,
enlisting proper learning rate guarantees the achievement of the the reward or penalty is based on local rule. This is
optimal solutions [32]. Moreover, the significant performance schematically shown in Fig. 2(c).
of the learning algorithms illustrated in (14)–(15) for the
automata is reported in several studies [26]–[33]. If a cell action has not received any reward or penalty by ap-
Each automaton contains two allowed actions: expressing a plying the local rules, it does not receive any secondarily reward
PMU to either be installed in the cell or not. Environmental or penalty.
rule is defined based on (1) and all members of the set It must be noted that CLA local rules change in a wide range
are assumed as neighbors of the bus (CLA cell) . Local rules and could be changed according to the problem statement. Nev-
which show local improvement of neighboring cells is achieved ertheless, the aim of these rules is to prepare a suitable way to
by applying (1) to the set of neighboring buses and neighboring give reward or penalty to an action in which the cell be able
lines which are defined as follows: to find the optimal action through repeated interactions with its
neighbors and the environment. Accordingly, these rules are not
(16) limited to the above mentioned ones, and new rules can be of-
fered and tested. A set of CLA local rules and their applications
are investigated in [25]–[31]. Moreover, [33] presents a set of
Neighboring lines for a simple case is shown in Fig. 2. Ac- publications regarding cellular automata, learning automata and
cordingly, in any iteration, CLA cells select proper actions based the CLA.
on their actions probability vector. Then, the observability func-
tion is determined for all buses using (10)–(12) in a pseudo- V. NUMERICAL STUDIES AND RESULTS
repetitive procedure. Afterwards, objective function of the PMU
placement problem is calculated using (1). If the current CLA Aimed at solving the problem of PMU placement by the pro-
status improved the objective function, the response sent from posed method, software is developed within a user-friendly en-
the environment is positive and all the selected actions are pri- vironment. The user can see the results by providing the GIS
marily rewarded, otherwise penalized. Then, CLA local rules ready map (or presenting complete network information) and
are investigated for each cell using (1) and (16). According to entering technical and economic data. To evaluate the perfor-
the local rules, the CLA cell is again rewarded or penalized. By mance of the proposed method, the problem is solved for IEEE
repeating the mentioned process for several times, the algorithm standard test systems [34] as well as for the Iranian 230- and
converges to the optimal solution. In this paper, the CLA local 400-kV transmission networks [35] and compared to that of
rules are defined as follows: previous research. The technical specifications of the computer
• If the present action of a cell differs to that of the previous used for simulations are Centrino 1.8-GHz CPU with a 1 GB of
one: RAM.
• If the cell action differs to that of the previous actions of
some of its neighbors, and if at least one action among its A. First Scenario
neighbors equals to that of the cell previous action, the In this scenario the solution is conducted for the IEEE stan-
reward or penalty is based on local rule. Thus, if local dard test systems, and the obtained results are compared to those
rule is improved, the cell action is rewarded, otherwise of previous research.
penalized. This is schematically shown in Fig. 2(a). As it can be seen in Table I, the proposed method could
• If the cell action equals to that of all previous actions achieve the best existing solution from the minimization of
of its neighbors, and if the number of neighbors which PMU numbers viewpoint. Moreover, as shown in Table II, in
have changed their action is more than those that have comparison with the previous methods, the proposed solution
not changed, the reward or penalty is based on local rule. has improved the measurement redundancy for the 30-bus test
This is schematically shown in Fig. 2(b). system (19%). Accordingly, the second term of (1) which is
added to the objective function to find the maximum measure-
• If the present action of a cell equals to the previous one: ment redundancy has improved the obtained solutions. The
This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination.
TABLE I
OBTAINED RESULTS OF THE PMU PLACEMENT FOR IEEE STANDARD TEST SYSTEMS
TABLE II
COMPARISON OF OBTAINED RESULTS BY SEVERAL METHODS FOR IEEE STANDARD TEST SYSTEMS
TABLE III
PMU PLACEMENT IN PRESENCE OF NON-SYNCHRONOUS CONVENTIONAL MEASUREMENTS FOR IEEE 57-BUS TEST SYSTEM
TABLE IV
PMU PLACEMENT UNDER SINGLE CONTINGENCY FOR IEEE 57-BUS TEST SYSTEM
TABLE V
PMU PLACEMENT CONSIDERING WORTH OF STATE ESTIMATION UNDER CONTINGENCIES FOR IEEE 57-BUS TEST SYSTEM
C. Third Scenario plus PMU costs are set equal to 5 , 2 and 5000 (US$),
In this scenario, PMU placement is conducted under single respectively. Disturbance rate of transmission lines is assumed
contingencies including line outages and loss of PMUs [14]. In twice of the failure rate.
order to meet the full observability under single line outages, As it can be seen in Tables IV and V, while total number of
no line must be unobservable when a line is out. Hence, the set PMUs in normal condition is 11, 19 PMUs are needed to cover
of in (7) should be null for the entire line outages, which the single line outage condition [14]. However, the proposed
leads to . To do so, the monetary factor of observability contingency approach needs 12 PMUs for line outage condi-
value of each line is set equal to a very large number . tion. According to this table, almost similar results are achieved
By minimizing the objective function (1), the optimization al- for other contingences including single PMU losses and simul-
gorithm tends to choose the layouts in which to de- taneous line and PMU outages. In addition, while disturbance
crease the fitness level. In addition, since the algorithm does not worth is doubled, total required PMUs are increased almost
tackle with the PMU outages, the is set equal to zero. Sim- 29%. Based on this Table, since the PMUs are located in almost
ilarly, to meet the full observability under single loss of PMUs, half of network buses, it seems that excessive PMUs are needed
is set to zero and . The mentioned model is con- through contingency PMU placement. On the other hand,
ducted on the IEEE 57-bus test system and obtained results are the proposed contingency approach has proposed more reason-
compared to those of [14]. As it can be seen in Table IV, the able solutions in which worth of network disturbances is partic-
total number of required PMUs under single contingencies is ipated in PMU placement during contingencies.
reported, beside average measurement redundancies. As shown
D. Fourth Scenario
in the first row of this table that the CLA solution requires 19
PMUs under single line outages which is the same as the re- In this scenario, the PMU placement problem is investigated
sult reported in [14] from the number of PMUs point of view. for real Iranian 230- and 400-kV transmission network. The Ira-
However, the proposed algorithm has improved the measure- nian transmission grids are highly interconnected and managed
ment redundancy by 8% which demonstrates the performance by 16 regional utilities owned by a holder state owned company
of the second term of (1). Moreover, the second row of Table IV (Tavanir).
compares the CLA results with those of [14] under single loss The 230- and 400-kV transmission lines have roughly lengths
of PMUs. According to these results, while the CLA proposed a of 24 000 and 15 000 km, respectively, all of them monitored
solution with 25 PMUs, the associated result in [14] requires 26 by Tavanir. The under-study network which is shown in Fig. 4,
PMUs. In addition, the CLA solution has better measurement re- contains 242 buses and 364 corridors. While contingency data
dundancy (5%). Hence, the proposed model has achieved better are set the same as third scenario, complete data listing can be
solution for single loss of PMUs which shows the quality of the found in [35].
CLA algorithm form the optimization viewpoint. Moreover, the Obtained results are shown in Tables VI and VII. As it can be
comparisons presented in Tables II and IV illustrate that the pro- seen, while the under-study network needs 71 PMUs in normal
posed worth of state estimation formulated in (6) and (7) results condition, required PMUs are increased almost 35% to cover
proper solutions under boundary conditions. the contingencies. In addition, sensitivity analysis presented in
In order to investigate the PMU placement under the pro- Table VIII shows that in the most critical condition in which dis-
posed contingency model, the problem is conducted for the turbances worth are quadrupled comparing to normal condition,
same test case and obtained results are presented in Table V. almost 58% of network buses need PMU. On contrary, while
For this reason, rate of line outages and rate of PMU losses are disturbances worth are set as normal condition, required PMUs
set equal to 0.08 (fr/year/km) and 20 (fr/year), respectively. are increased almost 35% comparing to normal operation. This
In addition, average fault clearance time for lines and PMUs shows that exact values of disturbance worth are required for
This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination.
TABLE VI
OBTAINED RESULTS OF PMU PLACEMENT FOR THE IRANIAN 230- AND 400- KV TRANSMISSION NETWORK
TABLE VII
OBTAINED RESULTS OF PMU PLACEMENT FOR THE IRANIAN 230- AND 400-KV TRANSMISSION NETWORK UNDER VARIOUS WORTH OF CONTINGENCIES
Fig. 5. Trajectory of best solution for the BPSO, CLA, and GA.
E. Fifth Scenario
In learning automata-based algorithms, choosing the proper
learning rate is the most challenging issue. However, from
optimal planning. Hence, the authors propose that PMU place- the learning automata theory, it is concluded that solution
ment be studied in two phases for practical networks: In the first optimality is inversely proportional to the learning rate [24],
phase, PMU placement by the proposed approach be investi- [25]. Although, it is common to assume in
gated using . Then, PMUs be installed throughout the this sort of problems [24]–[28], for confidence, IEEE standard
network considering results of the first phase. Afterwards, net- test systems which are investigated in [9] are assumed. Then,
work disturbances are stored during state estimation for a period the percentage of the converged runs (PCR) to the expected
of time. In the second phase, the problem would be conducted by results (or better than them) for different values of learning
the proposed approach using actual worth of disturbances based rate is calculated for 100 independent runs. Table IX shows
on obtained information of real operational periods. Final output the obtained results. In this table, (LR) is the learning rate,
of the mentioned phases leads to a PMUs placement which has (PRT) is running time of the algorithm which is divided by the
optimal performance in both normal and contingency situations. maximum running time of the algorithm when and
(PSR) is the algorithm sampling rate which is divided by the
In order to investigate optimality of the CLA solutions for the maximum sampling rate of the algorithm when . It
Iranian transmission grid, the proposed objective function of (1) can be observed that the proposed algorithm always converges
is minimized by means of a binary particle swarm optimization to the minimal solution if the learning rate set to .
This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination.
TABLE IX
PERFORMANCE EVALUATION OF THE PROPOSED ALGORITHM FOR DIFFERENT LEARNING RATES
TABLE X
SENSITIVITY ANALYSIS OF THE PROPOSED CLA LOCAL RULES FOR THE IRANIAN 230- AND 400-KV TRANSMISSION NETWORK
[16] R. F. Nuqui and A. G. Phadke, “Phasor measurement unit placement Seyed Mahdi Mazhari (S’12) received the B.S.
techniques for complete and incomplete observability,” IEEE Trans. (Hon.) degree from the University of Birjand, Bir-
Power Del., vol. 20, no. 4, pp. 2381–2388, Oct. 2005. jand, Iran, in 2010 and the M.S. (Hon.) degree from
[17] J. Chen and A. Abur, “Placement of PMUs to enable bad data detec- the University of Tehran, Tehran, Iran, 2012, both in
tion in state estimation,” IEEE Trans. Power Syst., vol. 21, no. 4, pp. electrical engineering.
1608–1615, Nov. 2006. Currently, he is working as a research associate at
[18] B. Xu and A. Abur, “Observability analysis and measurement place- the research Center of power system operation and
ment for system with PMUs,” in Proc. IEEE Power Syst. Conf. Expo., planning studies, University of Tehran. His research
Oct. 2004, vol. 2, pp. 943–946. interest includes planning of the electric power distri-
[19] S. Almeida, R. Pestana, and F. M. Barbosa, “Severe contingencies bution and transmission systems, power system oper-
analysis in Portuguese transmission system,” in Proc. 41st Universi- ation, and artificial intelligence applications to power
ties Power Engineering Int. Conf., 2006, pp. 462–466. system optimization problems.
[20] Y. Sun and T. J. Overbye, “Visualizations for power system contin-
gency analysis data,” IEEE Trans. Power Syst., vol. 19, no. 4, pp.
1859–1866, Nov. 2004.
[21] B. L. Silverstein and D. M. Porter, “Contingency ranking for bulk Hassan Monsef received the B.Sc. degree from
system reliability criterion,” IEEE Trans. Power Syst., vol. 7, no. 3, Sharif University of Technology, Tehran, Iran,
pp. 956–964, Aug. 1992. in 1986, the M.Sc. degree with honor from the
[22] F. Aminifar, M. Fotuhi-Firuzabad, M. Shahidehpour, and A. Khodaei, University of Tehran in 1989, and the Ph.D. degree
“Observability enhancement by optimal PMU placement considering from Sharif University of Technology in 1996, all in
random power system outages,” Energy Syst., no. 2, pp. 45–65, 2011. power engineering.
[23] E. M. Carreno, R. M. Rochaand, and A. Padilha-Feltrin, “A cellular He has been with the University College of En-
automaton approach to spatial electric load forecasting,” IEEE Trans. gineering, School of Electrical and Computer Engi-
Power Syst., vol. 26, no. 2, pp. 532–540, May 2011. neering, University of Tehran, since 1996, where he
[24] K. S. Narendra and K. S. Thathachar, Learning Automata: An Intro- currently is an Associate Professor. His research in-
duction. New York: Printice-Hall, 1989. terests are power system operation under deregula-
[25] M. R. Meybodi and H. Beigy, “A mathematical framework for cellular tion, reliability of power system, power systems economics, renewable energy
learning automata,” J. Adv. Complex Syst., vol. 7, no. 3, pp. 295–320, systems, and its integration in smart grid.
2004.
[26] J. A. Torkestani and M. R. Meybodi, “A cellular learning automata-
based algorithm for solving the vertex coloring problem,” Expert Syst.
Appl., vol. 38, pp. 9237–9247, 2011.
[27] A. Enami-Eraghi, J. Akbari-Torkestani, M. R. Meybodi, and A. H. Hamid Lesani received the M.S. degree in power
Fathy-Navid, “Cellular learning automata-based channel assignment engineering from the University of Tehran, Tehran,
algorithms for wireless mobile ad hoc networks,” in Proc. Int. Conf. Iran, in 1975 and the Ph.D. degree in electrical en-
Machine Learning and Computing, 2011, pp. 173–177. gineering from the University of Dundee, Dundee,
[28] M. Saheb-Zamani, F. Mehdipour, and M. R. Meybodi, “Implementa- U.K., in 1987.
tion of cellular learning automata on reconfigurable computing sys- Then, he joined the Department of Electrical and
tems,” in Proc. Canadian Conf. Electrical and Computer Engineering, Computer Engineering, University of Tehran, where
2003, vol. 2, pp. 1139–1142. he currently serves as a Professor at the Center of Ex-
[29] H. Beigy and M. R. Meybodi, “Cellular learning automata with mul- cellence for Control and Intelligent Processing. His
tiple learning automata in each cell and its applications,” IEEE Trans. teaching and research interests is focused on design
Syst., Man, Cybern., vol. 40, no. 1, pp. 54–65, 2010. and modeling of electrical machines and power sys-
[30] H. Beigy and M. R. Meybodi, “A self-organizing channel assignment tems.
algorithm: A cellular learning automata approach,” Intell. Data Eng. Prof. Lesani is a member of the IEEE PES and the IEEE Iran Section.
Autom. Learn., vol. 26, no. 90, pp. 119–126, 2003.
[31] R. Rastegar and M. R. Meybodi, “A new evolutionary computing
model based on cellular learning automata,” in Proc. IEEE Conf.
Cybernetics and Intelligent Systems, 2004, vol. 1, pp. 433–438. Alireza Fereidunian (M’08) received the M.Sc. and
[32] C. Ünsal, “Intelligent navigation of autonomous vehicles in an auto- Ph.D. degrees from the University of Tehran, Tehran,
mated highway system: Learning methods and interacting vehicles ap- Iran, in 1997 and 2009, respectively.
proach,” Ph.D. dissertation, Virginia Polytechnic Institute and State He is an Assistant Professor at the K. N. Toosi
University, Blacksburg, Virginia, 1996. University of Technology, Tehran. He is a Post-Doc-
[33] [Online]. Available: http://ce.aut.ac.ir/~meybodi/index.htm#publica- toral Research Associate at the University of Tehran.
tion. His research interests include Smart Grid, energy
[34] R. Christie, Power System Test Archive, Aug. 1999. [Online]. Avail- distribution systems, and application of IT and AI
able: http://www.ee.washington.edu/research/pstca. in power systems. Moreover, he works in complex
[35] [Online]. Available: http://mazhariac.persiangig.com/. systems, systems reliability and human-automation
[36] M. Hajian, A. M. Ranjbar, T. Amraee, and B. Mozafari, “Optimal interactions areas, where he has invented the Adap-
placement of PMUs to maintain network observability using a modi- tive Autonomy Expert System (AAES).
fied BPSO algorithm,” Int. J. Elect. Power Energy Syst., vol. 33, no. Dr. Fereidunian is an IEEE-SMC-HCI TC member and a member of INCOSE
1, pp. 28–34, 2011. (as INCOSE Iran point of contact).