Nadine decided to visit her parents. She will drive from her city of residence (Point A) to her parent’s house (point K) on a network of roads and highways. The following matrix shows the possible road segments and their distance she can drive from Point A to point K. According to given matrix, for instance, the distance from Point A to B is 90 kms. The dash sign (-) mean that it is not possible to directly travel between the corresponding points. The red values show that the corresponding segment is a paid-road. a) Find the shortest distance from point A to point K using Dijkstra Algorithm (Assume there is no restriction for paid-roads.) b) If Nadine do not want to pay for the roads, how will the result in part a) change? Use Dijkstra Algorithm to answer. c) Suppose Nadine wants to minimize total oil and paid-road cost of her travel. Assume her car consumes 70$ per 100km in average and paid-road price is calculated as 0.5 $ per km. Which route should Nadine follow to minimize the total cost? Use Dijkstra Algorithm to answer.

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

Nadine decided to visit her parents. She will drive from her city of residence (Point A) to her parent’s house (point K) on a network of roads and highways. The following matrix shows the possible road segments and their distance she can drive from Point A to point K. According to given matrix, for instance, the distance from Point A to B is 90 kms. The dash sign (-) mean that it is not possible to directly travel between the corresponding points. The red values show that the corresponding segment is a paid-road.

a) Find the shortest distance from point A to point K using Dijkstra Algorithm (Assume there is no restriction for paid-roads.)
b) If Nadine do not want to pay for the roads, how will the result in part a) change? Use Dijkstra Algorithm to answer.
c) Suppose Nadine wants to minimize total oil and paid-road cost of her travel. Assume her car consumes 70$ per 100km in average and paid-road price is calculated as 0.5 $ per km. Which route should Nadine follow to minimize the total cost? Use Dijkstra Algorithm to answer.

Distance Matrix
B
D
E F
G
H
J
K
A
90
175
230
180
B
65
220
95
185
100
75
30
140
125 115 | 180 | 135
225 110
D
E
120
105
140 | 200 | 330
215 375
F
130
G
175
390
165
165 135
340 150
H
275
225
205
Transcribed Image Text:Distance Matrix B D E F G H J K A 90 175 230 180 B 65 220 95 185 100 75 30 140 125 115 | 180 | 135 225 110 D E 120 105 140 | 200 | 330 215 375 F 130 G 175 390 165 165 135 340 150 H 275 225 205
Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Knowledge Booster
Linear Transformation
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
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,