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

Slides:



Advertisements
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.
Advertisements

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
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 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.
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.
Multiobjective VLSI Cell Placement Using Distributed Simulated Evolution Algorithm Sadiq M. Sait, Mustafa I. Ali, Ali Zaidi.
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.
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.
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.
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 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.
Integration of Large-Scale RES in Island Power Systems Prof. Nikos Hatziargyriou, National Technical University of Athens
EE 369 POWER SYSTEM ANALYSIS
Costs of Ancillary Services & Congestion Management Fedor Opadchiy Deputy Chairman of the Board.
Computational Stochastic Optimization: Bridging communities October 25, 2012 Warren Powell CASTLE Laboratory Princeton University
© Negnevitsky, Pearson Education, CSC 4510 – Machine Learning Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University.
Efficient Model Selection for Support Vector Machines
Optimization for Operation of Power Systems with Performance Guarantee
Branch Outage Simulation for Contingency Studies Dr.Aydogan OZDEMIR, Visiting Associate Professor Department of Electrical Engineering, Texas A&M University,
1 11 Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks Gautam Kulkarni, Sachin Adlakha, Mani Srivastava UCLA IEEE Transactions.
Frankfurt (Germany), 6-9 June 2011 Pyeongik Hwang School of Electrical Engineering Seoul National University Korea Hwang – Korea – RIF Session 4a – 0324.
Search Methods An Annotated Overview Edward Tsang.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
PSO and its variants Swarm Intelligence Group Peking University.
FINAL EXAM SCHEDULER (FES) Department of Computer Engineering Faculty of Engineering & Architecture Yeditepe University By Ersan ERSOY (Engineering Project)
Leader-Follower Framework For Control of Energy Services Ali Keyhani Professor of Electrical and Computer Engineering The Ohio State University
EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Kasin Prakobwaitayakit Department of Electrical Engineering Chiangmai University.
January 21, 2010 Security Constrained Economic Dispatch Resmi Surendran.
Simulation in Wind Turbine Vibrations: A Data Driven Analysis Graduate Students: Zijun Zhang PI: Andrew Kusiak Intelligent Systems Laboratory The University.
© Negnevitsky, Pearson Education, Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Introduction,
Learning by Simulating Evolution Artificial Intelligence CSMC February 21, 2002.
Managing a Power System with 40% Wind Dr Alan Rogers EirGrid.
/ 26 Evolutionary Computing Chapter 8. / 26 Chapter 8: Parameter Control Motivation Parameter setting –Tuning –Control Examples Where to apply parameter.
METAHEURISTICS Genetic Algorithm Jacques A. Ferland Department of Informatique and Recherche Opérationnelle Université de Montréal
For Wednesday Read chapter 6, sections 1-3 Homework: –Chapter 4, exercise 1.
For Wednesday Read chapter 5, sections 1-4 Homework: –Chapter 3, exercise 23. Then do the exercise again, but use greedy heuristic search instead of A*
New Opportunities for Control and Optimization in the Future Power Industry Environment Chen-Ching Liu University of Washington.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
2/29/20121 Optimizing LCLS2 taper profile with genetic algorithms: preliminary results X. Huang, J. Wu, T. Raubenhaimer, Y. Jiao, S. Spampinati, A. Mandlekar,
Optimal Delivery of Items in a Computer Assisted Pilot Francis Smart Mark Reckase Michigan State University.
Nonsmooth Optimization for Optimal Power Flow over Transmission Networks GlobalSIP 2015 Authors: Y. Shi, H. D. Tuan, S. W. Su and H. H. M. Tam.
Final Exam Review CS479/679 Pattern Recognition Dr. George Bebis 1.
Preliminary Background Tabu Search Genetic Algorithm.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
IE-OR Seminar April 18, 2006 Evolutionary Algorithms in Addressing Contamination Threat Management in Civil Infrastructures Ranji S. Ranjithan Department.
The Impact of Intermittent Renewable Energy Sources on Wholesale Electricity Prices Prof. Dr. Felix Müsgens, Thomas Möbius USAEE-Conference Pittsburgh,
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Selection Methods Choosing the individuals in the population that will create offspring for the next generation. Richard P. Simpson.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Energy Storage Modeling for Distribution Planning Roger C. Dugan Jason A. Taylor Davis Montenegro EPRI.
| Vasilis Zois USC 1. |  Dynamic and sophisticated demand control – Direct control over household appliances  Curtailment Reasons – Reactive Curtailment.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Particle Swarm Optimization (2)
Digital Optimization Martynas Vaidelys.
Who cares about implementation and precision?
Comparing Genetic Algorithm and Guided Local Search Methods
Standard Optimization Techniques
Boltzmann Machine (BM) (§6.4)
Searching by Constraint & Searching by Evolution
Presentation transcript:

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

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.

The hybrid variant: MVMO-SH 3

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

MVMO-SH: solution archive 5

MVMO-SH: parent selection 6

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)

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

MVMO-SH: mutation based on mapping function x i x i * 10 (2)(2) (3)(3) (4)(4)

MVMO-SH: mapping function features 10

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)

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

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

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

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

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

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 Max Mean Std

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

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

Identification of dynamic equivalent 20 Optimization & Dynamic simulation

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

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

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

Online optimal control of reactive sources 24

Online optimal control of reactive sources 25

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

Highlights 27 1.Winner of the competition on Expensive optimization at CEC-2014, Beijing, PR-China, 6-11 July th out of 17 place in the competition on real-parameter single Objective optimization at CEC-2014, Beijing, PR-China, 6-11 July th out of 21 place in the real-parameter single Objective optimization at CEC-2013, Cancun, Mexico June 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 (

28 Thanks! Dr. José L. Rueda

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

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