Nama ;Ibnu Anugrah

No.BP : 2020932014
TUGAS 2 Teknik Kuantitatif “ Analisis Jaringan”

1. You need to take a trip by car to another town that you have never visited before. Therefore,
you are studying a map to determine the shortest route to your destination. Depending on
which route you choose, there are five other towns (call them A.B, C, D, E) that you might
pass through on the way. The map shows the mileage along each road that directly connects
two towns without any intervening towns. These numbers are summarized in the following
table, where a dash indicates that there is no road directly connecting these two towns
without going through any other towns.

a) Formulate this problem as a shortest-path problem by drawing a network where nodes

represent towns, links represent roads, and numbers indicate the length of each link in
miles.
b) Use the algorithm described in Sec. 9.3 to solve this shortestpath problem.
c) Formulate and solve a spreadsheet model for this problem.
d) If each number in the table represented your cost (in dollars) for driving your car from
one town to the next, would the answer in part (b) or (c) now give your minimum cost
route?
e) If each number in the table represented your time (in minutes) for driving your car from
one town to the next, would the answer in part (b) or (c) now give your minimum time
route?

Answer
A)
A
70
D

60
40 10 10
55

40
80
Destinasi
origin 60 B E

50
20
50

C
B)

n Hubungan Node Total Node Jarak Hubunga

Node Terdeka Terdeka Minimu n
t Jarak t ke-n m Terakhir

1 O A 40 A 40 OA

2 O C 50 C 50 OC

3 A B 40+ 10 = B 50 AB
50

4 A D 40+70=110

B E 50+40= 90 E 90 BE

C E 50+50=100

5 A D 40+70 =110

B D 50+55 =105

E D 90+10=100 ED

6 D T 100+60= 160 T 160 DT

E T 90+80=170

C)
D) Tentu, berdasarkan metode shortest Path dapat diaplikasikan untuk mendapatkan biaya
minimum
E) Tentu, berdasarkan metode shortest Path dapat diaplikasikan untuk mendapatkan waktu
minimum

2. The Premiere Bank soon will be hooking up computer terminals at each of its branch
offices to the computer at its main officeusing special phone lines with
telecommunications devices. The phone line from a branch office need not be connected
directly to the main office. It can be connected indirectly by being connected to another
branch office that is connected (directly or indirectly) to the main office. The only
requirement is that every branch office be connected by some route to the main office.
The charge for the special phone lines is $100 times the number of miles involved, where
the distance (in miles) between every pair of offices is as follows:

Management wishes to determine which pairs of offices should be directly connected by

special phone lines in order to connect every branch office (directly or indirectly) to the
main office at a minimum total cost.
(a) Describe how this problem fits the network description of the
minimum spanning tree problem.
(b) Use the algorithm described in Sec. 9.4 to solve the problem.

3. The Texago Corporation has four oil fields, four refineries, and four distribution centers.
A major strike involving the transportation industries now has sharply curtailed Texago’s
capacity to ship oil from the oil fields to the refineries and to ship petroleum products
from the refineries to the distribution centers. Using units of thousands of barrels of crude
oil (and its equivalent in refined products), the following tables show the maximum
number of units that can be shipped per day from each oil field to each refinery, and from
each refinery to each distribution center.
The Texago management now wants to determine a plan for how many units to ship from each
oil field to each refinery and
from each refinery to each distribution center that will maximize the total number of units
reaching the distribution centers.
(a) Draw a rough map that shows the location of Texago’s oil fields, refineries, and distribution
centers. Add arrows to show the flow of crude oil and then petroleum products through this
distribution network.
(b) Redraw this distribution network by lining up all the nodes representing oil fields in one
column, all the nodes representing
refineries in a second column, and all the nodes representing distribution centers in a third
column. Then add arcs to show the possible flow.
(c) Modify the network in part (b) as needed to formulate this problem as a maximum flow
problem with a single source, a
single sink, and a capacity for each arc.
(d) Use the augmenting path algorithm described in Sec. 9.5 to solve this maximum flow
problem.
(e) Formulate and solve a spreadsheet model for this problem.

Answer:
A. Rough Map

Oil field refinery Distribution

B. Distribution Network
OIL FIELD DISTRIBUTION
REFEINERY
CENTER

Texas N.Orelans Pittburgh

California Charleston Atlanta

alaska seatle K.city

M.East St.Louis s.francisco

4. Consider the maximum flow problem shown below, where the source is node A, the sink
is node F, and the arc capacities are the numbers shown next to these directed arcs.

a. Use the augmenting path algorithm described in Sec. 9.5 to solve this problem.
b. Formulate and solve a spreadsheet model for this problem.

A) Algoritm maximum flow problem

Iterasi 1=(A-B-D-F)= (9-7-6): (6)
7-6=1
B D

9-6=3 6-6=0
2

A 3 F

4
7
9

C E
6

Iterasi 2=(A-C-E-F)=(7-6-9); (6)

1
B D

3 0
2

A 3 F

4
7-6=1
9-6=3

C E
6-6=0

Iterasi 3=(A-B-E-F)=(3-2-3); (2)

1
B D

3-2=1 0
2-2=0

A 3 F

4
1
3-2=1

C E
0
 Iterasi 4=(A-B-D-E-F)=(1-1-3-1)=(1)
1-1=0
B D

1-1=0 0
0

A 3-1=2 F

4
1
1-1=0

C E
0

Total Maximum Flow= 6+6+2+1= 15

B) Solves by spreedshet
 5. Audiofile Company produces boomboxes. However, management has decided to
subcontract out the production of the speakers needed for the boomboxes. Three vendors
are available to supply the speakers. Their price for each shipment of 1,000 speakers is
shown below.

In addition, each vendor would charge a shipping cost. Each shipment would go to one of the
company’s two warehouses. Each vendor has its own formula for calculating this shipping cost
based on the mileage to the warehouse. These formulas and the mileage data are shown below

Whenever one of the company’s two factories needs a shipment of speakers to assemble into the
boomboxes, the company hires a trucker to bring the shipment in from one of the warehouses.
The cost per shipment is given next, along with the number of shipments needed per month at
each factory.

Each vendor is able to supply as many as 10 shipments per month. However, because of shipping
limitations, each vendor is
able to send a maximum of only 6 shipments per month to each warehouse. Similarly, each
warehouse is able to send a maximum
of only 6 shipments per month to each factory. Management now wants to develop a plan for
each month regarding how many shipments (if any) to order from each vendor, how many of
those shipments should go to each warehouse, and then how many shipments each warehouse
should send to each factory. The objective is to minimize the sum of the purchase costs
(including the shipping charge) and the shipping costs from the warehouses to the factories.
A. Draw a network that depicts the company’s supply network. Identify the supply nodes,
transshipment nodes, and demand nodes in this network.
B. Formulate this problem as a minimum cost flow problem by inserting all the necessary
data into this network. Also include a dummy demand node that receives (at zero cost) all
the unused supply capacity at the vendors.
C. Formulate and solve a spreadsheet model for this problem.
D. Use the computer to solve this problem without using - Excel.

Answer:
A.
V1 1600 W3

500
P1

V2

600

400
P2
2000

V3 1000 W2

B.