Scribd
Upload
449 views

Shortest-Route Problem Case Study-1

Gorman Construction wants to determine the shortest route between its office and a construction site to minimize transportation costs. Powerco needs to find the shortest path to send power from a plant to a city while passing through relay substations. A transportation committee proposes alternate routes through Cincinnati due to highway maintenance that would reduce the maximum flow between locations to 15,000 vehicles per hour.

Uploaded by

Sasi Sarvam
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
449 views

Shortest-Route Problem Case Study-1

Gorman Construction wants to determine the shortest route between its office and a construction site to minimize transportation costs. Powerco needs to find the shortest path to send power from a plant to a city while passing through relay substations. A transportation committee proposes alternate routes through Cincinnati due to highway maintenance that would reduce the maximum flow between locations to 15,000 vehicles per hour.

Uploaded by

Sasi Sarvam
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

SHORTEST-ROUTE PROBLEM

Case Study-1:
Gorman Construction Company has several construction sites located throughout a three-
county area. With multiple daily trips carrying personnel, equipment, and supplies from
Gorman’s office to the construction sites, the costs associated with transportation activities
are substantial. The travel alternatives between Gorman’s office and each construction site
can be described by the road network shown in Figure 6.12. The road distances in miles
between the nodes are shown above the corresponding arcs. In this application, Gorman
would like to determine the route that will minimize the total travel distance between
Gorman’s office (located at node 1) and the construction site located at node 6.

Solution:
Case Study-2:
Powerco is involved power generation and distributions to various cities, they necessary to
send (transfer) power from Plant-1 (node 1) to city-1 (node 6), it must pass through relay
substations (nodes 2–5). For any pair of nodes between which power can be transported,
Figure below gives the distance (in miles) between the nodes. Thus, substations 2 and 4 are 3
miles apart, and power cannot be sent between substations 4 and 5. Powerco wants the power
sent from plant-1 to city-1 to travel the minimum possible distance, so it must find the
shortest path in Figure (below) that joins node-1 to node-6.
MAXIMAL FLOW PROBLEM
Case Study-3:
The north-south interstate highway system passing through Cincinnati. The north–south
vehicle flow reaches a level of 15,000 vehicles per hour at peak times. Due to a summer
highway maintenance program, which calls for the temporary closing of lanes and lower
speed limits, a network of alternate routes through Cincinnati has been proposed by a
transportation planning committee. The alternate routes include other highways as well as
city streets. Because of differences in speed limits and traffic patterns, flow capacities vary,
depending on the particular streets and roads used. The proposed network with arc flow
capacities is shown in Figure below.

Solution:

You might also like