Pearson eText for Introduction to Management Science -- Instant Access (Pearson+)
Pearson eText for Introduction to Management Science -- Instant Access (Pearson+)
13th Edition
ISBN: 9780137503933
Author: Bernard Taylor
Publisher: PEARSON+
bartleby

Concept explainers

Question
Book Icon
Chapter 7, Problem 1P
Summary Introduction

To determine: The shortest route from node 1 to each of the other six nodes.

Expert Solution & Answer
Check Mark

Explanation of Solution

Given diagram:

Pearson eText for Introduction to Management Science -- Instant Access (Pearson+), Chapter 7, Problem 1P , additional homework tip  1

Determine the shortest route:

Step 1:

Pearson eText for Introduction to Management Science -- Instant Access (Pearson+), Chapter 7, Problem 1P , additional homework tip  2

The initial node from the given diagram is Node 1. In the above table, nodes from Node 1 should be considered. While comparing the distance of each branch, 1-3 has the minimum distance. Hence, it was chosen. The diagram for the above table is as follows:

Pearson eText for Introduction to Management Science -- Instant Access (Pearson+), Chapter 7, Problem 1P , additional homework tip  3

Step 2:

Pearson eText for Introduction to Management Science -- Instant Access (Pearson+), Chapter 7, Problem 1P , additional homework tip  4

In the above table, nodes from Node 1 and Node 3 (as Node 3 was chosen in step 1) should be considered. However, the chosen branch should not be considered again. While comparing the distance of each branch, 1-2 has the minimum distance. Hence, it was chosen. The diagram for the above table is as follows:

Pearson eText for Introduction to Management Science -- Instant Access (Pearson+), Chapter 7, Problem 1P , additional homework tip  5

Step 3:

Pearson eText for Introduction to Management Science -- Instant Access (Pearson+), Chapter 7, Problem 1P , additional homework tip  6

In the above table, nodes from Node 1, Node 3, and Node 2 (as Node 2 was chosen in step 2) should be considered. However, the chosen branch should not be considered again. While comparing the distance of each branch, 3-4 has the minimum distance. Hence, it was chosen. The diagram for the above table is as follows:

Pearson eText for Introduction to Management Science -- Instant Access (Pearson+), Chapter 7, Problem 1P , additional homework tip  7

Step 4:

Pearson eText for Introduction to Management Science -- Instant Access (Pearson+), Chapter 7, Problem 1P , additional homework tip  8

In the above table, nodes from Nodes 1, 3, 2, and 4 (as Node 4 was chosen in step 3) should be considered. However, the chosen branch should not be considered again. While comparing the distance of each branch, 4-7 has the minimum distance. Hence, it was chosen. The diagram for the above table is as follows:

Pearson eText for Introduction to Management Science -- Instant Access (Pearson+), Chapter 7, Problem 1P , additional homework tip  9

Step 5:

Pearson eText for Introduction to Management Science -- Instant Access (Pearson+), Chapter 7, Problem 1P , additional homework tip  10

In the above table, nodes from Nodes 1, 3, 2, 4, and 7 (as Node 7 was chosen in step 4) should be considered. However, the chosen branch should not be considered again. While comparing the distance of each branch, 4-6 has the minimum distance. Hence, it was chosen. The diagram for the above table is as follows:

Pearson eText for Introduction to Management Science -- Instant Access (Pearson+), Chapter 7, Problem 1P , additional homework tip  11

Step 6:

Pearson eText for Introduction to Management Science -- Instant Access (Pearson+), Chapter 7, Problem 1P , additional homework tip  12

In the above table, nodes from Nodes 1, 3, 2, 4, 7, and 6 (as Node 6 was chosen in step 5) should be considered. However, the chosen branch should not be considered again. While comparing the distance of each branch, 2-5 has the minimum distance. Hence, it was chosen. The final node of the shortest route is Node 5 after Node 1, Node 3, Node 2, Node 4, Node 7, and Node 6 (all the given nodes were chosen for the shortest route). Hence, the steps should be stopped here. The diagram for the above table is as follows:

Pearson eText for Introduction to Management Science -- Instant Access (Pearson+), Chapter 7, Problem 1P , additional homework tip  13

Formulae to determine each distance from step 1 to step 6:

Pearson eText for Introduction to Management Science -- Instant Access (Pearson+), Chapter 7, Problem 1P , additional homework tip  14

Final diagram and the shortest route:

Pearson eText for Introduction to Management Science -- Instant Access (Pearson+), Chapter 7, Problem 1P , additional homework tip  15

Hence, the shortest route should have the following branches:

1-3, 1-2, 3-4, 4-7, 4-6, and 2-5

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
ווח CENGAGE MINDTAP G Chapter 09 Excel Activity: Exponential Smoothing Question 1 3.33/10 A e Submit 自 ? G→ Video Excel Online Tutorial Excel Online Activity: Exponential Smoothing ng.cengage.com Q Search this course ? A retail store records customer demand during each sales period. The data has been collected in the Microsoft Excel Online file below. Use the Microsoft Excel Online file below to develop the single exponential smoothing forecast and answer the following questions. X Open spreadsheet Questions 1. What is the forecast for the 13th period based on the single exponential smoothing? Round your answer to two decimal places. 91.01 2. What is the MSE for the single exponential smoothing forecast? Round your answer to two decimal places. 23.50 3. Choose the correct graph for the single exponential smoothing forecast. The correct graph is graph A ☑ Back Observation Exponential Smoothing Forecast 100 Forecast 95 95 90 90 A-Z Office Next A+
The City Commission of Nashville has decided to build a botanical garden and picnic area in the heart of the city for the recreation of its citizens. The precedence table for all the activities required to construct this area successfully is as follows: A Time B- Code Description (hrs) Immediate Predecessor(s) A Find location; determine resource requirements 20 None B Requisition of lumber and sand 65 A C Dig and grade 100 A D Saw lumber into appropriate sizes 30 B E Position lumber in correct locations 25 D, C F Nail lumber together E G Put sand in and under the equipment 25 F H H Put dirt around the equipment 10 F Put grass all over the garden, landscape, paint 35 G, H Refer to the legend for the activity that corresponds to each code. Using the line drawing tool, draw a Gantt chart for activities E through I of the project. 0 20 40 60 80 100 120 140 160 180 200 220 Clear all
List three forms of pay you receive (not dollar amounts).  Compare your list to two of your peers.  Discuss any differences or similarities that you noticed. NO AI
Knowledge Booster
Background pattern image
Operations Management
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,
Text book image
Operations Management
Operations Management
ISBN:9781259667473
Author:William J Stevenson
Publisher:McGraw-Hill Education
Text book image
Operations and Supply Chain Management (Mcgraw-hi...
Operations Management
ISBN:9781259666100
Author:F. Robert Jacobs, Richard B Chase
Publisher:McGraw-Hill Education
Text book image
Business in Action
Operations Management
ISBN:9780135198100
Author:BOVEE
Publisher:PEARSON CO
Text book image
Purchasing and Supply Chain Management
Operations Management
ISBN:9781285869681
Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:Cengage Learning
Text book image
Production and Operations Analysis, Seventh Editi...
Operations Management
ISBN:9781478623069
Author:Steven Nahmias, Tava Lennon Olsen
Publisher:Waveland Press, Inc.