1. [20 points] [MID] The subset21 problem is stated as follows. Given a set of N positive integers X = {x1, x2, .. . , xn}. 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 = the set P = {12, 3, 6} is a valid solution for the subset21 problem in this example. {12, 17, 3, 24, 6}, Formulate the subset21 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. • A termination criterion for the evolutionary optimization which insures that you terminate with a valid solution for the subset21 problem if possible without run-
1. [20 points] [MID] The subset21 problem is stated as follows. Given a set of N positive integers X = {x1, x2, .. . , xn}. 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 = the set P = {12, 3, 6} is a valid solution for the subset21 problem in this example. {12, 17, 3, 24, 6}, Formulate the subset21 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. • A termination criterion for the evolutionary optimization which insures that you terminate with a valid solution for the subset21 problem if possible without run-
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...
Related questions
Question
![1. [20 points] [MID] The subset21 problem is stated as follows. Given a set of N positive
integers X
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 subset21 problem in this example.
{x1, x2, ..., xm}. Find a subset P of the set X such that the sum of the
Formulate the subset21 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
are solving the above example (i.e. X
you
{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 subset21 problem if possible without run-
ning indefinitely.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F0cd5ee98-bd95-4393-8290-ef068175b6b9%2Febd1e6fd-e940-4d26-8cdc-9d8b8951f394%2Fc61dbc_processed.jpeg&w=3840&q=75)
Transcribed Image Text:1. [20 points] [MID] The subset21 problem is stated as follows. Given a set of N positive
integers X
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 subset21 problem in this example.
{x1, x2, ..., xm}. Find a subset P of the set X such that the sum of the
Formulate the subset21 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
are solving the above example (i.e. X
you
{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 subset21 problem if possible without run-
ning indefinitely.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
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](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY