0% found this document useful (0 votes)
66 views2 pages

Untitled Document

Gojo Consultancy is tasked by the DPWH to analyze a road system to determine the maximum flow of cars, with specific data on street connections and capacities. Additionally, Tadashi Yamaguchi Company needs to find the shortest delivery route from point A to F, given distances between various municipalities. Both analyses aim to optimize traffic flow and delivery efficiency in the respective networks.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
66 views2 pages

Untitled Document

Gojo Consultancy is tasked by the DPWH to analyze a road system to determine the maximum flow of cars, with specific data on street connections and capacities. Additionally, Tadashi Yamaguchi Company needs to find the shortest delivery route from point A to F, given distances between various municipalities. Both analyses aim to optimize traffic flow and delivery efficiency in the respective networks.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

MAXIMAL FLOW TECHNIQUE :

Gojo Consultancy has been requested by the Department of Public Works and Highways
(DPWH) to develop a road system of a small city by determining the maximum number of
cars that can pass through the system. The study reveals the following data :

From Street To Street Number of Cars per Hour

1 2 20

1 3 90

1 4 10

2 1 5

2 4 5

2 6 10

3 1 0

3 4 20

3 5 10

4 1 0

4 2 5

4 3 5

4 6 5

5 3 5

5 6 50

6 2 10

6 4 5

6 5 0

Required : Determine the maximum number of cars per hour that can pass through the road
network.

SHORTEST PATH TECHNIQUE :


Tadashi Yamaguchi Company delivers goods to different areas of the metropolitan area by
passing through several municipalities and cities. Nodes A and F are designated as the point
of origin and destination, respectively. The following information is is made available :

FROM TO CITY/MUNICIPALITY DISTANCE (IN


CITY/MUNICIPALITY KILOMETERS)

A B 8

A C 10

B C 5

B D 10

B E 8

C E 3

D E 12

D F 8

E F 8

REQUIRED : Using the shortest path technique, determine the shortest distance from the
point of origin to the point of destination.

You might also like