Scribd
Upload
340 views2 pages

Problem

The document contains three network modeling problems: 1) Determine the shortest route from node 1 to node 12 in a network where distances are given along branches. 2) Determine the maximum traffic flow from an office complex to a highway interchange given the traffic capacities of streets connecting three exits to the interchange. 3) Determine a minimum spanning tree network to connect campus buildings with wheelchair access using the fewest feet of refurbished sidewalks, and report the number of feet.

Uploaded by

Bryan De Chavez
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
340 views2 pages

Problem

The document contains three network modeling problems: 1) Determine the shortest route from node 1 to node 12 in a network where distances are given along branches. 2) Determine the maximum traffic flow from an office complex to a highway interchange given the traffic capacities of streets connecting three exits to the interchange. 3) Determine a minimum spanning tree network to connect campus buildings with wheelchair access using the fewest feet of refurbished sidewalks, and report the number of feet.

Uploaded by

Bryan De Chavez
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Problem Set Network Model 1.

Determine the shortest route from node 1 (origin) to node 12 (destination) for the following network. Distances are given along the network branches:

2. The traffic management office in Richmond is attempting to analyze the potential traffic flow from a new office complex under construction to an interstate highway interchange during the evening rush period. Cars leave the office complex via one of three exits, and then they travel through the city streets until they arrive at the interstate interchange. The following network shows the various street routes (branches) from the office complex (node 1) to the interstate interchange (node 9):

All intermediate nodes represent street intersections, and the values accompanying the branches emanating from the nodes represent the traffic capacities of each street, expressed in thousands of cars per hour. Determine the maximum flow of cars that the street system can absorb during the evening rush hour.

3. State University has decided to reconstruct the sidewalks throughout the east side of its campus to provide wheelchair access. However, upgrading sidewalks is a very expensive undertaking, so for the first phase of this project, university administrators want to make sure they connect all buildings with wheelchair access with the minimum number of refurbished sidewalks possible. Following is a network of the existing sidewalks on the east side of campus, with the feet between each building shown on the branches:

Determine a minimal spanning tree network that will connect all the buildings on campus with wheelchair access sidewalks and indicate the number of feet of sidewalk.

Prepared by: Ryan Curbano, CIE

You might also like