Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
1. [20 points][MID] The subseta problem is stated as follows. Given a set of N positive integers X - {r1,2,...In}. Find a subset P of the set X such that the sum of the elements of P is equal to 21. For example, if N=5 and the set X = {12, 17,3.24,6}, the set P = {12, 3,6} is a valid solution for the subset problem in this example. Formulate the subset problem as a Genetic or Evolutionary Algorithm optimization. You may use binary representation, OR any representation that you think is more appropriate. you should specify: • fitness function. Give 3 examples of individuals and their fitness values if you are solving the above example (ie. X = {12, 17,3, 24,6}). • A set of mutation and/or crossover and/or repair operators. Intelligent operators that are suitable for this particular domain will earn more credit. • A termination criterion for the evolutionary optimization which insures that you terminate with a valid solution for the subseta problem if possible without run- ning indefinitely.

1. [20 points][MID] The subseta problem is stated as follows. Given a set of N positive integers X - {r1,2,...In}. Find a subset P of the set X such that the sum of the elements of P is equal to 21. For example, if N=5 and the set X = {12, 17,3.24,6}, the set P = {12, 3,6} is a valid solution for the subset problem in this example. Formulate the subset problem as a Genetic or Evolutionary Algorithm optimization. You may use binary representation, OR any representation that you think is more appropriate. you should specify: • fitness function. Give 3 examples of individuals and their fitness values if you are solving the above example (ie. X = {12, 17,3, 24,6}). • A set of mutation and/or crossover and/or repair operators. Intelligent operators that are suitable for this particular domain will earn more credit. • A termination criterion for the evolutionary optimization which insures that you terminate with a valid solution for the subseta problem if possible without run- ning indefinitely.

Computer Networking: A Top-Down Approach (7th Edition)
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...
See similar textbooks
icon
Related questions
Question
1. [20 points][MID] The subseta problem is stated as follows. Given a set of N positive integers X {z1,72, ...,}. Find a subset P of the set X such that the sum of the elements of P is equal to 21. For example, if N=5 and the set X = {12, 17, 3, 24, 6}, the set P= {12,3, 6} is a valid solution for the subseta problem in this example. Formulate the subsety problem as a Genetic or Evolutionary Algorithm optimization. You may use binary representation, OR any representation that you think is more appropriate. you should specify: • A fitness function. Give 3 examples of individuals and their fitness values if you are solving the above example (i.e. X = {12, 17, 3, 24, 6}). • A set of mutation and/or crossover and/or repair operators. Intelligent operators that are suitable for this particular domain will earn more credit. • termination criterion for the evolutionary optimization which insures that you terminate with a valid solution for the subseta problem if possible without run- ning indefinitely.
Transcribed Image Text:1. [20 points][MID] The subseta problem is stated as follows. Given a set of N positive integers X {z1,72, ...,}. Find a subset P of the set X such that the sum of the elements of P is equal to 21. For example, if N=5 and the set X = {12, 17, 3, 24, 6}, the set P= {12,3, 6} is a valid solution for the subseta problem in this example. Formulate the subsety problem as a Genetic or Evolutionary Algorithm optimization. You may use binary representation, OR any representation that you think is more appropriate. you should specify: • A fitness function. Give 3 examples of individuals and their fitness values if you are solving the above example (i.e. X = {12, 17, 3, 24, 6}). • A set of mutation and/or crossover and/or repair operators. Intelligent operators that are suitable for this particular domain will earn more credit. • termination criterion for the evolutionary optimization which insures that you terminate with a valid solution for the subseta problem if possible without run- ning indefinitely.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 13 images

SEE SOLUTIONCheck out a sample Q&A here
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
SEE MORE TEXTBOOKS