Presentation is loading. Please wait.

Presentation is loading. Please wait.

Mean-Variance Mapping Optimization Current developmental status and application to power system problems Dr. –Ing. José L. Rueda 9 September 2014 1.

Published byWillis Allison Modified over 9 years ago

Similar presentations

Presentation on theme: "Mean-Variance Mapping Optimization Current developmental status and application to power system problems Dr. –Ing. José L. Rueda 9 September 2014 1."— Presentation transcript:

1 Mean-Variance Mapping Optimization Current developmental status and application to power system problems Dr. –Ing. José L. Rueda 9 September 2014 1

2 Rationale behind MVMO 2  Introduced by I. Erlich (University Duisburg- Essen, Germany ) in 2010  Internal search range of all variables restricted to [0, 1].  Solution archive: knowledge base for guiding the searching direction.  Mapping function: Applied for mutating the offspring on the basis of the mean and variance of the n-best population attained so far.

3 The hybrid variant: MVMO-SH 3

4 MVMO-SH: launching local search 4 (1) : local search probability, e.g. Local search performed according to Different methods can be used:  Classical: Interior-Point Method (IPM)  Heuristic: Hill climbing, evolutionary strategies where D: Problem dimension

5 MVMO-SH: solution archive 5

6 MVMO-SH: parent selection 6

7 MVMO-SH: selection of dimensions for mutation 7 8 Two different strategies are available: a)The full range corresponds with the number of mutated variables, e.g. m =7 b)The number of mutated variables estimated randomly in the given range, e.g. m = irand(7)

8 MVMO-SH: selection of dimensions for mutation 8 8 Random-sequential selection mode

9 MVMO-SH: mutation based on mapping function 9 8 0 1 01 x i x i * 10 (2)(2) (3)(3) (4)(4)

10 MVMO-SH: mapping function features 10

11 MVMO-SH: assignment of shape and d-factors 11 d r is always oscillating around the shape s r and is set to 1 in the initialization stage  d 0  0.4  d = The d-factors remain dynamic with the mapping even the corresponding shape doesn’t change (5)(5)

12 MVMO-SH: assignment of shape and d-factors 12 (5)(5) CEC2013 function F1, single particle MVMO without local search, fs=1.0,  d 0 =0.15

13 Application to power system problems 13 1.Optimal reactive power dispatch 2.Identification of power system dynamic equivalent 3.Online optimal control of reactive sources

14 Optimal Reactive Power Dispatch 14 Minimize (16) (17) (19) Losses subject to (18) (20) (21) (22) (23) Operational constraints

15 Optimal Reactive Power Dispatch 15 IEEE 118 bus system 77 dimensions (54 gen, 9 OLTCs, 14 compensators)

16 Optimal Reactive Power Dispatch 16 IEEE 118 bus system : Average convergence performance

17 Optimal Reactive Power Dispatch 17 IEEE 118 bus system : Statistics of active power losses P loss (MW) Algorithms MVMO S MVMOCLPSOSPSOUPSOFDRPSO DMS- PSO-HS DEJADE-vPS Min 117.0802117.0074120.2117121.8049123.1174119.1387123.4717118.7199118.1047 Max 118.1662125.1501132.0461125.4654130.2011123.5461128.5504121.1128120.2177 Mean 117.4251119.3353122.2499123.6784125.6709121.6536125.0562119.7737118.9533 Std. 0.22851.93862.05330.91451.76631.05011.20330.62890.5321

18 Identification of dynamic equivalent 18 Ecuador-Colombia interconnected system 320 buses -- 64 generators 3.23 GW installed capacity 2.66 GW peak load Ecuador (study area) 1729 buses -- 109 generators 11.08 GW installed capacity 8.78 GW peak load Colombia (external area) 22 dimensions (reactances, gains, time constants) Opt. problem

19 Identification of dynamic equivalent 19 Dynamic equivalent for Colombia 22 dimensions (Reactances, gains, time constants) Optimization problem - Sixth order generator model - AVR model - Governor model

20 Identification of dynamic equivalent 20 Optimization & Dynamic simulation

21 Identification of dynamic equivalent 21 Parameter identification problem statement Minimize subject to From PMU or simulations System with component model to be identified Parameters of the model

22 Identification of dynamic equivalent 22 DE for Colombia: comparison of heuristic methods

23 Identification of dynamic equivalent 23 DE for Colombia: comparison of dynamic responses Fault 1 Fault 2 Full system model With DE

24 Online optimal control of reactive sources 24

25 Online optimal control of reactive sources 25

26 Other applications to power system problems 26 1.Active-reactive power dispatch 2.Short-term transmission planning 3.Location and tuning of damping controllers 4.Optimal transmission pricing 5.Optimal allocation and sizing of dynamic Var sources

27 Highlights 27 1.Winner of the competition on Expensive optimization at CEC-2014, Beijing, PR-China, 6-11 July 2014. 2.4 th out of 17 place in the competition on real-parameter single Objective optimization at CEC-2014, Beijing, PR-China, 6-11 July 2014. 3.6 th out of 21 place in the real-parameter single Objective optimization at CEC-2013, Cancun, Mexico 21-23 June 2013. 4.Used for benchmarking in 2014 Competition on OPF problems organized by the Working Group on Modern Heuristic Optimization (WGMHO) under the IEEE PES Power System Analysis, Computing, and Economics Committee (https://www.uni-due.de/ieee-wgmho/)https://www.uni-due.de/ieee-wgmho/

28 28 Thanks! Dr. José L. Rueda J.L.RuedaTorres@tudelft.nl http://www.uni-due.de/mvmo/

29 MVMO-SH: parent selection 29 GoodBad All particles ranked according to their local best (2)(2) (3) (4)(4)

30 MVMO-SH: parent selection 30 (6)(6) (5) Alternatively: (7)(7) (8)(8)

Download ppt "Mean-Variance Mapping Optimization Current developmental status and application to power system problems Dr. –Ing. José L. Rueda 9 September 2014 1."

Similar presentations

Empirical Algorithmics Reading Group Oct 11, 2007 Tuning Search Algorithms for Real-World Applications: A Regression Tree Based Approach by Thomas Bartz-Beielstein.

Empirical Algorithmics Reading Group Oct 11, 2007 Tuning Search Algorithms for Real-World Applications: A Regression Tree Based Approach by Thomas Bartz-Beielstein.
Constraint Optimization We are interested in the general non-linear programming problem like the following Find x which optimizes f(x) subject to gi(x)

Constraint Optimization We are interested in the general non-linear programming problem like the following Find x which optimizes f(x) subject to gi(x)
Hadi Goudarzi and Massoud Pedram

Hadi Goudarzi and Massoud Pedram
Neural and Evolutionary Computing - Lecture 4 1 Random Search Algorithms. Simulated Annealing Motivation Simple Random Search Algorithms Simulated Annealing.

Neural and Evolutionary Computing - Lecture 4 1 Random Search Algorithms. Simulated Annealing Motivation Simple Random Search Algorithms Simulated Annealing.
Parameter control Chapter 8. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Parameter Control in EAs 2 Motivation 1 An EA has many.

Parameter control Chapter 8. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Parameter Control in EAs 2 Motivation 1 An EA has many.
Parameter Control A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Chapter 8.

Parameter Control A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Chapter 8.
Network Structure in Swing Mode Bifurcations u Motivation & Background –Practical Goal: examine loss of stability mechanisms associated w/ heavily loaded.

Network Structure in Swing Mode Bifurcations u Motivation & Background –Practical Goal: examine loss of stability mechanisms associated w/ heavily loaded.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.

Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
CPSC 322, Lecture 15Slide 1 Stochastic Local Search Computer Science cpsc322, Lecture 15 (Textbook Chpt 4.8) February, 6, 2009.

CPSC 322, Lecture 15Slide 1 Stochastic Local Search Computer Science cpsc322, Lecture 15 (Textbook Chpt 4.8) February, 6, 2009.
Multiobjective VLSI Cell Placement Using Distributed Simulated Evolution Algorithm Sadiq M. Sait, Mustafa I. Ali, Ali Zaidi.

Multiobjective VLSI Cell Placement Using Distributed Simulated Evolution Algorithm Sadiq M. Sait, Mustafa I. Ali, Ali Zaidi.
Dynamic Tuning of the IEEE 802.11 Protocol to Achieve a Theoretical Throughput Limit Frederico Calì, Marco Conti, and Enrico Gregori IEEE/ACM TRANSACTIONS.

Dynamic Tuning of the IEEE Protocol to Achieve a Theoretical Throughput Limit Frederico Calì, Marco Conti, and Enrico Gregori IEEE/ACM TRANSACTIONS.
Fuzzy Simulated Evolution for Power and Performance of VLSI Placement Sadiq M. Sait Habib Youssef Junaid A. KhanAimane El-Maleh Department of Computer.

Fuzzy Simulated Evolution for Power and Performance of VLSI Placement Sadiq M. Sait Habib Youssef Junaid A. KhanAimane El-Maleh Department of Computer.
1 An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem Matthew Streeter & Stephen Smith Carnegie Mellon University NESCAI, April 29 2006.

1 An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem Matthew Streeter & Stephen Smith Carnegie Mellon University NESCAI, April
Department of Engineering, Control & Instrumentation Research Group 22 – Mar – 2006 Optimisation Based Clearance of Nonlinear Flight Control Laws Prathyush.

Department of Engineering, Control & Instrumentation Research Group 22 – Mar – 2006 Optimisation Based Clearance of Nonlinear Flight Control Laws Prathyush.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.

A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
21st European Conference on Operational Research Algorithms for flexible flow shop problems with unrelated parallel machines, setup times and dual criteria.

21st European Conference on Operational Research Algorithms for flexible flow shop problems with unrelated parallel machines, setup times and dual criteria.
Fast Evolutionary Optimisation Temi avanzati di Intelligenza Artificiale - Lecture 6 Prof. Vincenzo Cutello Department of Mathematics and Computer Science.

Fast Evolutionary Optimisation Temi avanzati di Intelligenza Artificiale - Lecture 6 Prof. Vincenzo Cutello Department of Mathematics and Computer Science.
Evolutionary Computational Intelligence Lecture 8: Memetic Algorithms Ferrante Neri University of Jyväskylä.

Evolutionary Computational Intelligence Lecture 8: Memetic Algorithms Ferrante Neri University of Jyväskylä.
Evolutionary Computation Application Peter Andras peter.andras/lectures.

Evolutionary Computation Application Peter Andras peter.andras/lectures.
Fuzzy Evolutionary Algorithm for VLSI Placement Sadiq M. SaitHabib YoussefJunaid A. Khan Department of Computer Engineering King Fahd University of Petroleum.

Fuzzy Evolutionary Algorithm for VLSI Placement Sadiq M. SaitHabib YoussefJunaid A. Khan Department of Computer Engineering King Fahd University of Petroleum.

Similar presentations

Ads by Google