Question

Problem 3 (Chapter 7: Transport Decisions) Transcontinental Trucking Company wishes to route a shipment from Buffalo to Duluth over major highways. Because time and distance are closely related, the company dispatcher would like to find the shortest route. A schematic network of the major highway links and mileage between city pairs is show in Figure 7-20. Find the shortest route through the network by using the shortest route method (Hint View Module 2 Ch07 Pert 1 Slide 8 To !! Video on D2L for shortest route method) Feasible Routes for Transcontinental Trucking Company Problem Figure 7-20 Lake Superior G Duluth 404 Mackinaw City Lake Huron 300 Lake Ontario Buffalo 479 276 350 DYDetroit 186 58/A C Lake Erie Cleveland 241 Toledo To s Chicago Draft Table Solved Nodes Its Directly Step Connected Connected Closest Total Nth Its Its Last Cost Nearest Minimum Connection Unsolved Involved Node Cost to Unsolved Node Nodes uedy een

Answer 1

Implementation of shortest route method:

Step	Solved Nodes Directly Connected to Unsolved Nodes	Its closest connected unsolved node	Total time	Nth nearest node	Its minimum time	Its last connection
1	A	B	0 + 186 = 186	B	186	A-B
2	A	D	0 + 276 = 276	D	276	A-D
	B	C	186 + 110 = 296
3	B	C	186 + 110 = 296	C	296	B-C
	D	C	276 + 58 = 334
4	D	F	276 + 300 = 576
	C	E	296 + 241 = 537	E	537	C-E
5	D	F	276 + 300 = 576	F	576	D-F
	C	F	296 + 350 = 646
	E	G	537 + 479 = 1016
6	E	G	537 + 479 = 1016
	F	G	576 + 404 = 980	G	980	F-G

So, reach G from F, reach F from D, and reach D from A.

So,

The shortest route from A to G is A-D-F-G and the overall length is 980.