Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Consider the problem of finding the shortest route through several cities, such that each city is visited only once and in the end return to the starting city (the Travelling Salesman problem). Suppose tha there 8 cites and there is a direct route between each two cities, the position of cities in the map are as fallow.

Consider the problem of finding the shortest route through several cities, such that each city is visited only once and in the end return to the starting city (the Travelling Salesman problem). Suppose tha there 8 cites and there is a direct route between each two cities, the position of cities in the map are as fallow.

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
Consider the problem of finding the shortest route through several cities, such that each city is visited only once and in the end return to the starting city (the Travelling Salesman problem). Suppose that there 8 cites and there is a direct route between each two cities, the position of cities in the map are as fallow. City Cityt#1 City#2 City#3 City#4 City#5 City#6 City#7 City#8 Y 1.8 5.6 8.5 8.1 3.2 12.6 1.9 10.9 10.8 2.9 11.6 4.8 9.7 4.2 4.1 7.6 Based on this position the distance between each two city can simplify calculated based on Euclidean distance. For example the distance of Cityt#1 and City#3 is: Distance(City#1, City #3) = (Xcity41-Xcuyws)+ (Yetywi-Ycuyw3)* = /(1.8 - 3.2) + (5.6 - 12.6)2 = 7.138 Use genetic algorithm in order to solve this problem, in which genes represent route between pairs of cities (not the city index). So you have labeled each route and use that label as genes value, as there is 8 city and all of cities connected to each other there is 28 route and so lower bound of genes value become 1 and the upper bound become 28. Implement the solution for this problem, and describe the fallowing items: a) Is this a permutation problem? If so, which type of crossover and mutation operator you used b) How you define the fitness function, is there any penalty in fitness function definition. c) If an unfeasible chromosome generated (a chromosome which represent a traveling path in which it cannot be the problem solution), how you handle that chromosomes. Submit: • Implemented code • The plot of genetic algorithm run (average and best fitness value over generations) • Best achieved result (the path and overall distance) • The description of mentioned items
Transcribed Image Text:Consider the problem of finding the shortest route through several cities, such that each city is visited only once and in the end return to the starting city (the Travelling Salesman problem). Suppose that there 8 cites and there is a direct route between each two cities, the position of cities in the map are as fallow. City Cityt#1 City#2 City#3 City#4 City#5 City#6 City#7 City#8 Y 1.8 5.6 8.5 8.1 3.2 12.6 1.9 10.9 10.8 2.9 11.6 4.8 9.7 4.2 4.1 7.6 Based on this position the distance between each two city can simplify calculated based on Euclidean distance. For example the distance of Cityt#1 and City#3 is: Distance(City#1, City #3) = (Xcity41-Xcuyws)+ (Yetywi-Ycuyw3)* = /(1.8 - 3.2) + (5.6 - 12.6)2 = 7.138 Use genetic algorithm in order to solve this problem, in which genes represent route between pairs of cities (not the city index). So you have labeled each route and use that label as genes value, as there is 8 city and all of cities connected to each other there is 28 route and so lower bound of genes value become 1 and the upper bound become 28. Implement the solution for this problem, and describe the fallowing items: a) Is this a permutation problem? If so, which type of crossover and mutation operator you used b) How you define the fitness function, is there any penalty in fitness function definition. c) If an unfeasible chromosome generated (a chromosome which represent a traveling path in which it cannot be the problem solution), how you handle that chromosomes. Submit: • Implemented code • The plot of genetic algorithm run (average and best fitness value over generations) • Best achieved result (the path and overall distance) • The description of mentioned items
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 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