THE DEVELOPMENT OF THE POTENTIAL AND ACADMIC PROGRAMMES OF WROCLAW UNIVERISTY OF TECHNOLOGY METAHEURISTICS
|
|
- Marcus Gilmore
- 6 years ago
- Views:
Transcription
1 METAHEURISTICS 1. Objectives The goals of the laboratory workshop are as follows: to learn basic properties of evolutionary computation techniques and other metaheuristics for solving various global optimization problems, to study the selected evolutionary strategies, genetic algorithms, and some metaheuristics such as ACO, PSO, and IWO. to train the skills in coding global optimization algorithms in Matlab and using the Matlab s Genetic Algorithm and Direct Search Optimization Toolbox. The workshop is scheduled for 3 academic hours.. Introduction In computer science, metaheuristic designates a computational method that optimizes a problem by trying to improve iteratively a candidate solution with regard to a given measure of quality. Metaheuristics make few or no assumptions about the problem being optimized and can search very large spaces of candidate solutions. However, metaheuristics do not guarantee an optimal solution is ever found. Other terms having a similar meaning as metaheuristic are: derivative-free, direct search, black-box, or just heuristic optimizer. Many metaheuristics implement some form of stochastic optimization. Metaheuristics are used for combinatorial optimization in which an optimal solution is sought over a discrete search-space. Metaheuristics are also used for problems over realvalued search-spaces, where the classic way of optimization is to derive the gradient of the function to be optimized and then employ gradient descent or a quasi-newton method. Metaheuristics do not use the gradient or Hessian matrix so their advantage is that the function to be optimized need not be continuous or differentiable and it can also have constraints. 3. Preparation. The expected time needed for the preparation to this workshop is 9 hours Reading [1]. T. Back, Evolutionary Algorithms in Theory and Practice, New York, Oxford University Press, 1996, []. The Handbook of Evolutionary Computation, Editors: T. Back, D. B. Fogel, Z. Michalewicz, New York, Oxford University Press, 1996, Project co-financed by European Union within European Social Fund 1
2 [3]. T. Weise, Global Optimization Algorithms Theory and Application, e-book, 009, [4]. A. R. Mehrabian, C. Lucas, A Novel Numerical Optimization Algorithm Inspired from Weed Colonization, Ecological Informatics, Vol. 1, No. 4, 006, pp , [5]. J. Arabas, Wykłady z algorytmów ewolucyjnych, WNT, Problems At the beginning of the laboratory workshop each student should know the answers to the following questions: What is a NP-hard problem? What is a fitness function? What are fundamental groups of evolutionary strategies? What is a chromosome or genotype? What is a phenotype? What are the basic genetic operators? What are the roulette-wheel and tournament selections? What is the elitist strategy? What are typical crossover techniques? How to apply the evolutionary algorithms to constrained optimization problems? What is a fundamental strategy in the Simulated Annealing (SA) algorithm? What is a fundamental strategy in the Tabu-Search (TS) algorithm? What is a fundamental strategy in the Ant Colony Optimization (ACO) algorithm? What is a fundamental strategy in the Particle Swarm Optimization (PSO) algorithm? What is a fundamental strategy in the Invasive Weed Optimization (IWO) algorithm? 3.3. Detailed preparation Each group of students ( 3 persons) is expected to accomplish the following tasks: 1. formulate LP problems in the matrix form for some typical engineering problems (listed below),. code the selected global optimization algorithms in Matlab, 3. compare the results (convergence rate, elapsed time, etc.) obtained with the coded algorithms and with the functions ga(.), gamultiobj(.), and simulannealbnd(.) in Matlab, 4. draw the conclusions. Project co-financed by European Union within European Social Fund
3 Problems to be modeled The following problems should be solved with the selected global optimization algorithms. Problem 1: Find the global minimum of the Griewank function for n =, 3, : n n 1 xi f ( x) = xi cos i= 1 i= 1 i +. Illustrate this function graphically on a D contour plot and a 3D surface plot. Show its fitness versus evolutionary process. Problem : Find the global minimum of the Rastrigin function for n =, 3, : n i= 1 ( i 10 cos i 10) f ( x) = x ( π x ) +. Illustrate this function graphically on a D contour plot and a 3D surface plot. Show its fitness versus evolutionary process. Problem 3: Find the global minimum of the function: f ( x) x exp for x 0 = 0 exp{ 1} + ( x 0)( x ) for x > 0 for x [ 15 4]. Illustrate this function graphically, and show its fitness versus evolutionary process. Problem 4: Find the global minimum of the Rosenbrock's function: ( ) = ( ) + ( ) f x 100 x x 1 x, 1 1 s.t. xx 1 + x1 x , 10 xx 0, 1 0 x 1, 1 0 x 13, Illustrate this function graphically on a D contour plot and a 3D surface plot. Show its fitness versus evolutionary process. Problem 5: Find the global minima of the following function: Project co-financed by European Union within European Social Fund 3
4 4 x ( ) 1 f x = 4.1x1 + x1 + x1x + ( 4x 4) x, 3 for 3 x1 3 and x. Illustrate this function graphically on a D contour plot and a 3D surface plot. Show its fitness versus evolutionary process. Problem 6: Find the global minimum of the Easom function: { } ( ) cos( ) cos( ) exp ( π) ( π) f x = x x x x, 1 1 for 100 x i 100, i = 1,. Illustrate this function graphically on a D contour plot and a 3D surface plot. Show its fitness versus evolutionary process. Problem 7: Find the global minimum of the modified Sombrero function: n cos xi i= 1 f ( x) =, n 4 xi + 1 i= 1 for 10 x i 10, i = 1,. Illustrate this function graphically on a D contour plot and a 3D surface plot. Show its fitness versus evolutionary process. Algorithms to be coded Students are expected to code the following algorithms and apply them to the abovementioned global optimization problems. Algorithm 1: The evolutionary strategy (1+1), [1], Chapter, Section.1.7, pp , Algorithm 5, Algorithm : The evolutionary strategy ( μ, λ ), [1], Chapter, Section.1.6, pp , Algorithm 4, Algorithm 3: The evolutionary strategy ( μ + λ ), [1], Chapter, Section.1.6, pp , Algorithm 4, Algorithm 4: The genetic algorithm (general form), [1], Chapter, Section.3.6, pp , Algorithm 8. Test various options: encoding: binary or gray; selection: roulette-wheel, linear ranking, stochastic universal sampling or tournament; crossover: one-point, two-point, multi-point, uniform; mutation: with or without binary mask; elitism or pure succession, using different values of the parameters (e.g. probability of mutations, size of the base population, etc.). Algorithm 5: The PSO algorithm: [3], Chapter 9, pp. 49 5, Algorithm 9.1, Project co-financed by European Union within European Social Fund 4
5 Algorithm 6: The SA algorithm: [3], Chapter 1, pp , Algorithm 1.1, Algorithm 7: The TS algorithm: [3], Chapter 14, pp , Algorithm 14.1, Algorithm 8: The IWO algorithm: [4], pp Content of report The report should contain: introductory page, detailed mathematical description of the analyzed problems, a basic description of the coded algorithms, the Matlab code (together with the detailed end-line comments) of the analyzed algorithm, the results obtained with the coded algorithms, the results obtained with the Matlab functions included in the selected Matlab toolboxes, conclusions The section Results should present the final solutions (for a D case the final solution marked on the feasible set), the convergence behavior (e.g. error norm between the approximate solution and the exact one or residuals), the elapsed time, and the comparison to the results obtained with the functions included in the selected Matlab s toolboxes. 5. Appendix: The Appendix contains the syntax of the ga function. Syntax GA attempts to solve problems of the form: min F(X) subject to: A*X <= B, Aeq*X = Beq (linear constraints) X C(X) <= 0, Ceq(X) = 0 (nonlinear constraints) LB <= X <= ub X = GA(FITNESSFCN,NVARS) finds a local unconstrained minimum X to the FITNESSFCN using GA. NVARS is the dimension (number of design variables) of the FITNESSFCN. FITNESSFCN accepts a vector X of size 1-by-NVARS, and returns a scalar evaluated at X. X = GA(FITNESSFCN,NVARS,A,b) finds a local minimum X to the function FITNESSFCN, subject to the linear inequalities A*X <= B. Linear constraints are not satisfied when the PopulationType option is set to 'bitstring' or 'custom'. See the documentation for details. Project co-financed by European Union within European Social Fund 5
6 X = GA(FITNESSFCN,NVARS,A,b,Aeq,beq) finds a local minimum X to the function FITNESSFCN, subject to the linear equalities Aeq*X = beq as well as A*X <= B. (Set A=[] and B=[] if no inequalities exist.) Linear constraints are not satisfied when the PopulationType option is set to 'bitstring' or 'custom'. See the documentation for details. X = GA(FITNESSFCN,NVARS,A,b,Aeq,beq,lb,ub) defines a set of lower and upper bounds on the design variables, X, so that a solution is found in the range lb <= X <= ub. Use empty matrices for lb and ub if no bounds exist. Set lb(i) = -Inf if X(i) is unbounded below; set ub(i) = Inf if X(i) is unbounded above. Linear constraints are not satisfied when the PopulationType option is set to 'bitstring' or 'custom'. See the documentation for details. X = GA(FITNESSFCN,NVARS,A,b,Aeq,beq,lb,ub,NONLCON) subjects the minimization to the constraints defined in NONLCON. The function NONLCON accepts X and returns the vectors C and Ceq, representing the nonlinear inequalities and equalities respectively. GA minimizes FITNESSFCN such that C(X)<=0 and Ceq(X)=0. (Set lb=[] and/or ub=[] if no bounds exist.) Nonlinear constraints are not satisfied when the PopulationType option is set to 'bitstring' or 'custom'. See the documentation for details. X = GA(FITNESSFCN,NVARS,A,b,Aeq,beq,lb,ub,NONLCON,options) minimizes with the default optimization parameters replaced by values in the structure OPTIONS. OPTIONS can be created with the GAOPTIMSET function. X = GA(PROBLEM) finds the minimum for PROBLEM. PROBLEM is a structure that has the following fields: fitnessfcn: <Fitness function> nvars: <Number of design variables> Aineq: <A matrix for inequality constraints> bineq: <b vector for inequality constraints> Aeq: <Aeq matrix for equality constraints> beq: <beq vector for equality constraints> lb: <Lower bound on X> ub: <Upper bound on X> nonlcon: <nonlinear constraint function> options: <Options structure created with GAOPTIMSET> randstate: <State of the uniform random number generator> randnstate: <State of the normal random number generator> [X,FVAL] = GA(FITNESSFCN,...) returns FVAL, the value of the fitness function FITNESSFCN at the solution X. [X,FVAL,EXITFLAG] = GA(FITNESSFCN,...) returns EXITFLAG which describes the exit condition of GA. Possible values of EXITFLAG and the corresponding exit conditions are 1 Average change in value of the fitness function over options.stallgenlimit generations less than options.tolfun and constraint violation less than options.tolcon. Project co-financed by European Union within European Social Fund 6
7 3 The value of the fitness function did not change in options.stallgenlimit generations and constraint violation less than options.tolcon. 4 Magnitude of step smaller than machine precision and constraint violation less than options.tolcon. This exit condition applies only to nonlinear constraints. 5 Fitness limit reached and constraint violation less than options.tolcon. 0 Maximum number of generations exceeded. -1 Optimization terminated by the output or plot function. - No feasible point found. -4 Stall time limit exceeded. -5 Time limit exceeded. [X,FVAL,EXITFLAG,OUTPUT] = GA(FITNESSFCN,...) returns a structure OUTPUT with the following information: randstate: <State of the function RAND used before GA started> randnstate: <State of the function RANDN used before GA started> generations: <Total generations, excluding HybridFcn iterations> funccount: <Total function evaluations> maxconstraint: <Maximum constraint violation>, if any message: <GA termination message> [X,FVAL,EXITFLAG,OUTPUT,POPULATION] = GA(FITNESSFCN,...) returns the final POPULATION at termination. [X,FVAL,EXITFLAG,OUTPUT,POPULATION,SCORES] = GA(FITNESSFCN,...) returns the SCORES of the final POPULATION. Example: Unconstrained minimization of 'rastriginsfcn' fitness function of numberofvariables = x = ga(@rastriginsfcn,) Display plotting functions while GA minimizes options = gaoptimset('plotfcns',... {@gaplotbestf,@gaplotbestindiv,@gaplotexpectation,@gaplotstopping}); [x,fval,exitflag,output] = ga(@rastriginsfcn,,[],[],[],[],[],[],[],options) An example with inequality constraints and lower bounds A = [1 1; -1 ; 1]; b = [; ; 3]; lb = zeros(,1); % Use mutation function which can handle constraints options = gaoptimset('mutationfcn',@mutationadaptfeasible); [x,fval,exitflag] = ga(@lincontest6,,a,b,[],[],lb,[],[],options); FITNESSFCN can also be an anonymous function: x = ga(@(x) 3*sin(x(1))+exp(x()),) If FITNESSFCN or NONLCON are parameterized, you can use anonymous functions to capture the problem-dependent parameters. Suppose you want to minimize the fitness given in the function myfit, subject to the nonlinear constraint myconstr, where these two functions are parameterized by their second argument a1 and a, respectively. Here myfit and myconstr are M-file functions such as Project co-financed by European Union within European Social Fund 7
8 and function f = myfit(x,a1) f = exp(x(1))*(4*x(1)^ + *x()^ + 4*x(1)*x() + *x() + a1); function [c,ceq] = myconstr(x,a) c = [1.5 + x(1)*x() - x(1) - x(); -x(1)*x() - a]; % No nonlinear equality constraints: ceq = []; To optimize for specific values of a1 and a, first assign the values to these two parameters. Then create two one-argument anonymous functions that capture the values of a1 and a, and call myfit and myconstr with two arguments. Finally, pass these anonymous functions to GA: a1 = 1; a = 10; % define parameters first % Mutation function for constrained minimization options = gaoptimset('mutationfcn',@mutationadaptfeasible); x = ga(@(x)myfit(x,a1),,[],[],[],[],[],[],@(x)myconstr(x,a),options) Project co-financed by European Union within European Social Fund 8
Laboratorio di Algoritmi Genetici
Laboratorio di Algoritmi Genetici Ruggero Donida Labati Dipartimento di Tecnologie dell Informazione via Bramante 65, 26013 Crema (CR), Italy ruggero.donida@unimi.it Why? You can apply the genetic algorithm
More informationGenetic Algorithm and Direct Search Toolbox 2 User s Guide
Genetic Algorithm and Direct Search Toolbox 2 User s Guide How to Contact The MathWorks www.mathworks.com Web comp.soft-sys.matlab Newsgroup www.mathworks.com/contact_ts.html Technical Support suggest@mathworks.com
More informationGenetic Algorithm and Direct Search Toolbox For Use with MATLAB
Genetic Algorithm and Direct Search Toolbox For Use with MATLAB Computation Visualization Programming User s Guide Version 2 How to Contact The MathWorks www.mathworks.com Web comp.soft-sys.matlab Newsgroup
More informationCT79 SOFT COMPUTING ALCCS-FEB 2014
Q.1 a. Define Union, Intersection and complement operations of Fuzzy sets. For fuzzy sets A and B Figure Fuzzy sets A & B The union of two fuzzy sets A and B is a fuzzy set C, written as C=AUB or C=A OR
More informationComparison of Some Evolutionary Algorithms for Approximate Solutions of Optimal Control Problems
Australian Journal of Basic and Applied Sciences, 4(8): 3366-3382, 21 ISSN 1991-8178 Comparison of Some Evolutionary Algorithms for Approximate Solutions of Optimal Control Problems Akbar H. Borzabadi,
More informationMulti-objective Optimization
Some introductory figures from : Deb Kalyanmoy, Multi-Objective Optimization using Evolutionary Algorithms, Wiley 2001 Multi-objective Optimization Implementation of Constrained GA Based on NSGA-II Optimization
More informationMeta- 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 informationTHE DEVELOPMENT OF THE POTENTIAL AND ACADMIC PROGRAMMES OF WROCLAW UNIVERISTY OF TECH- NOLOGY ITERATIVE LINEAR SOLVERS
ITERATIVE LIEAR SOLVERS. Objectives The goals of the laboratory workshop are as follows: to learn basic properties of iterative methods for solving linear least squares problems, to study the properties
More informationMETAHEURISTIC. Jacques A. Ferland Department of Informatique and Recherche Opérationnelle Université de Montréal.
METAHEURISTIC Jacques A. Ferland Department of Informatique and Recherche Opérationnelle Université de Montréal ferland@iro.umontreal.ca March 2015 Overview Heuristic Constructive Techniques: Generate
More informationARTIFICIAL 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 informationGenetic Algorithm and Direct Search Toolbox
Genetic Algorithm and Direct Search Toolbox For Use with MATLAB User s Guide Version 1 How to Contact The MathWorks: www.mathworks.com comp.soft-sys.matlab support@mathworks.com suggest@mathworks.com bugs@mathworks.com
More informationOptimization in MATLAB Seth DeLand
Optimization in MATLAB Seth DeLand 4 The MathWorks, Inc. Topics Intro Using gradient-based solvers Optimization in Comp. Finance toolboxes Global optimization Speeding up your optimizations Optimization
More informationDERIVATIVE-FREE OPTIMIZATION
DERIVATIVE-FREE OPTIMIZATION Main bibliography J.-S. Jang, C.-T. Sun and E. Mizutani. Neuro-Fuzzy and Soft Computing: A Computational Approach to Learning and Machine Intelligence. Prentice Hall, New Jersey,
More informationAppendix A MATLAB s Optimization Toolbox Algorithms
Appendix A MATLAB s Optimization Toolbox Algorithms Abstract MATLAB s Optimization Toolbox (version 7:2) includes a family of algorithms for solving optimization problems. The toolbox provides functions
More informationThe Genetic Algorithm for finding the maxima of single-variable functions
Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 46-54 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.com The Genetic Algorithm for finding
More informationOptimal Reactive Power Dispatch Using Hybrid Loop-Genetic Based Algorithm
Optimal Reactive Power Dispatch Using Hybrid Loop-Genetic Based Algorithm Md Sajjad Alam Student Department of Electrical Engineering National Institute of Technology, Patna Patna-800005, Bihar, India
More informationIntroduction to Optimization
Introduction to Optimization Approximation Algorithms and Heuristics November 6, 2015 École Centrale Paris, Châtenay-Malabry, France Dimo Brockhoff INRIA Lille Nord Europe 2 Exercise: The Knapsack Problem
More informationData 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 informationIntroduction 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 informationIntroduction to Optimization
Introduction to Optimization Randomized Search Heuristics + Introduction to Continuous Optimization I November 25, 2016 École Centrale Paris, Châtenay-Malabry, France Dimo Brockhoff INRIA Saclay Ile-de-France
More informationABC Optimization: A Co-Operative Learning Approach to Complex Routing Problems
Progress in Nonlinear Dynamics and Chaos Vol. 1, 2013, 39-46 ISSN: 2321 9238 (online) Published on 3 June 2013 www.researchmathsci.org Progress in ABC Optimization: A Co-Operative Learning Approach to
More informationAN IMPROVED ITERATIVE METHOD FOR SOLVING GENERAL SYSTEM OF EQUATIONS VIA GENETIC ALGORITHMS
AN IMPROVED ITERATIVE METHOD FOR SOLVING GENERAL SYSTEM OF EQUATIONS VIA GENETIC ALGORITHMS Seyed Abolfazl Shahzadehfazeli 1, Zainab Haji Abootorabi,3 1 Parallel Processing Laboratory, Yazd University,
More informationArtificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems
Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems Dervis Karaboga and Bahriye Basturk Erciyes University, Engineering Faculty, The Department of Computer
More informationGenetic Algorithms Variations and Implementation Issues
Genetic Algorithms Variations and Implementation Issues CS 431 Advanced Topics in AI Classic Genetic Algorithms GAs as proposed by Holland had the following properties: Randomly generated population Binary
More informationGA 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 informationCHAPTER 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 informationA Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery
A Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery Monika Sharma 1, Deepak Sharma 2 1 Research Scholar Department of Computer Science and Engineering, NNSS SGI Samalkha,
More informationMETAHEURISTICS. Introduction. Introduction. Nature of metaheuristics. Local improvement procedure. Example: objective function
Introduction METAHEURISTICS Some problems are so complicated that are not possible to solve for an optimal solution. In these problems, it is still important to find a good feasible solution close to the
More informationThe Design of Pole Placement With Integral Controllers for Gryphon Robot Using Three Evolutionary Algorithms
The Design of Pole Placement With Integral Controllers for Gryphon Robot Using Three Evolutionary Algorithms Somayyeh Nalan-Ahmadabad and Sehraneh Ghaemi Abstract In this paper, pole placement with integral
More informationOPTIMIZATION EVOLUTIONARY ALGORITHMS. Biologically-Inspired and. Computer Intelligence. Wiley. Population-Based Approaches to.
EVOLUTIONARY OPTIMIZATION ALGORITHMS Biologically-Inspired and Population-Based Approaches to Computer Intelligence Dan Simon Cleveland State University Wiley DETAILED TABLE OF CONTENTS Acknowledgments
More informationOptimization in Scilab
Scilab sheet Optimization in Scilab Scilab provides a high-level matrix language and allows to define complex mathematical models and to easily connect to existing libraries. That is why optimization is
More informationREAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION. Nedim TUTKUN
REAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION Nedim TUTKUN nedimtutkun@gmail.com Outlines Unconstrained Optimization Ackley s Function GA Approach for Ackley s Function Nonlinear Programming Penalty
More informationAn 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 informationSanta Fe Trail Problem Solution Using Grammatical Evolution
2012 International Conference on Industrial and Intelligent Information (ICIII 2012) IPCSIT vol.31 (2012) (2012) IACSIT Press, Singapore Santa Fe Trail Problem Solution Using Grammatical Evolution Hideyuki
More informationOpportunistic Self Organizing Migrating Algorithm for Real-Time Dynamic Traveling Salesman Problem
Opportunistic Self Organizing Migrating Algorithm for Real-Time Dynamic Traveling Salesman Problem arxiv:1709.03793v1 [cs.ne] 12 Sep 2017 Shubham Dokania, Sunyam Bagga, and Rohit Sharma shubham.k.dokania@gmail.com,
More informationOptimization of Makespan and Mean Flow Time for Job Shop Scheduling Problem FT06 Using ACO
Optimization of Makespan and Mean Flow Time for Job Shop Scheduling Problem FT06 Using ACO Nasir Mehmood1, Muhammad Umer2, Dr. Riaz Ahmad3, Dr. Amer Farhan Rafique4 F. Author, Nasir Mehmood is with National
More informationACONM: A hybrid of Ant Colony Optimization and Nelder-Mead Simplex Search
ACONM: A hybrid of Ant Colony Optimization and Nelder-Mead Simplex Search N. Arun & V.Ravi* Assistant Professor Institute for Development and Research in Banking Technology (IDRBT), Castle Hills Road #1,
More informationAn Evolutionary Algorithm for the Multi-objective Shortest Path Problem
An Evolutionary Algorithm for the Multi-objective Shortest Path Problem Fangguo He Huan Qi Qiong Fan Institute of Systems Engineering, Huazhong University of Science & Technology, Wuhan 430074, P. R. China
More informationChaos Genetic Algorithm Instead Genetic Algorithm
The International Arab Journal of Information Technology, Vol. 12, No. 2, March 215 163 Chaos Genetic Algorithm Instead Genetic Algorithm Mohammad Javidi and Roghiyeh Hosseinpourfard Faculty of Mathematics
More informationA Combinatorial Algorithm for The Cardinality Constrained Portfolio Optimization Problem
0 IEEE Congress on Evolutionary Computation (CEC) July -, 0, Beijing, China A Combinatorial Algorithm for The Cardinality Constrained Portfolio Optimization Problem Tianxiang Cui, Shi Cheng, and Ruibin
More informationLecture 4. Convexity Robust cost functions Optimizing non-convex functions. 3B1B Optimization Michaelmas 2017 A. Zisserman
Lecture 4 3B1B Optimization Michaelmas 2017 A. Zisserman Convexity Robust cost functions Optimizing non-convex functions grid search branch and bound simulated annealing evolutionary optimization The Optimization
More informationLuo, 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 informationCHAPTER 4 GENETIC ALGORITHM
69 CHAPTER 4 GENETIC ALGORITHM 4.1 INTRODUCTION Genetic Algorithms (GAs) were first proposed by John Holland (Holland 1975) whose ideas were applied and expanded on by Goldberg (Goldberg 1989). GAs is
More informationA Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2
Chapter 5 A Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2 Graph Matching has attracted the exploration of applying new computing paradigms because of the large number of applications
More informationOptimization of Benchmark Functions Using Genetic Algorithm
Optimization of Benchmark s Using Genetic Algorithm Vinod Goyal GJUS&T, Hisar Sakshi Dhingra GJUS&T, Hisar Jyoti Goyat GJUS&T, Hisar Dr Sanjay Singla IET Bhaddal Technical Campus, Ropar, Punjab Abstrat
More informationAPPLIED OPTIMIZATION WITH MATLAB PROGRAMMING
APPLIED OPTIMIZATION WITH MATLAB PROGRAMMING Second Edition P. Venkataraman Rochester Institute of Technology WILEY JOHN WILEY & SONS, INC. CONTENTS PREFACE xiii 1 Introduction 1 1.1. Optimization Fundamentals
More informationChapter 14 Global Search Algorithms
Chapter 14 Global Search Algorithms An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Introduction We discuss various search methods that attempts to search throughout the entire feasible set.
More informationInternational Journal of Digital Application & Contemporary research Website: (Volume 1, Issue 7, February 2013)
Performance Analysis of GA and PSO over Economic Load Dispatch Problem Sakshi Rajpoot sakshirajpoot1988@gmail.com Dr. Sandeep Bhongade sandeepbhongade@rediffmail.com Abstract Economic Load dispatch problem
More informationIntroduction to Design Optimization: Search Methods
Introduction to Design Optimization: Search Methods 1-D Optimization The Search We don t know the curve. Given α, we can calculate f(α). By inspecting some points, we try to find the approximated shape
More informationConstrained Functions of N Variables: Non-Gradient Based Methods
onstrained Functions of N Variables: Non-Gradient Based Methods Gerhard Venter Stellenbosch University Outline Outline onstrained Optimization Non-gradient based methods Genetic Algorithms (GA) Particle
More informationPROJECT REPORT. Parallel Optimization in Matlab. Joakim Agnarsson, Mikael Sunde, Inna Ermilova Project in Computational Science: Report January 2013
Parallel Optimization in Matlab Joakim Agnarsson, Mikael Sunde, Inna Ermilova Project in Computational Science: Report January 2013 PROJECT REPORT Department of Information Technology Contents 1 Introduction
More informationEvolutionary Methods for State-based Testing
Evolutionary Methods for State-based Testing PhD Student Raluca Lefticaru Supervised by Florentin Ipate University of Piteşti, Romania Department of Computer Science Outline Motivation Search-based software
More informationAn Adaptive Genetic Algorithm for Solving N- Queens Problem
An Adaptive Genetic Algorithm for Solving N- ueens Problem Uddalok Sarkar 1, * Sayan Nag 1 1 Department of Electrical Engineering Jadavpur University Kolkata, India uddaloksarkar@gmail.com, * nagsayan112358@gmail.com
More informationCrew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm. Santos and Mateus (2007)
In the name of God Crew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm Spring 2009 Instructor: Dr. Masoud Yaghini Outlines Problem Definition Modeling As A Set Partitioning
More informationThe Binary Genetic Algorithm. Universidad de los Andes-CODENSA
The Binary Genetic Algorithm Universidad de los Andes-CODENSA 1. Genetic Algorithms: Natural Selection on a Computer Figure 1 shows the analogy between biological i l evolution and a binary GA. Both start
More informationA Particle Swarm Optimization Algorithm for Solving Flexible Job-Shop Scheduling Problem
2011, TextRoad Publication ISSN 2090-4304 Journal of Basic and Applied Scientific Research www.textroad.com A Particle Swarm Optimization Algorithm for Solving Flexible Job-Shop Scheduling Problem Mohammad
More informationChapter 3 Numerical Methods
Chapter 3 Numerical Methods Part 1 3.1 Linearization and Optimization of Functions of Vectors 1 Problem Notation 2 Outline 3.1.1 Linearization 3.1.2 Optimization of Objective Functions 3.1.3 Constrained
More informationLecture Set 1B. S.D. Sudhoff Spring 2010
Lecture Set 1B More Basic Tools S.D. Sudhoff Spring 2010 1 Outline Time Domain Simulation (ECE546, MA514) Basic Methods for Time Domain Simulation MATLAB ACSL Single and Multi-Objective Optimization (ECE580)
More informationATI Material Do Not Duplicate ATI Material. www. ATIcourses.com. www. ATIcourses.com
ATI Material Material Do Not Duplicate ATI Material Boost Your Skills with On-Site Courses Tailored to Your Needs www.aticourses.com The Applied Technology Institute specializes in training programs for
More informationThe Coral Reefs Optimization Algorithm: An Efficient Meta-heuristic for Solving Hard Optimization Problems
The Coral Reefs Optimization Algorithm: An Efficient Meta-heuristic for Solving Hard Optimization Problems S. Salcedo-Sanz 1, J. Del Ser 2, I. Landa-Torres 2, S. Gil-López 2, and A. Portilla-Figueras 1
More informationUsing Genetic Algorithms to optimize ACS-TSP
Using Genetic Algorithms to optimize ACS-TSP Marcin L. Pilat and Tony White School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, K1S 5B6, Canada {mpilat,arpwhite}@scs.carleton.ca
More informationMETAHEURISTICS Genetic Algorithm
METAHEURISTICS Genetic Algorithm Jacques A. Ferland Department of Informatique and Recherche Opérationnelle Université de Montréal ferland@iro.umontreal.ca Genetic Algorithm (GA) Population based algorithm
More informationCHAPTER 6 REAL-VALUED GENETIC ALGORITHMS
CHAPTER 6 REAL-VALUED GENETIC ALGORITHMS 6.1 Introduction Gradient-based algorithms have some weaknesses relative to engineering optimization. Specifically, it is difficult to use gradient-based algorithms
More informationHybrid Optimization Coupling Electromagnetism and Descent Search for Engineering Problems
Proceedings of the International Conference on Computational and Mathematical Methods in Science and Engineering, CMMSE 2008 13 17 June 2008. Hybrid Optimization Coupling Electromagnetism and Descent Search
More informationGlobal Optimization. for practical engineering applications. Harry Lee 4/9/2018 CEE 696
Global Optimization for practical engineering applications Harry Lee 4/9/2018 CEE 696 Table of contents 1. Global Optimization 1 Global Optimization Global optimization Figure 1: Fig 2.2 from Nocedal &
More informationHYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS
HYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS NABEEL AL-MILLI Financial and Business Administration and Computer Science Department Zarqa University College Al-Balqa'
More informationAvailable online at ScienceDirect. Procedia CIRP 44 (2016 )
Available online at www.sciencedirect.com ScienceDirect Procedia CIRP 44 (2016 ) 102 107 6th CIRP Conference on Assembly Technologies and Systems (CATS) Worker skills and equipment optimization in assembly
More informationThe Modified IWO Algorithm for Optimization of Numerical Functions
The Modified IWO Algorithm for Optimization of Numerical Functions Daniel Kostrzewa and Henryk Josiński Silesian University of Technology, Akademicka 16 PL-44-100 Gliwice, Poland {Daniel.Kostrzewa,Henryk.Josinski}@polsl.pl
More informationContents. I Basics 1. Copyright by SIAM. Unauthorized reproduction of this article is prohibited.
page v Preface xiii I Basics 1 1 Optimization Models 3 1.1 Introduction... 3 1.2 Optimization: An Informal Introduction... 4 1.3 Linear Equations... 7 1.4 Linear Optimization... 10 Exercises... 12 1.5
More informationGenetic Algorithms for Vision and Pattern Recognition
Genetic Algorithms for Vision and Pattern Recognition Faiz Ul Wahab 11/8/2014 1 Objective To solve for optimization of computer vision problems using genetic algorithms 11/8/2014 2 Timeline Problem: Computer
More informationPre-requisite Material for Course Heuristics and Approximation Algorithms
Pre-requisite Material for Course Heuristics and Approximation Algorithms This document contains an overview of the basic concepts that are needed in preparation to participate in the course. In addition,
More informationIntroduction to Genetic Algorithms. Based on Chapter 10 of Marsland Chapter 9 of Mitchell
Introduction to Genetic Algorithms Based on Chapter 10 of Marsland Chapter 9 of Mitchell Genetic Algorithms - History Pioneered by John Holland in the 1970s Became popular in the late 1980s Based on ideas
More informationA Survey of Solving Approaches for Multiple Objective Flexible Job Shop Scheduling Problems
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 15, No 2 Sofia 2015 Print ISSN: 1311-9702; Online ISSN: 1314-4081 DOI: 10.1515/cait-2015-0025 A Survey of Solving Approaches
More informationDuelist Algorithm: An Algorithm in Stochastic Optimization Method
Duelist Algorithm: An Algorithm in Stochastic Optimization Method Totok Ruki Biyanto Department of Engineering Physics Insititut Teknologi Sepuluh Nopember Surabaya, Indoneisa trb@ep.its.ac.id Henokh Yernias
More informationSPATIAL OPTIMIZATION METHODS
DELMELLE E. (2010). SPATIAL OPTIMIZATION METHODS. IN: B. WHARF (ED). ENCYCLOPEDIA OF HUMAN GEOGRAPHY: 2657-2659. SPATIAL OPTIMIZATION METHODS Spatial optimization is concerned with maximizing or minimizing
More informationCS5401 FS2015 Exam 1 Key
CS5401 FS2015 Exam 1 Key This is a closed-book, closed-notes exam. The only items you are allowed to use are writing implements. Mark each sheet of paper you use with your name and the string cs5401fs2015
More informationThe Simple Genetic Algorithm Performance: A Comparative Study on the Operators Combination
INFOCOMP 20 : The First International Conference on Advanced Communications and Computation The Simple Genetic Algorithm Performance: A Comparative Study on the Operators Combination Delmar Broglio Carvalho,
More informationNumerical Optimization: Introduction and gradient-based methods
Numerical Optimization: Introduction and gradient-based methods Master 2 Recherche LRI Apprentissage Statistique et Optimisation Anne Auger Inria Saclay-Ile-de-France November 2011 http://tao.lri.fr/tiki-index.php?page=courses
More informationAvailable online at ScienceDirect. Razvan Cazacu*, Lucian Grama
Available online at www.sciencedirect.com ScienceDirect Procedia Technology 12 ( 2014 ) 339 346 The 7 th International Conference Interdisciplinarity in Engineering (INTER-ENG 2013) Steel truss optimization
More informationMeta Heuristic and Evolutionary Algorithms for Engineering Optimization
Meta Heuristic and Evolutionary Algorithms for Engineering Optimization Wiley Series in Operations Research and Management Science A complete list of the titles in this series appears at the end of this
More informationPartial Opposition-based Learning Using Current Best Candidate Solution
Partial Opposition-based Learning Using Current Best Candidate Solution Sedigheh Mahdavi Department of Electrical, Computer, and Software Engineering University of Ontario Institute of Technology (UOIT)
More informationBinary Differential Evolution Strategies
Binary Differential Evolution Strategies A.P. Engelbrecht, Member, IEEE G. Pampará Abstract Differential evolution has shown to be a very powerful, yet simple, population-based optimization approach. The
More informationGenetic Algorithm using Theory of Chaos
Procedia Computer Science Volume 51, 2015, Pages 316 325 ICCS 2015 International Conference On Computational Science Genetic Algorithm using Theory of Chaos Petra Snaselova and Frantisek Zboril Faculty
More informationGeneration of Ultra Side lobe levels in Circular Array Antennas using Evolutionary Algorithms
Generation of Ultra Side lobe levels in Circular Array Antennas using Evolutionary Algorithms D. Prabhakar Associate Professor, Dept of ECE DVR & Dr. HS MIC College of Technology Kanchikacherla, AP, India.
More informationSolving Optimization Problems with MATLAB Loren Shure
Solving Optimization Problems with MATLAB Loren Shure 6 The MathWorks, Inc. Topics Introduction Least-squares minimization Nonlinear optimization Mied-integer programming Global optimization Optimization
More informationIntroduction to Design Optimization: Search Methods
Introduction to Design Optimization: Search Methods 1-D Optimization The Search We don t know the curve. Given α, we can calculate f(α). By inspecting some points, we try to find the approximated shape
More informationExtending MATLAB and GA to Solve Job Shop Manufacturing Scheduling Problems
Extending MATLAB and GA to Solve Job Shop Manufacturing Scheduling Problems Hamidullah Khan Niazi 1, Sun Hou-Fang 2, Zhang Fa-Ping 3, Riaz Ahmed 4 ( 1, 4 National University of Sciences and Technology
More informationResearch Article A Comparative Analysis of Nature-Inspired Optimization Approaches to 2D Geometric Modelling for Turbomachinery Applications
Mathematical Problems in Engineering Volume 2013, Article ID 716237, 15 pages http://dx.doi.org/10.1155/2013/716237 Research Article A Comparative Analysis of Nature-Inspired Optimization Approaches to
More informationMATLAB Solution of Linear Programming Problems
MATLAB Solution of Linear Programming Problems The simplex method is included in MATLAB using linprog function. All is needed is to have the problem expressed in the terms of MATLAB definitions. Appendix
More informationInternational Journal of Current Research and Modern Education (IJCRME) ISSN (Online): & Impact Factor: Special Issue, NCFTCCPS -
TO SOLVE ECONOMIC DISPATCH PROBLEM USING SFLA P. Sowmya* & Dr. S. P. Umayal** * PG Scholar, Department Electrical and Electronics Engineering, Muthayammal Engineering College, Rasipuram, Tamilnadu ** Dean
More informationOptimal Design of a Parallel Beam System with Elastic Supports to Minimize Flexural Response to Harmonic Loading
11 th World Congress on Structural and Multidisciplinary Optimisation 07 th -12 th, June 2015, Sydney Australia Optimal Design of a Parallel Beam System with Elastic Supports to Minimize Flexural Response
More informationOptimization of Function by using a New MATLAB based Genetic Algorithm Procedure
Optimization of Function by using a New MATLAB based Genetic Algorithm Procedure G.N Purohit Banasthali University Rajasthan Arun Mohan Sherry Institute of Management Technology Ghaziabad, (U.P) Manish
More informationQUANTUM BASED PSO TECHNIQUE FOR IMAGE SEGMENTATION
International Journal of Computer Engineering and Applications, Volume VIII, Issue I, Part I, October 14 QUANTUM BASED PSO TECHNIQUE FOR IMAGE SEGMENTATION Shradha Chawla 1, Vivek Panwar 2 1 Department
More informationCMU-Q Lecture 9: Optimization II: Constrained,Unconstrained Optimization Convex optimization. Teacher: Gianni A. Di Caro
CMU-Q 15-381 Lecture 9: Optimization II: Constrained,Unconstrained Optimization Convex optimization Teacher: Gianni A. Di Caro GLOBAL FUNCTION OPTIMIZATION Find the global maximum of the function f x (and
More informationGenetic Algorithm for optimization using MATLAB
Volume 4, No. 3, March 2013 (Special Issue) International Journal of Advanced Research in Computer Science RESEARCH PAPER Available Online at www.ijarcs.info Genetic Algorithm for optimization using MATLAB
More informationStudy on GA-based matching method of railway vehicle wheels
Available online www.jocpr.com Journal of Chemical and Pharmaceutical Research, 2014, 6(4):536-542 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 Study on GA-based matching method of railway vehicle
More informationA Comparative Study of Genetic Algorithm and Particle Swarm Optimization
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727 PP 18-22 www.iosrjournals.org A Comparative Study of Genetic Algorithm and Particle Swarm Optimization Mrs.D.Shona 1,
More informationACO and other (meta)heuristics for CO
ACO and other (meta)heuristics for CO 32 33 Outline Notes on combinatorial optimization and algorithmic complexity Construction and modification metaheuristics: two complementary ways of searching a solution
More informationLab 4: Evolutionary Computation and Swarm Intelligence
Lab 4: Evolutionary Computation and Swarm Intelligence Introduction Goals The goal of this assignment is to learn about two evolutionary computing methods: genetic algorithms, and particle swarm optimization.
More informationAutomata Construct with Genetic Algorithm
Automata Construct with Genetic Algorithm Vít Fábera Department of Informatics and Telecommunication, Faculty of Transportation Sciences, Czech Technical University, Konviktská 2, Praha, Czech Republic,
More information