Question: Apply Genetic algorithm with the maximization problem of f(x)=x2-x-1, where x is an integer with a range -15x20. At least derive it for 3 generations

Apply Genetic algorithm with the maximization problem of f(x)=x2-x-1, where x is an integer with a range -15≤x≤20. At least derive it for 3 generations with appropriate explanation and represent the results in a tabular format.

Step by Step Solution

★★★★★

3.42 Rating (165 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock

Applying a Genetic algorithm to the maximization problem of fxx2x1 where x is an integer with a rang... View full answer

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!

NB: YOU ARE ONLY REQUIRED TO DO THE DOUBLE ENTRY WHICH IS THE "T" ACCOUNTS Romeo Shakespeare is a retailer of love potions, which he sells in the Papen Market in St Thomas. 2020 February 1 Romeo...

a. Find b,,b,,c, and e, such that the maximization problem of the dual canonical tableau X, x, -1 10 b, 0 2 2 b. -1 3-f =5, = 5, =8 is in basic solution optimal form and such that both the...

In analogy with Problem 49, Cos x = 1 - x2 / 2 + x4 / 24 + R5(x) If 0 ( x ( 1, give a good bound for |R5(x)|. Then use your result to approximate And give a bound for the error? cos x dx

Derive an election algorithm for bidirectional rings that is more efficient than the one presented in this chapter. How many messages are needed for n processes?

Create a 3-machine flow-shop problem with 10 jobs. Then create an artificial 2-machine problem based on your original problem where processing times on the artificial machine are Pi1+Pi2 and Pi2+Pi3...

Use Eulers method with step size 0.2 to estimate ys1d, where ysxd is the solution of the initial-value problem y9 xy 2 x2, ys0d 1.

Develop a genetic algorithm for the problem described in Question 19 assuming that there is a river that divides the city into two parts, West and East, at x 5 km. West and East are connected by a...

Reconsider the traveling salesman problem shown in Prob. 13.1-1. (a) Perform the initialization step and the first iteration of the basic genetic algorithm presented in Sec. 13.4 by hand. Follow the...

Give the name of the algorithm those results from each of the following special cases: a. Local beam search with k = 1. b. Local beam search with one initial state and no limit on the number of...

Professor Jabberwocky of More Famous University read about the FLFU algorithm from the previous problem, and published a paper with a proof that FLFU is optimal. Argue for or against Jabberwockys...

Reconsider the traveling salesman problem shown in Prob. 14.1-1. Using 1-2-3-4-5-1 as the initial trial solution, you are to follow the instructions below for applying the basic simulated annealing...

Among its other features, the MyTVLab website allows customers to purchase MyTVLab LifeStyles merchandise online. To handle payment processing, the management of MyTVLab has contracted with the...

The head of the information systems group at Conway Consulting must assign six new analysts to offices. The following closeness matrix shows the expected frequency of contact between analysts. The...

Which change will increase operating cash flow? Option A Issuing bonds. Option B Reducing accounts receivable. Option C Repurchasing shares. Option D Reducing accounts payable

Pawl Corporation acquired 90% of Snab Corporation on January 1, 2014 for $72,000 cash when Snab's stockholders' equity consisted of $30,000 of Capital Stock and $30,000 of Retained Earnings. The...

Make a Marketing plan Students in a group will choose a particular business, which is completely new and make a MB. CONCLUSIONS Important Instructions: 1. Referencing must be in APA (American...

Realizing that she often doesn't have her students' full attention during class, a professor devises an elaborate device on which to stand while she lectures.(Figure 1)The pulley is placed so that...

(iii) Now express your decision rule instead using only the quantities p(Ck), p(Cj ), p(x|Ck), p(x|Cj ), and relate it to the diagram above. [2 marks] (iv) If the classifier decision rule assigns...

For n-queens problem where n=5, the two randomly selected states are given below. 5 Q Q 5 Q 4 Q 3 Q 43 4 Q 3 2 Q 2Q Q 1 1 Q 1 2 3 4 5 4 1 2 3 4 5 Apply genetic algorithm to generate new states. In...

Apply genetic algorithm to solve traveling salesman problem

There is a knapsack with a maximum capacity of 1 0 units, and you have 4 items = ( 1 , 2 , 3 , 4 ) with corresponding weights = ( 2 , 3 , 4 , 3 ) and values = ( 8 , 5 , 7 , 2 ) accordingly. The goal...

Question 2 COMPUTER TASK The travelling salesman problem asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that...

[ 1 0 Points ] There is a knapsack with a maximum capacity of 1 0 units, and you have 4 items = ( 1 , 2 , 3 , 4 ) with corresponding weights = ( 2 , 3 , 4 , 3 ) and values = ( 8 , 5 , 7 , 2 )...