This is a JAVA programming assignment. Program a Genetic Algorithm to find an integer number between 0 and 31 that maximizes the function f (x) = x2. The initial procedure is given as below. • Population size: 6 • Crossover probability: 100% • Mutation probability: 5% • Terminating criteria: o When your program produces an average of candidates is equal to or greater than 29, then you can accept it as a terminating condition. • Fitness function: o You can use the function itself ( f (x) = x2)as your fitness function. 1. For the 1st generation, you need to print the process and result of selection, crossover, and mutation operation. you need to print the corresponding integer values and bits (binary values) of selection, crossover, and mutation operation. You also need to decide and print the crossover point and the mutation point. 2. From the 2nd generation, you do not have to print all results of selection, crossover, mutation operations. You can just print the result of each generation. Please provide full program of JAVA file for above.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

This is a JAVA programming assignment. Program a Genetic
Algorithm to find an integer number between 0 and 31 that maximizes the function f (x) = x2.
The initial procedure is given as below.
• Population size: 6
• Crossover probability: 100%
• Mutation probability: 5%
• Terminating criteria:
o When your program produces an average of candidates is equal to or greater than
29, then you can accept it as a terminating condition.
• Fitness function:
o You can use the function itself (
f (x) = x2)as your fitness function.
1. For the 1st generation, you need to print the process and result of selection, crossover, and
mutation operation.
you need to print the corresponding integer values and bits (binary values)
of selection, crossover, and mutation operation. You also need to decide and
print the crossover point and the mutation point.
2. From the 2nd generation, you do not have to print all results of selection, crossover,
mutation operations. You can just print the result of each generation.

Please provide full program of JAVA file for above.

 

Thank You.

Algorithm to find an integer number between 0 and 31 that maximizes the function f(x) = x².
The initial procedure is given as below.
• Population size: 6
• Crossover probability: 100%
Mutation probability: 5%
• Terminating criteria:
o When your program produces an average of candidates is equal to or greater than
29, then you can accept it as a terminating condition.
Fitness function:
o You can use the function itself (ƒ(x) = x²)as your fitness function.
Transcribed Image Text:Algorithm to find an integer number between 0 and 31 that maximizes the function f(x) = x². The initial procedure is given as below. • Population size: 6 • Crossover probability: 100% Mutation probability: 5% • Terminating criteria: o When your program produces an average of candidates is equal to or greater than 29, then you can accept it as a terminating condition. Fitness function: o You can use the function itself (ƒ(x) = x²)as your fitness function.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY