Modern Optimisation Techniques and Their Applications to Simulation driven Engineering Design Automation

Size: px
Start display at page:

Download "Modern Optimisation Techniques and Their Applications to Simulation driven Engineering Design Automation"

Transcription

1 Modern Optimisation Techniques and Their Applications to Simulation driven Engineering Design Automation Bo Liu Department of Computing, Glyndwr University, UK

2 Outline Simulation driven design optimisation and challenges Surrogate model assisted evolutionary algorithms (SAEAs) The surrogate model aware search framework SAEAs based on multi fidelity simulation Handling design robustness Conclusions

3 Engineering Design Integrated circuit Design variables: W, L of each transistor, Cc Antenna For the goal of (such as): Aerospace Automobile Process engineering They are optimisation problems

4 Simulation Driven Design Optimisation No time to derive analytical formulas Too complex to derive analytical formulas Need a method which can provide optimised design solutions without deeply studying the engineering design problem Numerical simulation + simulation driven optimisation!

5 Design Optimisation Methods: Case Study CST Optimiser help file

6 Local and Global Optimisation (1) local optimisation global optimisation search space / range

7 Local and Global Optimisation (2) Local optimisation (SQP, NM simplex): Advantages: efficient if there is a good initial design Drawbacks: ad hoc (a good starting point) and less optimal Global optimisation (GA, DE, PSO): Advantages: general, highly optimal, robust Why not using global optimisation methods all the time? Because numerical simulations are often computationally expensive, the simulation driven optimisation process leads to prohibitive time!

8 Case Study Efficiency! Example: On chip antenna design optimisation (standard DE): EM simulation for a candidate design: 10 minutes by ADS Momentum Convergence: 800 generations Population size: 40 10min x 40 x 800 = 7 months!!! B. Liu, H. Aliakbarian, Z.Ma, G. Vandenbosch, G. Gielen, "An Efficient Method for Antenna Design Optimization Based on Evolutionary Computation and Machine Learning Techniques", IEEE Transactions on Antennas & Propagation, vol. 62, no. 1, pp. 7-18, 2014.

9 A Major Challenge of Simulation driven Design Optimisation Global optimisation algorithms often need several thousands of simulations to achieve highly optimised solutions for many engineering design optimisation problems with around 20 design variables. New optimisation techniques are highly needed, which is able to: Provide highly optimised designs (much better than manual design, comparable to using standard global optimisation methods) In a practical timeframe

10 Outline Simulation driven design optimisation and challenges Surrogate model assisted evolutionary algorithms (SAEAs) The surrogate model aware search framework SAEAs based on multi fidelity simulation Handling design robustness Conclusions

11 Evolutionary Computation (EC) Evolutionary computation is a computational intelligence method for optimisation EC is based on natural selection, survival of the fittest (objective function) Different global optimisation algorithms: GA, DE, PSO, IA, AC EA has strengths on black box (no derivatives) and multimodal (more than 1 local optima) problems

12 Differential Evolution Xˆ () t [ x, x,, x ] i 1, 2,, NP i,1 i,2 i, M Diversity vs. Optimality? u i, j ( t 1) v ( t 1), if ( rand( j) CR) or j randn( i), i, j x ( t), otherwise, j 1, 2,, M i, j

13 Solutions to the efficiency problem Efficiency enhancement Evolutionary algorithms Change the optimiser Speed up the simulation Use fewer simulations SAEA

14 Introduction to SAEA Surrogate model assisted evolutionary algorithm (SAEA): Using surrogate models to replace exact function evaluations Statistical learning Computationally cheap

15 Surrogate Modeling Surrogate modeling: Gaussian Process / Kriging (GP) Artificial neural network (ANN) Support vector machine (SVM) Radial basis function (RBF) Response surface method (RSM) Wrong convergence!!

16 Model Management Surrogate model predictions have error and have to be corrected by simulations Surrogate model and simulations are connected, because the surrogate model is constructed by the samples obtained by simulations How to cleverly use surrogate model prediction and simulation (related to surrogate model construction)? Who should be used for simulation?

17 Model Management (pioneer methods) Off line modelling based methods Only feasible for small scale problems Landscape with narrow peak? Generation based methods When to use exact evaluations? Efficiency of evaluating a whole population (how many evaluations are useful)? Iteration 1: EM Iteration 2: EM Iteration 3: EM Iteration 4:Prediction Iteration 5:Prediction Iteration 6:EM Iteration 7:EM Iteration 8:Prediction Iteration 9:Prediction Iteration 10:Prediction

18 Model Management (state of the art methods) Elitist candidates among search operators visited solutions Directly using top candidates by EA operators Combining EA with local search and (multiple) local surrogate models Prescreening methods utilising prediction uncertainty (GP model) Expected improvement Probability of improvement Lower confidence bound D. Jones, A taxonomy of global optimization methods based on response surfaces, Journal of global optimization, 2001, 21(4): D. Jones et al., Efficient global optimization of expensive black-box functions. Journal of Global optimization, 1998, 13(4): M. Emmerich et al., Single-and multiobjective evolutionary optimization assisted by gaussian random field metamodels, IEEE Transactions on Evolutionary Computation, 2006, 10(4): D. Lim et al., Generalizing surrogate-assisted evolutionary computation, IEEE Transactions on Evolutionary Computation, 2010, 14(3): Z. Zhou et al., Combining global and local surrogate models to accelerate evolutionary optimization, IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 2007, 37(1): M. Le et al. Evolution by adapting surrogates, Evolutionary computation, 2013, 21(2):

19 Ordinary GP modeling Given training data: Correlation function: Maximize likelihood function: Note: solve in closed form, estimate the hyper-parameters Best linear unbiased prediction and predictive distribution variants: simple/blind/

20 Prescreening With the uncertainty measurement, we can consider the quality of a candidate design in a global picture Even the predicted value is bad, promising solutions can still be discovered D. Jones, A Taxonomy of Global Optimization Methods Based on Response Surfaces, Journal of Global Optimization, pp

21 Prescreening Possible promising areas but with fewer training data points can be effectively explored. The guessed promising points may not be correct. Empirical experiments show that EI is not better than LCB. In medium scale (20 30d), in many cases / phases, prescreening prediction (evaluating the elitists)

22 Challenges Faced by SAEA Many practical engineering design problems have design variables (medium scale) and the landscapes of which are multimodal. A typical numerical simulation may need 20 minutes to several hours. Design engineers divide the optimisation time to a cup of tea, a night s time, a weekend, a week, two weeks and prohibitive. Existing SAEAs (often need several hundreds to thousands of simulations) still need substantial speed improvement to fit the industrial requirements.

23 Outline Simulation driven design optimisation and challenges Surrogate model assisted evolutionary algorithms (SAEAs) The surrogate model aware search framework SAEAs based on multi fidelity simulation Handling design robustness Conclusions

24 Goal and the Key Contradiction Goal: Make SAEAs much faster without sacrificing optimality Model quality Solution quality * x Efficiency Neval Good Solution Quality Good Model Quality More Samples (exponentially with d) Decrease Efficiency

25 Questions and Ideas (1) Why off line SAEA is not fit for medium scale problems? Do we need to model everywhere? Can we do greedy search? Most available SAEAs use the standard EA structure Standard EAs have excessive diversity Idea 1: only model the necessary regions! Question 1: to what extent we should explore the unknown parts?

26 Questions and Ideas (2) Good Solution Quality Good Model Quality Really more Samples? (exponentially with d) To describe a certain landscape, a certain amount of samples is necessary, no matter what the search is and how to model it. What decides the number of necessary samples? landscape complexity, number of design variables and? Decrease Efficiency

27 Summary of the Ideas We need to find a search method (only prescreening is not enough) which has enough (but not excessive) diversity leading to (global) optimum without exploring unnecessary regions. We may improve the locations of the samples to build surrogate models with better quality using the same number of samples, which is translated to efficiency. The samples are provided by a new search method.

28 Summary of the Ideas The search and modelling should work harmonically, reinforcing each other, rather than loosely connected How to make it easy to implement? How to make it insensitive to algorithm parameters? Surrogate model aware evolutionary search (SMAS) framework B. Liu, Q. Zhang, G. Gielen, "A Gaussian Process Surrogate Model Assisted Evolutionary Algorithm for Medium Scale Expensive Black Box Optimization Problems", IEEE Transactions on Evolutionary Computation, vol. 18, no. 2, pp , 2014.

29 SMAS vs. Present SAEA Traditional SAEA SMAS

30 Properties of SMAS (1) Using the elitist candidates as the parent population emphasises exploitation Only at most one candidate is different from two consecutive parent populations. The training data points describing the current search region can thus be much denser. The exploration ability can be maintained by selecting appropriate EA operators and parameters.

31 Experimental Verifications (1) Problems: 20,30 dimensional Ellipsoid (F1 F3, opt:0), Rosenbrock (F4 F6, opt:0), Ackley(F7 F9, opt:0), Griewank(F10 F12, opt:0), 30 dimensional RS Rastrigin(F13, opt: 330), 30 dimensional RH composition function(f14, opt:10) evaluations, 20 runs. SMAS vs. GS SOMA [Lim IEEE TEVC 2010] Converge at last

32 Experimental Verifications (2) SMAS vs. SAGA GLS [Zhou IEEE TSMC 2007] SMAS vs. MAES [Emmerich IEEE TEVC 2006]

33 Automated Design of Complex Antennas (1) EAs have been widely used for antenna synthesis, but the long optimisation time largely limits their applications Example: Four-element antenna array (3.4GHz 3.8GHz, FR4 substrate)

34 Automated Design of Complex Antennas (2) Maximise realised gain (each sampling point at least 13dB) with S11 below 10dB Synthesis finished in only one night, with 71.05dB (5 sampling points total) realised gain B. Liu, H. Aliakbarian, Z.Ma, G. Vandenbosch, G. Gielen, "An Efficient Method for Antenna Design Optimization Based on Evolutionary Computation and Machine Learning Techniques", IEEE Transactions on Antennas & Propagation, vol. 62, no. 1, pp. 7-18, 2014.

35 RF IC / mm wave IC Design Difficulties for manual design Passive component design is difficult Long simulation time: EM simulation (FEA), HB simulation Design experience intensive for the available step by step manual design method Difficulties for EA based automated design Accurate lumped models (computationally cheap) over a wide bandwidth for passive components are difficult to find at high frequencies Long simulation time: EM simulation, HB simulation Medium scale (15 40 variables) Complex and tight constraints

36 The GASPAD Method Focuses on 60GHz and above RF IC Three Main Goals of the Synthesiser Provide Highly Optimised Results General Enough to Any Circuit Configuration, Any Technology and Any Frequency Efficient Enough for Practical Use Update SMAS on constraint handling B. Liu, D. Zhao, G. Gielen, "GASPAD: A General and Efficient mm-wave Integrated Circuit Synthesis Method Based on Surrogate Model Assisted Evolutionary Algorithm", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 33, no. 2, pp , 2014.

37 Updating SMAS for Constraint Handling New ranking methods considering constraint satisfaction Separate modelling objective and constraints New methods to model the focused search region Prescreening + predicted value

38 mm wave IC Design Automation (1) Synthesis of a 60GHz power amplifier in a 65nm CMOS technology (18 parameters) 15 min / simulation

39 mm wave IC Design Automation (2) Design parameters and their ranges

40 Synthesised Result Synthesised results: Power added efficiency 9.85% 1dB compression point: 14.87dBm Power gain: 10.73dB K factor: (stable) About 2 days synthesis time. Much better performance than manual design [He 2010 RFIC] Benchmark tests show 10x to 100x speed improvement compared to standard EA-based methods with the increasing of severity of constraints

41 MEMS Synthesis: Example Corrugated actuator: 9 parameters From several examples, AGDEMO obtains better solutions than ANSYS DesignXplorer, obtaining about 8-13 times speed enhancement when the number of parameters is around 10. Altair

42 Outline Simulation driven design optimisation and challenges Surrogate model assisted evolutionary algorithms (SAEAs) The surrogate model aware search framework SAEAs based on multi fidelity simulation Handling design robustness Conclusions

43 More Efficiency Improvements Efficiency improvement of SMAS based methods: The more complex the landscape, the more design variables (but within 50), the more spec constraints, the more efficiency improvement 5 20 times efficiency improvement than standard EAs for most microwave / RF design optimisation / synthesis problems 4 months > 1 week Another calculation: 30 minutes / simulation, 700 simulations, 2 weeks 1 hour / simulation, 700 simulations, 1 month Sometimes, we have to include the connector, housing, We need more speed improvement!

44 Solutions to the efficiency problem Efficiency enhancement Evolutionary algorithms Change the optimizer Speed up the simulation Use fewer simulations Multi fidelity simulation models SAEA

45 Why Multi fidelity Simulation Models? Opportunities Coarse mesh / reduced solver iterations / simplified mesh type numerical simulation models (e.g., FEA model) is almost universal Coarse models often have times speed improvement compared to fine model It is compatible to SAEA A natural idea: Use the coarse model to explore the design space, filtering out many non optimal regions, and use the fine model to exploit the near optimal regions. However, this is not straightforward.

46 Available Method 1 Co Kriging assisted multi fidelity optimisation Co kriging is a surrogate model constructed by both fine model data and coarse model data A GP model based on the coarse model data A GP model based on the residuals of the fine and coarse model data The co kriging model is used as the surrogate model and is compatible to SAEAs A. I. Forrester, A. Sóbester, and A. J. Keane, Multi-fidelity optimization via surrogate modelling, Mathematical, Physical and Engineering Sciences, vol. 463, no The Royal Society, 2007, pp

47 Available Method 1: Advantages and Drawbacks Advantages: Mathematical sound and reliable Drawbacks: Not scalable: when it goes to medium scale, the initial highquality co kriging model needs a tremendous number of coarse and fine model samples

48 Available Method 2 Use the fine model to fine tune the optimal designs obtained by the coarse model (popular for real world engineers) Advantages: Scalable and good compatibility Drawbacks: Ad hoc: Success depends on the fidelity of the coarse model due to the distorted landscape Sometimes, successful Sometimes, using low fidelity model does not translate to final efficiency improvement Sometimes, the optimisation simply fails. S. Koziel and S. Ogurtsov, Model management for cost-efficient surrogate-based optimisation of antennas using variablefidelity electromagnetic simulations, IET Microwaves, Antennas & Propagation, vol. 6, no. 15, pp , 2012.

49 This Method Is NOT Reliable Frequency shift (Missing/additional peaks) Spatial shift The optimal point of the coarse model may have a large distance with the optimal point of the fine model, wasting a lot of simulations coarse fine S. Koziel and S. Ogurtsov, Model management for cost-efficient surrogate-based optimisation of antennas using variable-fidelity electromagnetic simulations, IET Microwaves, Antennas & Propagation, vol. 6, no. 15, pp , The optimal point of the fine model may be not be accessible by fine tuning from the optimal point of the coarse model

50 Ideas Idea: granting a coarse model based optimisation based on SMAS (not waste much), mine the data to find the correct starting points.

51 Data Mining Process Goal: calibrate the distortion using as few fine simulations as possible.

52 Handling Distortion S11 of a microstrip antenna The focused distortion: cannot be obtained by local exploitation from the optimal points in terms of the coarse model, the landscape(s) of the coarse model maintains the general shape of that of the fine model

53 Real World Example (1) Example: Yagi-Uda antenna Rogers RT6010

54 Real World Example (2) 10GHz-11GHz Coarse model: 85,680 mesh cells, 2 minutes Fine model: 1,512,000 mesh cells, 40 minutes Specific challenge: gain of the fine model is smaller than the coarse model, and the optimal solutions of the coarse model are not feasible in terms of fine model evaluation.

55 Real World Example (3) Response: Yagi-Uda antenna SADEA-II vs. SADEA

56 Outline Simulation driven design optimisation and challenges Surrogate model assisted evolutionary algorithms (SAEAs) The surrogate model aware search framework SAEAs based on multi fidelity simulation Handling design robustness Conclusions

57 Robust design optimisation Two kinds of robust optimisation Robust design Example: mechanical engineering Requirement: the performance shows little degradation considering process variations High computing overhead per simulation (e.g., FEA) Yield optimisation, yield performance trade off Example: IC design (high value manufacturing) Requirement: accurate yield estimation High or low computing overhead per simulation Altair

58 Ordinal Optimisation Assisted DE The ORDE algorithm for analogue IC yield optimisation: Ordinal optimisation for intelligent computing budget allocation Advanced Monte Carlo Sampling method Integration with differential evolution B. Liu, F. Fernández, G. Gielen, "Efficient and Accurate Statistical Analog Yield Optimization and Variation-Aware Circuit Sizing Based on Computational Intelligence Techniques", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 30, no. 6, pp , Altair

59 General Ideas Selection-based constraint handling OCBA (Optimal Computational Budget Allocation) Random-scale and trigonometric mutation seminar 59

60 Flow diagram seminar 60

61 Example Two stage fully differential folded cascode amplifier (TSMC 90nm CMOS technology): 21 parameters 25 minutes: yield=98.9% From several examples, ORDE obtains comparable solutions with Differential Evolution with primitive Monte Carlo simulation, obtaining about 10 times speed enhancement. Altair

62 Outline Simulation driven design optimisation Surrogate model assisted evolutionary algorithms (SAEAs) and challenges The surrogate model aware search framework Data mining techniques for multi fidelity SAEAs Conclusions

63 Conclusions Improving the efficiency of SAEA is a key issue for simulationdriven design optimisation / automation The SMAS framework significantly enhances the efficiency of SAEA for medium scale problems because the surrogate modelling and the search work together, reinforcing each other. The data mining assisted SMAS handles the distortion between simulation models of different fidelities, integrating the advantage of low fidelity simulation model in a reliable manner and is scalable. Future works include: (1) robust FEA simulation embedded design automation methods and various applications, (2) introducing computational intelligence techniques to FEA solvers.

64 Thank you Thank you!

Non-deterministic Search techniques. Emma Hart

Non-deterministic Search techniques. Emma Hart Non-deterministic Search techniques Emma Hart Why do local search? Many real problems are too hard to solve with exact (deterministic) techniques Modern, non-deterministic techniques offer ways of getting

More information

Committee-based Active Learning for Surrogate-Assisted Particle Swarm Optimization of Expensive Problems

Committee-based Active Learning for Surrogate-Assisted Particle Swarm Optimization of Expensive Problems IEEE TRANSACTIONS ON CYBERNETICS, VOL. XX, NO. X, XXX XXXX 1 Committee-based Active Learning for Surrogate-Assisted Particle Swarm Optimization of Expensive Problems Handing Wang, Member, IEEE, Yaochu

More information

Computational Optimization, Modelling and Simulation: Past, Present and Future

Computational Optimization, Modelling and Simulation: Past, Present and Future Procedia Computer Science Volume 29, 2014, Pages 754 758 ICCS 2014. 14th International Conference on Computational Science Computational Optimization, Modelling and Simulation: Past, Present and Future

More information

Data-Driven Evolutionary Optimization of Complex Systems: Big vs Small Data

Data-Driven Evolutionary Optimization of Complex Systems: Big vs Small Data Data-Driven Evolutionary Optimization of Complex Systems: Big vs Small Data Yaochu Jin Head, Nature Inspired Computing and Engineering (NICE) Department of Computer Science, University of Surrey, United

More information

Exploration vs. Exploitation in Differential Evolution

Exploration vs. Exploitation in Differential Evolution Exploration vs. Exploitation in Differential Evolution Ângela A. R. Sá 1, Adriano O. Andrade 1, Alcimar B. Soares 1 and Slawomir J. Nasuto 2 Abstract. Differential Evolution (DE) is a tool for efficient

More information

Filter Design Explorer 1.0 User s Guide

Filter Design Explorer 1.0 User s Guide Filter Design Eplorer 1.0 User s Guide CADES Research Center, 017. Web: www.cadescenter.com Email: info@cadescenter.com NOTICE: As a result of the new 1D result storage mode in CST 017, please note the

More information

A Parallel Surrogate Model Assisted Evolutionary Algorithm for Electromagnetic Design Optimization

A Parallel Surrogate Model Assisted Evolutionary Algorithm for Electromagnetic Design Optimization 1 A Parallel Surrogate Model Assisted Evolutionary Algorithm for Electromagnetic Design Optimization Mobayode O. Akinsolu Member, IEEE, Bo Liu Senior Member, IEEE, Vic Grout, Pavlos I. Lazaridis Senior

More information

Kyrre Glette INF3490 Evolvable Hardware Cartesian Genetic Programming

Kyrre Glette INF3490 Evolvable Hardware Cartesian Genetic Programming Kyrre Glette kyrrehg@ifi INF3490 Evolvable Hardware Cartesian Genetic Programming Overview Introduction to Evolvable Hardware (EHW) Cartesian Genetic Programming Applications of EHW 3 Evolvable Hardware

More information

Constrained Multi-Objective Antenna Design Optimization using Surrogates

Constrained Multi-Objective Antenna Design Optimization using Surrogates INTERNATIONAL JOURNAL OF NUMERICAL MODELLING: ELECTRONIC NETWORKS, DEVICES AND FIELDS Int. J. Numer. Model. 2010; 00:1 7 Published online in Wiley InterScience (www.interscience.wiley.com). Constrained

More information

Engineering 1000 Chapter 6: Abstraction and Modeling

Engineering 1000 Chapter 6: Abstraction and Modeling Engineering 1000 Chapter 6: Abstraction and Modeling Outline Why is abstraction useful? What are models? how are models different from theory and simulation? Examples from microelectronics Types of model

More information

On the Solution of Min-Max Problems in Robust Optimization

On the Solution of Min-Max Problems in Robust Optimization On the Solution of Min-Max Problems in Robust Optimization Massimiliano Vasile Department of Mechanical & Aerospace Engineering, University of Strathclyde. 75 Montrose Street, G1 1XJ Glasgow, UK Abstract.

More information

Optimization of Components using Sensitivity and Yield Information

Optimization of Components using Sensitivity and Yield Information Optimization of Components using Sensitivity and Yield Information Franz Hirtenfelder, CST AG franz.hirtenfelder@cst.com www.cst.com CST UGM 2010 April 10 1 Abstract Optimization is a typical component

More information

An Introduction to Evolutionary Algorithms

An Introduction to Evolutionary Algorithms An Introduction to Evolutionary Algorithms Karthik Sindhya, PhD Postdoctoral Researcher Industrial Optimization Group Department of Mathematical Information Technology Karthik.sindhya@jyu.fi http://users.jyu.fi/~kasindhy/

More information

Evolving Radial Basis Function Networks via GP for Estimating Fitness Values using Surrogate Models

Evolving Radial Basis Function Networks via GP for Estimating Fitness Values using Surrogate Models Evolving Radial Basis Function Networks via GP for Estimating Fitness Values using Surrogate Models Ahmed Kattan and Edgar Galvan Abstract In real-world problems with candidate solutions that are very

More information

Hybridization EVOLUTIONARY COMPUTING. Reasons for Hybridization - 1. Naming. Reasons for Hybridization - 3. Reasons for Hybridization - 2

Hybridization EVOLUTIONARY COMPUTING. Reasons for Hybridization - 1. Naming. Reasons for Hybridization - 3. Reasons for Hybridization - 2 Hybridization EVOLUTIONARY COMPUTING Hybrid Evolutionary Algorithms hybridization of an EA with local search techniques (commonly called memetic algorithms) EA+LS=MA constructive heuristics exact methods

More information

Global Optimization of Integrated Transformers for High Frequency Microwave Circuits Using a Gaussian Process Based Surrogate Model

Global Optimization of Integrated Transformers for High Frequency Microwave Circuits Using a Gaussian Process Based Surrogate Model Global Optimization of Integrated Transformers for High Frequency Microwave Circuits Usg a Gaussian Process Based Surrogate Model Bo Liu, Yg He, Patrick Reynaert, Georges Gielen ESAT-MICAS, Katholieke

More information

Machine Learning Reliability Techniques for Composite Materials in Structural Applications.

Machine Learning Reliability Techniques for Composite Materials in Structural Applications. Machine Learning Reliability Techniques for Composite Materials in Structural Applications. Roberto d Ippolito, Keiichi Ito, Silvia Poles, Arnaud Froidmont Noesis Solutions Optimus by Noesis Solutions

More information

Introducing Virtuoso RF Designer (RFD) For RFIC Designs

Introducing Virtuoso RF Designer (RFD) For RFIC Designs A seminar on Cadence Virtuoso RF Designer is scheduled for March 5, 2008. To know more, write to Brajesh Heda at brajesh@cadence.com Introducing Virtuoso RF Designer (RFD) For RFIC Designs Introduction

More information

Genetic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem

Genetic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem etic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem R. O. Oladele Department of Computer Science University of Ilorin P.M.B. 1515, Ilorin, NIGERIA

More information

Application of Emerging Metaheuristics in Power System Field

Application of Emerging Metaheuristics in Power System Field Application of Emerging Metaheuristics in Power System Field Dr.ir. J.L. Rueda Torres 26 th June 2015 1 Outline 1. Problem complexity 2. Why metaheuristics? 3. Emerging algorithms 4. Applications 2 1 Problem

More information

Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization

Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization 2017 2 nd International Electrical Engineering Conference (IEEC 2017) May. 19 th -20 th, 2017 at IEP Centre, Karachi, Pakistan Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic

More information

EFFICIENT SAMPLING FOR DESIGN OPTIMIZATION OF AN SLS PRODUCT. Nancy Xu*, Cem C. Tutum

EFFICIENT SAMPLING FOR DESIGN OPTIMIZATION OF AN SLS PRODUCT. Nancy Xu*, Cem C. Tutum Solid Freeform Fabrication 2017: Proceedings of the 28th Annual International Solid Freeform Fabrication Symposium An Additive Manufacturing Conference EFFICIENT SAMPLING FOR DESIGN OPTIMIZATION OF AN

More information

An evolutionary annealing-simplex algorithm for global optimisation of water resource systems

An evolutionary annealing-simplex algorithm for global optimisation of water resource systems FIFTH INTERNATIONAL CONFERENCE ON HYDROINFORMATICS 1-5 July 2002, Cardiff, UK C05 - Evolutionary algorithms in hydroinformatics An evolutionary annealing-simplex algorithm for global optimisation of water

More information

Bi-Objective Optimization for Scheduling in Heterogeneous Computing Systems

Bi-Objective Optimization for Scheduling in Heterogeneous Computing Systems Bi-Objective Optimization for Scheduling in Heterogeneous Computing Systems Tony Maciejewski, Kyle Tarplee, Ryan Friese, and Howard Jay Siegel Department of Electrical and Computer Engineering Colorado

More information

Heuristic Optimisation

Heuristic Optimisation Heuristic Optimisation Part 10: Genetic Algorithm Basics Sándor Zoltán Németh http://web.mat.bham.ac.uk/s.z.nemeth s.nemeth@bham.ac.uk University of Birmingham S Z Németh (s.nemeth@bham.ac.uk) Heuristic

More information

Outline. Darren Wang ADS Momentum P2

Outline. Darren Wang ADS Momentum P2 Outline Momentum Basics: Microstrip Meander Line Momentum RF Mode: RFIC Launch Designing with Momentum: Via Fed Patch Antenna Momentum Techniques: 3dB Splitter Look-alike Momentum Optimization: 3 GHz Band

More information

Scheme of Big-Data Supported Interactive Evolutionary Computation

Scheme of Big-Data Supported Interactive Evolutionary Computation 2017 2nd International Conference on Information Technology and Management Engineering (ITME 2017) ISBN: 978-1-60595-415-8 Scheme of Big-Data Supported Interactive Evolutionary Computation Guo-sheng HAO

More information

Introduction to ANSYS DesignXplorer

Introduction to ANSYS DesignXplorer Lecture 5 Goal Driven Optimization 14. 5 Release Introduction to ANSYS DesignXplorer 1 2013 ANSYS, Inc. September 27, 2013 Goal Driven Optimization (GDO) Goal Driven Optimization (GDO) is a multi objective

More information

Efficient Robust Shape Optimization for Crashworthiness

Efficient Robust Shape Optimization for Crashworthiness 10 th World Congress on Structural and Multidisciplinary Optimization May 19-24, 2013, Orlando, Florida, USA Efficient Robust Shape Optimization for Crashworthiness Milan Rayamajhi 1, Stephan Hunkeler

More information

Inclusion of Aleatory and Epistemic Uncertainty in Design Optimization

Inclusion of Aleatory and Epistemic Uncertainty in Design Optimization 10 th World Congress on Structural and Multidisciplinary Optimization May 19-24, 2013, Orlando, Florida, USA Inclusion of Aleatory and Epistemic Uncertainty in Design Optimization Sirisha Rangavajhala

More information

Unidimensional Search for solving continuous high-dimensional optimization problems

Unidimensional Search for solving continuous high-dimensional optimization problems 2009 Ninth International Conference on Intelligent Systems Design and Applications Unidimensional Search for solving continuous high-dimensional optimization problems Vincent Gardeux, Rachid Chelouah,

More information

Introduction to Evolutionary Computation

Introduction to Evolutionary Computation Introduction to Evolutionary Computation The Brought to you by (insert your name) The EvoNet Training Committee Some of the Slides for this lecture were taken from the Found at: www.cs.uh.edu/~ceick/ai/ec.ppt

More information

Modified Particle Swarm Optimization

Modified Particle Swarm Optimization Modified Particle Swarm Optimization Swati Agrawal 1, R.P. Shimpi 2 1 Aerospace Engineering Department, IIT Bombay, Mumbai, India, swati.agrawal@iitb.ac.in 2 Aerospace Engineering Department, IIT Bombay,

More information

Cover Page. The handle holds various files of this Leiden University dissertation.

Cover Page. The handle   holds various files of this Leiden University dissertation. Cover Page The handle http://hdl.handle.net/1887/22055 holds various files of this Leiden University dissertation. Author: Koch, Patrick Title: Efficient tuning in supervised machine learning Issue Date:

More information

Benchmark Functions for the CEC 2008 Special Session and Competition on Large Scale Global Optimization

Benchmark Functions for the CEC 2008 Special Session and Competition on Large Scale Global Optimization Benchmark Functions for the CEC 2008 Special Session and Competition on Large Scale Global Optimization K. Tang 1, X. Yao 1, 2, P. N. Suganthan 3, C. MacNish 4, Y. P. Chen 5, C. M. Chen 5, Z. Yang 1 1

More information

Evolutionary Algorithm Using Progressive Kriging Model and Dynamic Reliable Region for Expensive Optimization Problems

Evolutionary Algorithm Using Progressive Kriging Model and Dynamic Reliable Region for Expensive Optimization Problems IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, October 9-, 6, Budapest, Hungary Evolutionary Algorithm Using Progressive Kriging Model and Dynamic Reliable Region for Expensive Optimization

More information

Topological Machining Fixture Layout Synthesis Using Genetic Algorithms

Topological Machining Fixture Layout Synthesis Using Genetic Algorithms Topological Machining Fixture Layout Synthesis Using Genetic Algorithms Necmettin Kaya Uludag University, Mechanical Eng. Department, Bursa, Turkey Ferruh Öztürk Uludag University, Mechanical Eng. Department,

More information

Outline of the module

Outline of the module Evolutionary and Heuristic Optimisation (ITNPD8) Lecture 2: Heuristics and Metaheuristics Gabriela Ochoa http://www.cs.stir.ac.uk/~goc/ Computing Science and Mathematics, School of Natural Sciences University

More information

Auto-Extraction of Modelica Code from Finite Element Analysis or Measurement Data

Auto-Extraction of Modelica Code from Finite Element Analysis or Measurement Data Auto-Extraction of Modelica Code from Finite Element Analysis or Measurement Data The-Quan Pham, Alfred Kamusella, Holger Neubert OptiY ek, Aschaffenburg Germany, e-mail: pham@optiyeu Technische Universität

More information

Applied Cloning Techniques for a Genetic Algorithm Used in Evolvable Hardware Design

Applied Cloning Techniques for a Genetic Algorithm Used in Evolvable Hardware Design Applied Cloning Techniques for a Genetic Algorithm Used in Evolvable Hardware Design Viet C. Trinh vtrinh@isl.ucf.edu Gregory A. Holifield greg.holifield@us.army.mil School of Electrical Engineering and

More information

SwarmOps for Java. Numeric & Heuristic Optimization Source-Code Library for Java The Manual Revision 1.0

SwarmOps for Java. Numeric & Heuristic Optimization Source-Code Library for Java The Manual Revision 1.0 Numeric & Heuristic Optimization Source-Code Library for Java The Manual Revision 1.0 By Magnus Erik Hvass Pedersen June 2011 Copyright 2009-2011, all rights reserved by the author. Please see page 4 for

More information

New developments in LS-OPT

New developments in LS-OPT 7. LS-DYNA Anwenderforum, Bamberg 2008 Optimierung II New developments in LS-OPT Nielen Stander, Tushar Goel, Willem Roux Livermore Software Technology Corporation, Livermore, CA94551, USA Summary: This

More information

Pattern Recognition. Kjell Elenius. Speech, Music and Hearing KTH. March 29, 2007 Speech recognition

Pattern Recognition. Kjell Elenius. Speech, Music and Hearing KTH. March 29, 2007 Speech recognition Pattern Recognition Kjell Elenius Speech, Music and Hearing KTH March 29, 2007 Speech recognition 2007 1 Ch 4. Pattern Recognition 1(3) Bayes Decision Theory Minimum-Error-Rate Decision Rules Discriminant

More information

Antenna Design Explorer 1.0 User s Guide

Antenna Design Explorer 1.0 User s Guide Antenna Design Eplorer 1.0 User s Guide CADES Research Center, 017. Web: www.cadescenter.com Email: info@cadescenter.com NOTICE: As a result of the new 1D result storage mode in CST 017, please note the

More information

GA is the most popular population based heuristic algorithm since it was developed by Holland in 1975 [1]. This algorithm runs faster and requires les

GA is the most popular population based heuristic algorithm since it was developed by Holland in 1975 [1]. This algorithm runs faster and requires les Chaotic Crossover Operator on Genetic Algorithm Hüseyin Demirci Computer Engineering, Sakarya University, Sakarya, 54187, Turkey Ahmet Turan Özcerit Computer Engineering, Sakarya University, Sakarya, 54187,

More information

Optimum Placement of Decoupling Capacitors on Packages and Printed Circuit Boards Under the Guidance of Electromagnetic Field Simulation

Optimum Placement of Decoupling Capacitors on Packages and Printed Circuit Boards Under the Guidance of Electromagnetic Field Simulation Optimum Placement of Decoupling Capacitors on Packages and Printed Circuit Boards Under the Guidance of Electromagnetic Field Simulation Yuzhe Chen, Zhaoqing Chen and Jiayuan Fang Department of Electrical

More information

Using CODEQ to Train Feed-forward Neural Networks

Using CODEQ to Train Feed-forward Neural Networks Using CODEQ to Train Feed-forward Neural Networks Mahamed G. H. Omran 1 and Faisal al-adwani 2 1 Department of Computer Science, Gulf University for Science and Technology, Kuwait, Kuwait omran.m@gust.edu.kw

More information

Large-Scale Full-Wave Simulation

Large-Scale Full-Wave Simulation Large-Scale Full-Wave Simulation Sharad Kapur and David Long Integrand Software, Inc. Areas of interest Consistent trends in IC design Increasing operating frequencies Modeling of passive structures (components,

More information

Center-Based Sampling for Population-Based Algorithms

Center-Based Sampling for Population-Based Algorithms Center-Based Sampling for Population-Based Algorithms Shahryar Rahnamayan, Member, IEEE, G.GaryWang Abstract Population-based algorithms, such as Differential Evolution (DE), Particle Swarm Optimization

More information

CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM

CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM 20 CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM 2.1 CLASSIFICATION OF CONVENTIONAL TECHNIQUES Classical optimization methods can be classified into two distinct groups:

More information

Metaheuristic Development Methodology. Fall 2009 Instructor: Dr. Masoud Yaghini

Metaheuristic Development Methodology. Fall 2009 Instructor: Dr. Masoud Yaghini Metaheuristic Development Methodology Fall 2009 Instructor: Dr. Masoud Yaghini Phases and Steps Phases and Steps Phase 1: Understanding Problem Step 1: State the Problem Step 2: Review of Existing Solution

More information

AIRFOIL SHAPE OPTIMIZATION USING EVOLUTIONARY ALGORITHMS

AIRFOIL SHAPE OPTIMIZATION USING EVOLUTIONARY ALGORITHMS AIRFOIL SHAPE OPTIMIZATION USING EVOLUTIONARY ALGORITHMS Emre Alpman Graduate Research Assistant Aerospace Engineering Department Pennstate University University Park, PA, 6802 Abstract A new methodology

More information

GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM

GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM Journal of Al-Nahrain University Vol.10(2), December, 2007, pp.172-177 Science GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM * Azhar W. Hammad, ** Dr. Ban N. Thannoon Al-Nahrain

More information

Research Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding

Research Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding e Scientific World Journal, Article ID 746260, 8 pages http://dx.doi.org/10.1155/2014/746260 Research Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding Ming-Yi

More information

CHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES

CHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES CHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES 6.1 INTRODUCTION The exploration of applications of ANN for image classification has yielded satisfactory results. But, the scope for improving

More information

Video-Aware Wireless Networks (VAWN) Final Meeting January 23, 2014

Video-Aware Wireless Networks (VAWN) Final Meeting January 23, 2014 Video-Aware Wireless Networks (VAWN) Final Meeting January 23, 2014 1/26 ! Real-time Video Transmission! Challenges and Opportunities! Lessons Learned for Real-time Video! Mitigating Losses in Scalable

More information

A Fast Estimation of SRAM Failure Rate Using Probability Collectives

A Fast Estimation of SRAM Failure Rate Using Probability Collectives A Fast Estimation of SRAM Failure Rate Using Probability Collectives Fang Gong Electrical Engineering Department, UCLA http://www.ee.ucla.edu/~fang08 Collaborators: Sina Basir-Kazeruni, Lara Dolecek, Lei

More information

Artificial Neuron Modelling Based on Wave Shape

Artificial Neuron Modelling Based on Wave Shape Artificial Neuron Modelling Based on Wave Shape Kieran Greer, Distributed Computing Systems, Belfast, UK. http://distributedcomputingsystems.co.uk Version 1.2 Abstract This paper describes a new model

More information

Argha Roy* Dept. of CSE Netaji Subhash Engg. College West Bengal, India.

Argha Roy* Dept. of CSE Netaji Subhash Engg. College West Bengal, India. Volume 3, Issue 3, March 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Training Artificial

More information

Evolutionary Algorithms. CS Evolutionary Algorithms 1

Evolutionary Algorithms. CS Evolutionary Algorithms 1 Evolutionary Algorithms CS 478 - Evolutionary Algorithms 1 Evolutionary Computation/Algorithms Genetic Algorithms l Simulate natural evolution of structures via selection and reproduction, based on performance

More information

Multigrid Pattern. I. Problem. II. Driving Forces. III. Solution

Multigrid Pattern. I. Problem. II. Driving Forces. III. Solution Multigrid Pattern I. Problem Problem domain is decomposed into a set of geometric grids, where each element participates in a local computation followed by data exchanges with adjacent neighbors. The grids

More information

Evolutionary Computation Algorithms for Cryptanalysis: A Study

Evolutionary Computation Algorithms for Cryptanalysis: A Study Evolutionary Computation Algorithms for Cryptanalysis: A Study Poonam Garg Information Technology and Management Dept. Institute of Management Technology Ghaziabad, India pgarg@imt.edu Abstract The cryptanalysis

More information

Parameter Control of Genetic Algorithms by Learning and Simulation of Bayesian Networks

Parameter Control of Genetic Algorithms by Learning and Simulation of Bayesian Networks Submitted Soft Computing Parameter Control of Genetic Algorithms by Learning and Simulation of Bayesian Networks C. Bielza,*, J.A. Fernández del Pozo, P. Larrañaga Universidad Politécnica de Madrid, Departamento

More information

Information Fusion Dr. B. K. Panigrahi

Information Fusion Dr. B. K. Panigrahi Information Fusion By Dr. B. K. Panigrahi Asst. Professor Department of Electrical Engineering IIT Delhi, New Delhi-110016 01/12/2007 1 Introduction Classification OUTLINE K-fold cross Validation Feature

More information

Reddit Recommendation System Daniel Poon, Yu Wu, David (Qifan) Zhang CS229, Stanford University December 11 th, 2011

Reddit Recommendation System Daniel Poon, Yu Wu, David (Qifan) Zhang CS229, Stanford University December 11 th, 2011 Reddit Recommendation System Daniel Poon, Yu Wu, David (Qifan) Zhang CS229, Stanford University December 11 th, 2011 1. Introduction Reddit is one of the most popular online social news websites with millions

More information

Neural Networks and Deep Learning

Neural Networks and Deep Learning Neural Networks and Deep Learning Example Learning Problem Example Learning Problem Celebrity Faces in the Wild Machine Learning Pipeline Raw data Feature extract. Feature computation Inference: prediction,

More information

Surrogate-assisted Self-accelerated Particle Swarm Optimization

Surrogate-assisted Self-accelerated Particle Swarm Optimization Surrogate-assisted Self-accelerated Particle Swarm Optimization Kambiz Haji Hajikolaei 1, Amir Safari, G. Gary Wang ±, Hirpa G. Lemu, ± School of Mechatronic Systems Engineering, Simon Fraser University,

More information

Multidisciplinary System Design Optimization (MSDO)

Multidisciplinary System Design Optimization (MSDO) Multidisciplinary System Design Optimization (MSDO) Approximation Methods Karen Willcox Slides from: Theresa Robinson, Andrew March 1 Massachusetts Institute of Technology - Prof. de Wec and Prof. Willcox

More information

A Surrogate-Assisted Memetic Co-evolutionary Algorithm for Expensive Constrained Optimization Problems

A Surrogate-Assisted Memetic Co-evolutionary Algorithm for Expensive Constrained Optimization Problems A Surrogate-Assisted Memetic Co-evolutionary Algorithm for Expensive Constrained Optimization Problems C. K. Goh,D.Lim,L.Ma,Y.S.Ong and P. S. Dutta Advanced Technology Centre Rolls-Royce Singapore Email:

More information

Inertia Weight. v i = ωv i +φ 1 R(0,1)(p i x i )+φ 2 R(0,1)(p g x i ) The new velocity update equation:

Inertia Weight. v i = ωv i +φ 1 R(0,1)(p i x i )+φ 2 R(0,1)(p g x i ) The new velocity update equation: Convergence of PSO The velocity update equation: v i = v i +φ 1 R(0,1)(p i x i )+φ 2 R(0,1)(p g x i ) for some values of φ 1 and φ 2 the velocity grows without bound can bound velocity to range [ V max,v

More information

Approximation Model Guided Selection for Evolutionary Multiobjective Optimization

Approximation Model Guided Selection for Evolutionary Multiobjective Optimization Approximation Model Guided Selection for Evolutionary Multiobjective Optimization Aimin Zhou 1, Qingfu Zhang 2, and Guixu Zhang 1 1 Each China Normal University, Shanghai, China 2 University of Essex,

More information

Data Mining Chapter 8: Search and Optimization Methods Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University

Data Mining Chapter 8: Search and Optimization Methods Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University Data Mining Chapter 8: Search and Optimization Methods Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University Search & Optimization Search and Optimization method deals with

More information

EMO A Real-World Application of a Many-Objective Optimisation Complexity Reduction Process

EMO A Real-World Application of a Many-Objective Optimisation Complexity Reduction Process EMO 2013 A Real-World Application of a Many-Objective Optimisation Complexity Reduction Process Robert J. Lygoe, Mark Cary, and Peter J. Fleming 22-March-2013 Contents Introduction Background Process Enhancements

More information

CHAPTER 1 INTRODUCTION

CHAPTER 1 INTRODUCTION CHAPTER 1 INTRODUCTION Rapid advances in integrated circuit technology have made it possible to fabricate digital circuits with large number of devices on a single chip. The advantages of integrated circuits

More information

1 Lab 5: Particle Swarm Optimization

1 Lab 5: Particle Swarm Optimization 1 Lab 5: Particle Swarm Optimization This laboratory requires the following: (The development tools are installed in GR B0 01 already): C development tools (gcc, make, etc.) Webots simulation software

More information

Optimal tree for Genetic Algorithms in the Traveling Salesman Problem (TSP).

Optimal tree for Genetic Algorithms in the Traveling Salesman Problem (TSP). Optimal tree for Genetic Algorithms in the Traveling Salesman Problem (TSP). Liew Sing liews_ryan@yahoo.com.sg April 1, 2012 Abstract In this paper, the author proposes optimal tree as a gauge for the

More information

The k-means Algorithm and Genetic Algorithm

The k-means Algorithm and Genetic Algorithm The k-means Algorithm and Genetic Algorithm k-means algorithm Genetic algorithm Rough set approach Fuzzy set approaches Chapter 8 2 The K-Means Algorithm The K-Means algorithm is a simple yet effective

More information

Design optimization and design exploration using an open source framework on HPC facilities Presented by: Joel GUERRERO

Design optimization and design exploration using an open source framework on HPC facilities Presented by: Joel GUERRERO Workshop HPC Methods for Engineering CINECA (Milan, Italy). June 17th-19th, 2015. Design optimization and design exploration using an open source framework on HPC facilities Presented by: Joel GUERRERO

More information

Traffic Signal Control Based On Fuzzy Artificial Neural Networks With Particle Swarm Optimization

Traffic Signal Control Based On Fuzzy Artificial Neural Networks With Particle Swarm Optimization Traffic Signal Control Based On Fuzzy Artificial Neural Networks With Particle Swarm Optimization J.Venkatesh 1, B.Chiranjeevulu 2 1 PG Student, Dept. of ECE, Viswanadha Institute of Technology And Management,

More information

Sensor Tasking and Control

Sensor Tasking and Control Sensor Tasking and Control Outline Task-Driven Sensing Roles of Sensor Nodes and Utilities Information-Based Sensor Tasking Joint Routing and Information Aggregation Summary Introduction To efficiently

More information

High Dimensional Model Representation for solving Expensive Multi-objective Optimization Problems

High Dimensional Model Representation for solving Expensive Multi-objective Optimization Problems High Dimensional Model Representation for solving Expensive Multi-objective Optimization Problems Proteek Chandan Roy and Kalyanmoy Deb Department of Computer Science and Engineering, Michigan State University

More information

Introduction. Communication Systems Simulation - I. Monte Carlo method. Simulation methods

Introduction. Communication Systems Simulation - I. Monte Carlo method. Simulation methods Introduction Communication Systems Simulation - I Harri Saarnisaari Part of Simulations and Tools for Telecommunication Course First we study what simulation methods are available Use of the Monte Carlo

More information

Solving Sudoku Puzzles with Node Based Coincidence Algorithm

Solving Sudoku Puzzles with Node Based Coincidence Algorithm Solving Sudoku Puzzles with Node Based Coincidence Algorithm Kiatsopon Waiyapara Department of Compute Engineering, Faculty of Engineering, Chulalongkorn University, Bangkok, Thailand kiatsopon.w@gmail.com

More information

CUDA-accelerated genetic feedforward-ann training for data mining

CUDA-accelerated genetic feedforward-ann training for data mining Journal of Physics: Conference Series CUDA-accelerated genetic feedforward-ann training for data mining To cite this article: Catalin Patulea et al 2010 J. Phys.: Conf. Ser. 256 012014 View the article

More information

Evolving Variable-Ordering Heuristics for Constrained Optimisation

Evolving Variable-Ordering Heuristics for Constrained Optimisation Griffith Research Online https://research-repository.griffith.edu.au Evolving Variable-Ordering Heuristics for Constrained Optimisation Author Bain, Stuart, Thornton, John, Sattar, Abdul Published 2005

More information

A Comparison of the Iterative Fourier Transform Method and. Evolutionary Algorithms for the Design of Diffractive Optical.

A Comparison of the Iterative Fourier Transform Method and. Evolutionary Algorithms for the Design of Diffractive Optical. A Comparison of the Iterative Fourier Transform Method and Evolutionary Algorithms for the Design of Diffractive Optical Elements Philip Birch, Rupert Young, Maria Farsari, David Budgett, John Richardson,

More information

Metamodeling. Modern optimization methods 1

Metamodeling. Modern optimization methods 1 Metamodeling Most modern area of optimization research For computationally demanding objective functions as well as constraint functions Main idea is that real functions are not convex but are in some

More information

Realize Your Product Promise. DesignerRF

Realize Your Product Promise. DesignerRF Realize Your Product Promise DesignerRF Four-element antenna array showing current distribution and far-field gain, created in DesignerRF using layout editor and solved via HFSS with Solver on Demand technology

More information

Learning-based Neuroimage Registration

Learning-based Neuroimage Registration Learning-based Neuroimage Registration Leonid Teverovskiy and Yanxi Liu 1 October 2004 CMU-CALD-04-108, CMU-RI-TR-04-59 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Abstract

More information

A Structural Optimization Method of Genetic Network Programming. for Enhancing Generalization Ability

A Structural Optimization Method of Genetic Network Programming. for Enhancing Generalization Ability International Journal of Engineering Innovation and Management Vol.6, No.2, 2016 A Structural Optimization Method of Genetic Network Programming for Enhancing Generalization Ability Shingo Mabu, Yamaguchi

More information

Use of numerical flow simulations (CFD) for optimising heat exchangers

Use of numerical flow simulations (CFD) for optimising heat exchangers www.guentner.eu Technical article from 03.04.2017 Author Dr. Andreas Zürner Research Güntner GmbH & Co. KG Use of numerical flow simulations (CFD) for optimising heat exchangers Numerical flow simulations

More information

ARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS

ARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS ARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS Gabriela Ochoa http://www.cs.stir.ac.uk/~goc/ OUTLINE Optimisation problems Optimisation & search Two Examples The knapsack problem

More information

Introduction to Optimization

Introduction to Optimization Introduction to Optimization Approximation Algorithms and Heuristics November 21, 2016 École Centrale Paris, Châtenay-Malabry, France Dimo Brockhoff Inria Saclay Ile-de-France 2 Exercise: The Knapsack

More information

Theoretical Concepts of Machine Learning

Theoretical Concepts of Machine Learning Theoretical Concepts of Machine Learning Part 2 Institute of Bioinformatics Johannes Kepler University, Linz, Austria Outline 1 Introduction 2 Generalization Error 3 Maximum Likelihood 4 Noise Models 5

More information

Luo, W., and Li, Y. (2016) Benchmarking Heuristic Search and Optimisation Algorithms in Matlab. In: 22nd International Conference on Automation and Computing (ICAC), 2016, University of Essex, Colchester,

More information

Application of Genetic Algorithms to CFD. Cameron McCartney

Application of Genetic Algorithms to CFD. Cameron McCartney Application of Genetic Algorithms to CFD Cameron McCartney Introduction define and describe genetic algorithms (GAs) and genetic programming (GP) propose possible applications of GA/GP to CFD Application

More information

Radio Network Planning with Combinatorial Optimisation Algorithms

Radio Network Planning with Combinatorial Optimisation Algorithms Author manuscript, published in "ACTS Mobile Telecommunications Summit 96, Granada : Spain (1996)" Radio Network Planning with Combinatorial Optimisation Algorithms P. Calégari, F. Guidec, P. Kuonen, EPFL,

More information

Image Compression: An Artificial Neural Network Approach

Image Compression: An Artificial Neural Network Approach Image Compression: An Artificial Neural Network Approach Anjana B 1, Mrs Shreeja R 2 1 Department of Computer Science and Engineering, Calicut University, Kuttippuram 2 Department of Computer Science and

More information

IMPROVING THE PARTICLE SWARM OPTIMIZATION ALGORITHM USING THE SIMPLEX METHOD AT LATE STAGE

IMPROVING THE PARTICLE SWARM OPTIMIZATION ALGORITHM USING THE SIMPLEX METHOD AT LATE STAGE IMPROVING THE PARTICLE SWARM OPTIMIZATION ALGORITHM USING THE SIMPLEX METHOD AT LATE STAGE Fang Wang, and Yuhui Qiu Intelligent Software and Software Engineering Laboratory, Southwest-China Normal University,

More information

STATISTICAL CALIBRATION: A BETTER APPROACH TO INTEGRATING SIMULATION AND TESTING IN GROUND VEHICLE SYSTEMS.

STATISTICAL CALIBRATION: A BETTER APPROACH TO INTEGRATING SIMULATION AND TESTING IN GROUND VEHICLE SYSTEMS. 2016 NDIA GROUND VEHICLE SYSTEMS ENGINEERING and TECHNOLOGY SYMPOSIUM Modeling & Simulation, Testing and Validation (MSTV) Technical Session August 2-4, 2016 - Novi, Michigan STATISTICAL CALIBRATION: A

More information