The figure below shows the possible routes from city A to city J as well as the time (in minutes) required for a trip between each pair of cities (note that if no arc joins two cities it is not possible to travel non-stop between those two cities). A traveler wishes to find the quickest option to travel from city A to city J.
Which type of network optimization problem is used to solve this problem?

A) Maximum-Cost Flow problem
B) Average-Cost Flow problem
C) Maximum Flow Problem
D) Minimum Flow Problem
E) Shortest Path Problem

Question

The figure below shows the possible routes from city A to city J as well as the time (in minutes) required for a trip between each pair of cities (note that if no arc joins two cities it is not possible to travel non-stop between those two cities). A traveler wishes to find the quickest option to travel from city A to city J. 
Which type of network optimization problem is used to solve this problem?

A) Maximum-Cost Flow problem 
B) Average-Cost Flow problem 
C) Maximum Flow Problem 
D) Minimum Flow Problem 
E) Shortest Path Problem

Quizplus · Accepted Answer

The problem requires finding the quickest option to travel from city A to city J, which is a classic example of the shortest path problem. Therefore, the best choice is E) Shortest Path Problem.

The Figure Below Shows the Possible Routes from City a to City