S Worksheet 2- Math 101 (USE A PENCIL) 1) Shown in the table below are the one-way airfares between 5 cities. Create a graph showing this data and label the vertices (You can use H= Honolulu, L=London, etc.). Label the edges with the prices. I O Seattle Honolulu H London Moscow Honolulu London $159 $370 $830 C O L Moscow $654 $854 $245 OM Cairo $684 $801 $323 $329 S H 159 870 370 684 2) Use the nearest neighbor algorithm, starting with vertex L, to find the approximately least cost Hami List both the order of the cities visited as well as the cost. 01 L 654 C Cost: Order (circuit): M Use the best edge algorithm to find the approximately least cost Hamilton circuit. Then, write your final answer starting with vertex L. rcuit. Order (Circuit):

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
S
O
H
Name ant Adams
Worksheet 2 - Math 101 (USE A PENCIL)
1) Shown in the table below are the one-way airfares between 5 cities. Create a graph showing this data and label
the vertices (You can use H= Honolulu, L=London, etc.). Label the edges with the prices.
Seattle
Honolulu
London
Moscow
H
I O
Honolulu London Moscow
$654
$159
$370
$830
$854
$245
ос
O
L
O
ом
Cairo
$684
$801
$323
$329
S
L
H
870
370
2) Use the nearest neighbor algorithm, starting with vertex L, to find the approximately least cost Hami
List both the order of the cities visited as well as the cost.
YOL
684
854
654
Cost:
L
C
Methods To Find The Optimal Circuit
1) Brute Force Method (this is the only method
that guarantees the optimal solution). However,
with a large set of vertices, this can be very time
consuming-even with a computer!
Order (circuit):
M
2) Nearest Neighbor Method (does not guarant
optimal solution)
3) Use the best edge algorithm to find the approximately least cost Hamilton circuit. Then, write your final answer
starting with vertex L.
Order (Circuit):
3) Best Edge Method or Cheapest link
Method(does not guarantee opti
rcuit.
Transcribed Image Text:S O H Name ant Adams Worksheet 2 - Math 101 (USE A PENCIL) 1) Shown in the table below are the one-way airfares between 5 cities. Create a graph showing this data and label the vertices (You can use H= Honolulu, L=London, etc.). Label the edges with the prices. Seattle Honolulu London Moscow H I O Honolulu London Moscow $654 $159 $370 $830 $854 $245 ос O L O ом Cairo $684 $801 $323 $329 S L H 870 370 2) Use the nearest neighbor algorithm, starting with vertex L, to find the approximately least cost Hami List both the order of the cities visited as well as the cost. YOL 684 854 654 Cost: L C Methods To Find The Optimal Circuit 1) Brute Force Method (this is the only method that guarantees the optimal solution). However, with a large set of vertices, this can be very time consuming-even with a computer! Order (circuit): M 2) Nearest Neighbor Method (does not guarant optimal solution) 3) Use the best edge algorithm to find the approximately least cost Hamilton circuit. Then, write your final answer starting with vertex L. Order (Circuit): 3) Best Edge Method or Cheapest link Method(does not guarantee opti rcuit.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,