Suppose a genetic algorithm uses chromosomes of the form x = abcdefgh with a fixed length of eight genes. Each gene can be any digit between O and 9. Let the fitness of individual x be calculated as: f(x) = (a + b) – (c + d) + (e + f) – (g + h) and let the initial population consist of four individuals with the following chromosomes: x1 = 6 5 4 1 3 532 x2 = 8712 6601 x3 = 239 21 285 x4 = 4 185 2094 1. Evaluate the fitness of each individual, showing all your workings, and arrange them in order with the fittest first and the least fit last.

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
Suppose a genetic algorithm uses chromosomes of the form x = abcdefgh with a fixed length of eight genes. Each gene can be any digit between 0 and 9. Let the fitness of individual x be
calculated as:
f(x) = (a + b) – (c + d) + (e + f) – (g + h)
and let the initial population consist of four individuals with the following
chromosomes:
x1 = 6 5 4 13 5 32
x2 = 87 126601
x3 = 2392 1 285
x4 = 4185 2094
1. Evaluate the fitness of each individual, showing all your workings, and arrange them in order with the fittest fiırst and the least fit last.
2. Perform the following crossover operations: One-point crossover, Two-point crossover, and uniform crossover.
Transcribed Image Text:Suppose a genetic algorithm uses chromosomes of the form x = abcdefgh with a fixed length of eight genes. Each gene can be any digit between 0 and 9. Let the fitness of individual x be calculated as: f(x) = (a + b) – (c + d) + (e + f) – (g + h) and let the initial population consist of four individuals with the following chromosomes: x1 = 6 5 4 13 5 32 x2 = 87 126601 x3 = 2392 1 285 x4 = 4185 2094 1. Evaluate the fitness of each individual, showing all your workings, and arrange them in order with the fittest fiırst and the least fit last. 2. Perform the following crossover operations: One-point crossover, Two-point crossover, and uniform crossover.
Expert 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