The given table below shows the 6 different places that you would like to visit on a particular day. The table below shows the estimated amount of time (in minutes) it takes you to travel (by any means of transportation) from one place to another. If you will visit each of these places exactly once, determine the shortest time possible it would take you to do using the Greedy Algorithm. Examples already provided in the photos below.    Home Hospital Mall Esplanade Pet Shop Market Home --- 30 15 17 10 3 Hospital 30 --- 17 20 25 23 Mall 15 17 --- 2 25 18 Esplanade 17 20 2 --- 27 20 Pet Shop 10 25 25 27 --- 7 Market 3 23 18 20 7 ---

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

[1B] The given table below shows the 6 different places that you would like to visit on a particular day. The table below shows the estimated amount of time (in minutes) it takes you to travel (by any means of transportation) from one place to another. If you will visit each of these places exactly once, determine the shortest time possible it would take you to do using the Greedy Algorithm. Examples already provided in the photos below

 

Home

Hospital

Mall

Esplanade

Pet Shop

Market

Home

---

30

15

17

10

3

Hospital

30

---

17

20

25

23

Mall

15

17

---

2

25

18

Esplanade

17

20

2

---

27

20

Pet Shop

10

25

25

27

---

7

Market

3

23

18

20

7

---

H.
Grocery
Video rental
Home
Post office
store
store
Bank
Required answer:
Home
14
12
20
23
12
Post office
8
12
21
14
23
12
17
Grocery
store
26
G
Video rental
20
12
17
18
store
Bank
23
21
11
18
17
21
\11
12
NOTE: THIS IS ONLY A
SAMPLE
18
Required answer:
Applying the Edge Picking Algorithm, we find the following Hamiltonian circuit with the
minimum weight (in minutes): HV – VP – PG – GB – BH, or HVPGBH
The obtained minimum time is: 20 + 12 + 8 + 11 + 23 = 74 minutes.
|
|
%3D
14
Transcribed Image Text:H. Grocery Video rental Home Post office store store Bank Required answer: Home 14 12 20 23 12 Post office 8 12 21 14 23 12 17 Grocery store 26 G Video rental 20 12 17 18 store Bank 23 21 11 18 17 21 \11 12 NOTE: THIS IS ONLY A SAMPLE 18 Required answer: Applying the Edge Picking Algorithm, we find the following Hamiltonian circuit with the minimum weight (in minutes): HV – VP – PG – GB – BH, or HVPGBH The obtained minimum time is: 20 + 12 + 8 + 11 + 23 = 74 minutes. | | %3D 14
Example Problem
Grocery
Video rental
Home
Post office
store
store
Bank
Home
14
12
20
23
Post office
14
8
12
21
Grocery
12
8
17
11
store
Video rental
20
12
17
18
store
Bank
23
21
11
18
Transcribed Image Text:Example Problem Grocery Video rental Home Post office store store Bank Home 14 12 20 23 Post office 14 8 12 21 Grocery 12 8 17 11 store Video rental 20 12 17 18 store Bank 23 21 11 18
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
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,