Function optimization is when you find the optimum point of a function, either minimum or maximum. You will be creating Genetic Algorithm to find maximum point of this function: ƒ(x, y) = (l− x)²e¬x²−(y+1)² − (x−x³ − y³) e¯ −µ² where parameters x and y are between -2 and 2. Use a Genetic Algorithm with the population size of 8, the crossover propability of 0.7, and the mutation probability of 0.01. Use total number of generation as 200. Your code should find the (x,y) pair that gives the maximum point and its fitness value f(x,y).

Function optimization is when you find the optimum point of a function, either minimum or maximum. You will be creating Genetic Algorithm to find maximum point of this function: ƒ(x, y) = (l− x)²e¬x²−(y+1)² − (x−x³ − y³) e¯ −µ² where parameters x and y are between -2 and 2. Use a Genetic Algorithm with the population size of 8, the crossover propability of 0.7, and the mutation probability of 0.01. Use total number of generation as 200. Your code should find the (x,y) pair that gives the maximum point and its fitness value f(x,y).

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Plot the following function for -5 ≤ x ≤ 5: y = 1 1+x² The x-values can be generated with x = np.linspace (-5, 5, n), where n refers to the number of x-values generated (you pick a n-value).
A common way of implementing a max function is to look at the sign of a - b. In this case, we can't use a comparison operator on this sign, but we can use multiplication. Let k equal the sign of a - b such that if a - b >= 0, then k is 1. Else, k 0. Let q be the inverse of k.n implement the code:
Write a function solver that takes a non-negative integer upper_bound as an argument, and prints all non-negative integers i line-by-line in ascending order such that i is at most upper_bound, and i+100 and i+268 are perfect squares. Note that the function solver prints the numbers instead of returning them, but you may want to define a helper function is_perfect_square to return whether a number is a perfect square.
4. Write a Julia function called resistance that returns the resistance distance r given the Cholesky factor U of L+ ee" and nodes i and j. rij = resistance (U, i, j)
A sequence (bn)neNo is called strictly increasing if b₁ M. We can represent a sequence (bn) by a Python function that takes n as its argument (of type int) and returns bn (of type float). Write a function threshold_index that takes two arguments: The first one is a Python function representing a strictly increasing, divergent sequence. The second one is a threshold value M. The function threshold_index should return the smallest index n for which the sequence passes the threshold (i.e., bn ≥ M).
Ql: The Collatz conjecture function is defined for a positive integer m as follows. (COO1) g(m) = 3m+1 if m is odd = m/2 if m is even =1 if m=1 The repeated application of the Collatz conjecture function, as follows: g(n), g(g(n)), g(g(g(n))), ... e.g. If m=17, the sequence is 1. g(17) = 52 2. g(52) = 26 3. g(26) = 13 4. g(13) = 40 5. g(40) = 20 6. g(20) = 10 7. g(10) = 5 8. g(5) = 16 9. g(16) = 8 10. g(8) = 4 11. g(4) = 2 12. g(2) = 1 Thus if m=17, apply the function 12 times in order to reach m=1. Use Recursive Function.
Write a function reg3 that, given x and y data vectors, fits a least-squares regression function of the form y ≈ f (x) = ax + b and uses this regression function to return the estimated y value at the input xnew. For example, if x = [7, 2, 3, 4, 5]; y = [3, 2, 1, 0, 1]; xnew = 6, the output should be 1.8378
HW7_2 This problem uses an interpolating polynomial to estimate the area under a curve. Fit the interpolating polynomial to the following set of points. These points are the actual values of f(x) = sin (e* – 2) 0.4 0.8 1.2 1.6 y -0.8415 |-0.4866 0.2236 0.9687 0.1874 a) Plot the function f(x) and the interpolating polynomial, using different colors. Use polyfit and polyval. Also include the data points using discrete point plotting. b) We wish to estimate the area under the curve, but this function is difficult to integrate. Hence, instead 1.6 of finding ° sin(e* – 2) dx (which is the same as finding the area under the curve sin (e* – 2) ), we will compute the area under the interpolating polynomial over the domain 0
Write a function using lgwt() to calculate composite Gausian quadrature using the call I = compositeGauss_integrate(Fun,a,b,n,N) where, - Fun is the name for the function to be integrated, - a is the lower limit of integration, b is the upper limit of integration, - n is the number of points used in each Gaussian quadrature subintervals - N is the number of subintervals. Code: function[I]=compositeGauss_integrate(Fun,a,b,n,N)% Inputs:% Fun - the function being integrated% a - the lower limit of the integration% b - the upper limit of the integration% n - the number of points used in each Gaussian quadrature subintervals% N - the number of subintervals % Outputs:% I - value of integral % calculate the width of each subintervalh=(b-a)/N;% calculate the endpoints of the N subintervalsxs= ;% initialize the integral valueI=0;% for each subinterval, calculate the Gaussian point locations and the weights,% then calculate the weighted sum of the evaluated function at the% Gauss points and…
Higher-order functions are the functions that run with higher than O(n) time complexity.Answer: true, false
For all a and b in the domain of a function f, the function is injective iff f(a) #f(b) a=Db f(a)=f(b) a=b f(a)=f(b) atb o fly)=x iff f(x)=y A Moving to another question will save this response. 5
Interesting, Intersecting def squares_intersect (s1, s2): An axis-aligned square on the two-dimensional plane can be defined as a tuple (x, y, r) where (x, y) are the coordinates of its bottom left corner and r is the length of the side of the square. Given two squares as tuples (x1, yl, r1) and (x2, y2, r2), this function should determine whether these two squares intersect by having at least one point in common, even if that one point is the shared corner point of two squares placed kitty corner (The intersection of two squares can have zero area, if the intersection consists of parts of the one-dimensional edges.) This function should not contain any loops or list comprehensions of any kind, but should compute the result using only integer comparisons and conditional statements. This problem showcases an idea that comes up with some problems of this nature; it is actually far easier to determine that the two axis-aligned squares do not intersect, and negate that answer! Two squares…