The Transcontinental Trucking Company wishes to route a shipment from Buffalo to
ID: 378169 • Letter: T
Question
The 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 shown in the figure below. Using dynamic programming, find the shortest path through the network. PLEASE USE DYNAMIC PROGRAMMING.
CANADA Ontario Superior uth404 ackinaw City Ottaw 479 ron 350 - ntario ake 58 D276A ErieButako Chica 10 and 186Explanation / Answer
dynamic programming is one of the method which uses to solve complext problems by breaking them into smaller and simpler problmes, and collecting the solutions collectively and find the outcome or solution.
the above network is showing various route maps by covering various points with given destinations. the required task is fnding the shortest path from Buffalo to Duluth.
if the path is A-D-F-G, the duration is= 276+300+404= 980
second path is- A-D-B-F-G with duration of= 276+58+350+404= 1088
third path is= A- C-B-F-G, with duration of= 186+ 110+350+404= 1050
and the fourth one is= A- C-B-E-G with duration of= 186+110+241+479= 1016
and the shortest path among these is A-D-F-G, the duration is= 276+300+404= 980
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.