Suppose you have been given a map of 6 cities connected with each other via different paths. Your job is to visit every city just once covering the minimum distance possible. Solve this problem using Genetic Algorithm. You can start at any point and end at any point. Just make sure that all the cities have been covered.   1. Encode the problem and create an initial population of 3 different chromosomes 2. Choose any one parent from your above solution and identify the following: i. Gene ii. Chromosome 3. Think of an appropriate fitness function to this problem and give proper justification. 4. Use the fitness function to calculate the fitness level of all the chromosomes in your population. Select the fittest 2 chromosomes based on the fitness function. 5. Perform crossover that you have been taught in the class on the selected parents. Now based on the offspring, for this problem do you think that is the best way to perform crossover? If not, explain why. 6. Perform mutation that you have been taught in the class on the produced offspring. Now based on the mutated offspring, for this problem do you think that is the best way to perform mutation? If not, explain why

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 you have been given a map of 6 cities connected with each other via different paths. Your job is to visit every city just once covering the minimum distance possible. Solve this problem using Genetic Algorithm. You can start at any point and end at any point. Just make sure that all the cities have been covered.

 

1. Encode the problem and create an initial population of 3 different chromosomes


2. Choose any one parent from your above solution and identify the following:
i. Gene
ii. Chromosome


3. Think of an appropriate fitness function to this problem and give proper justification.


4. Use the fitness function to calculate the fitness level of all the chromosomes in your population. Select the fittest 2 chromosomes based on the fitness function.


5. Perform crossover that you have been taught in the class on the selected parents. Now based on the offspring, for this problem do you think that is the best way to perform crossover? If not, explain why.


6. Perform mutation that you have been taught in the class on the produced offspring. Now based on the mutated offspring, for this problem do you think that is the best way to perform mutation? If not, explain why.

15
6
4
A
6
E
11
3.
2.
Transcribed Image Text:15 6 4 A 6 E 11 3. 2.
Expert Solution
steps

Step by step

Solved in 5 steps with 4 images

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