Gasoline Distribution Cost Optimization
Translated by
ScribdTranslationsGasoline Distribution Cost Optimization
Translated by
ScribdTranslationsUNIT 2 DISTRIBUTION NETWORKS
CHAPTER 1 TRANSPORT MODEL WORKSHOP 1
Four Gasoline Dispensers A, B, C, and D require 50,000, 40,000, 60,000 and
40,000 gallons of gasoline respectively. It is possible to meet these demands at
starting from localities 1, 2, and 3 which have 80,000, 100,000, and 50,000 gallons
respectively. The costs of dispatching 1,000 gallons of gasoline presented in the
Table No. 2 indicates that it costs $70 to send 1,000 gallons of gasoline from location 1.
to the dispenser A, $80 to send 1,000 gallons of gasoline from location 2 to the
dispenser B, etc. The problem consists of determining the quantities of gasoline that
they must be sent from each locality to each vendor, so that the
distributors' requirements are met and that the total costs of
dispatch should be minimal.
Table No. 2 (Gasoline Dispensers)
LOCATIONS A B C D
1 70 60 80 60
2 50 80 60 70
3 80 50 80 60
2. Three depots supply five warehouses. The table indicates the transportation cost per
unity between deposits and warehouses, the capacities of the deposits and the
warehouse requirements. However, the damage to a main bridge has
prevented deliveries from depot A to warehouse 5, from depot B to
the warehouse 2 and from the deposit C to the warehouse 4. Determine within these
limitations of the optimal delivery scheme.
Table No. 3 (Deposits)
WAREHOUSE A B C No. Requested
1 $2.00 $4.00 $6,00 75
2 $3.00 $8,00 $7,00 345
3 $4.00 $3.00 $8,00 180
4 $4,00 $6,00 $3.00 90
5 $2.00 $6.00 $5.00 210
CAPACITY 850 300 450
A company has three main distributors that supply five merchants.
by detail. The following table shows the distances between distributors and
merchants, the requirements of the merchants and the capabilities of the
distributors. Determine which distributors should supply the merchants to
minimize the total distance required.
Table No. 4 (Distributor)
Merchant to x A B C Required No
younger
1 6 7 8 12
2 4 6 7 15
3 5 7 6 21
4 4 4 9 24
5 8 3 5 24
Available Number 15 48 33
CHAPTER 2 ASSIGNMENT MODEL
2.10 WORKSHOP
The construction company Briñez CIA has four contractors 1, 2, 3, 4; which are
they propose to build four offices for a mobile phone company, each contractor to
proposed for the construction of the offices the following quotation. Determine that
office will make each contractor to achieve a minimum cost in the construction of each
office.
1 2 3 4
A 48 48 50 44
B 56 60 60 68
C 96 94 90 85
D 42 44 54 46
At El Dorado Airport, there are four airlines with different flight times.
for five different destinations around the world. Each airline is asked for the least
arrival time for each of the destinations.
PARIS KOREA LONDON EGYPT Moscow
AVIANCA 17 21 14 15 20
AIRLINES 18 23 9 17 26
INTER 16 20 12 16 23
IBERIA 17 19 11 14 24
In a hospital, the head of personnel has the task of filling 4 vacancies for medicine.
In general, 5 doctors have been presented according to the table presented below.
where the scores of the interview and resume have been recorded. What will be the
selected to fill the positions.
1 2 3 4
Doctor 1 8 3 1 2
Doctor 2 9 6 7 6
Doctor 3 7 3 9 8
Doctor 4 2 4 6 5
Doctor 5 7 6 3 4
4. An administrator faces the problem of assigning four new methods to three means.
of production. The allocation of new methods increases profits according to the
quantities shown in the following table. Determine the optimal allocation if it can only
assign a method to a means of production.
Table No. 6 (Production Method)
LOCALITY 1 2 3
A 12 9 13.5
B 10 11 12.5
C 11.5 10 10
D 13 12 10.5
5. A construction company has five mechanical shovels in different locations and
requires a shovel at three different construction sites. Determine the optimal schedule.
of transportation, for the transportation costs indicated in the table.
Table No. 5 (Construction Site)
LOCALITY A B C
1 $2.00 $3.00 $4.00
2 $7.00 6.00 $4.00
3 $3,00 $5.00 $8.00
4 $4.00 $6.00 $5,00
5 $4.00 $6.00 $3.00
6. On the grounds of a university, four different contractors 1, 2, 3, and 4 propose
to build four different buildings A, B, C, and D. Because the contractors contribute
generosamente al fondo de los alumnos, cada uno construirá uno de los cuatro edificios.
Each of the contractors has submitted proposals for the construction of the four.
buildings. Table 1 shows the proposals.
The problem is to determine which building should be awarded to each contractor, to
achieve a minimum construction cost for the four buildings.
Table No. 6 (Contractor)
BUILDING 1 2 3 4
A 48 42 60 34
B 36 65 50 78
C 76 93 80 95
D 54 74 64 66
CHAPTER 3 CPM - PERT
3.12 WORKSHOP
1. Open the slack of this CPM - PERT network:
ACTIVITY PREDENCE ESTIMATED TIME LUCK
(You)
A -.- 2
B -.- 3
C -.- 5
D A,B 8
E A 4
F D 1
G F 6
H G,H 7
Don Pedro wants to apply for a loan at a cooperative institution. He wants to know the
maximum time for its approval and transfer taking into account the following information
use the PERT method.
DESCRIPCION TIME IN DAYS
To Tmp Tp You FREEDOM
A. Credit Committee Study 3 5 10 7.5
B. Giro cheque to the client 4 5 8 8
C. C Transfer credit to 2 6
4 5
accounting
D. D Arrival at cooperative 1 5 3 4,66
E. E Credit Approval 5 8 15 14.5
F. F Transfer credit to treasury 1 2 4 2.33
G. Attention from the boss of 1 3 5 2.83
credit for review
H. Budget Approval 1 3 5 2,83
I. Attention secretary 1 1 2 1
receptionist
Te = To + 4 (Tmp) + Tp
6
It is requested:
1. Sort table logically with precedences.
2. Design graphic of the project.
3. Calculate estimated time.
4. Determine the clearance.
5. Establish critical path.
4. Compare column A with column B, and correctly identify the definition of
each concept connecting them with an arrow.
ACTIVITY REPRESENTS THE BEGINNING AND THE END OF
EVERY ACTIVITY.
You ACTION OR WORK THAT IS CARRIED OUT
IN A TIME FRAME.
NODE PESSIMISTIC TIME.
To IT IS THE WAY THAT GOES FROM THE
FROM THE BEGINNING TO THE END OF THE NETWORK.
HOGURA MOST LIKELY TIME.
Tp ESTIMATED TIME.
CRITICAL PATH OPTIMAL TIME.
Tmp IT IS THE AMOUNT OF TIME THAT
AN ACTIVITY MAY TAKE TIME
(SHORTER).
4. Build the respective network.
ACTIVITY PRECEDENCE
A ---
B ---
C ---
D A
E B
F C
G C
H D,E
I D,E
J G
K H
L I,F
M J
N K,L
5 Build the chart according to the following table.
ACTIVITY PRECEDENCE
A ---
B ---
C ---
D ---
E B
F C
G E
H B
I H
J G
K F
L D
M L
N K
O H
P A,O,I
6 Find the critical path according to the following exercise.
PRECEDENCE ACTIVITY To Tmp Tp You SLACKNESS
A --- 1 4 6 4.33
B A 1 2 3 2.16
C A 1 1 2 1.16
D A 2 3 5 3,83
E B 1 1 1 1
F C 2 4 8 5,33
G D 1 2 4 2.33
H F, G 1 3 5 3.33
I E,H 10 15 18 38