Transportasi & Assignment: Semester Pendek 2009
Uploaded by
Teh IdaTransportasi & Assignment: Semester Pendek 2009
Uploaded by
Teh IdaTransportasi & Assignment
Semester Pendek 2009
Soal quiz
Hitung pengalokasian kapasitas pabrik ke setiap kota agar ongkosnya minimum dengan teknik Least Cost
Pabrik Kapasitas Kota
1 2 3 4 100 150 75 50 A B C D
Permintaan
75 125 100 75
Ke
Kota
A
Dari 1 P a b r i k 2 3 4 10 15 25 5
B
15 5 10 10
C
5 10 5 5
D
20 5 15 15
The Assignment Problem
In general the LP formulation is given as
Minimize
c
i 1 j 1 n
ij
xij ,n ,n
Each supply is 1
x
j 1 n i 1
ij
1, i 1,
xij 1, j 1,
xij 0 or 1, ij
Each demand is 1
The Air Force has used this for assigning thousands of people to jobs.
Comments on the Assignment Problem
This is a classical problem. Research on the assignment problem predates research on LPs. Very efficient special purpose solution techniques exist.
10 years ago, Yusin Lee and J. Orlin solved a problem with 2 million nodes and 40 million arcs in hour.
Although the transportation simplex appears to be very efficient, there is a certain class of transportation problems, called assignment problems, for which the transportation simplex is often very inefficient. For that reason there is an other method called The Hungarian Method. The steps of The Hungarian Method are as listed below: Step1. Find a bfs. Find the minimum element in each row of the mxm cost matrix. Construct a new matrix by subtracting from each cost the minimum cost in its row. For this new matrix, find the minimum cost in each column. Construct a new matrix (reduced cost matrix) by subtracting from each cost the minimum cost in its column.
Step2. Draw the minimum number of lines (horizontal and/or vertical) that are needed to cover all zeros in the reduced cost matrix. If m lines are required , an optimal solution is available among the covered zeros in the matrix. If fewer than m lines are required, proceed to step 3. Step3. Find the smallest nonzero element (call its value k) in the reduced cost matrix that is uncovered by the lines drawn in step 2. Now subtract k from each uncovered element of the reduced cost matrix and add k to each element that is covered by two lines. Return to step2.
7.6 Transshipment Problems
A transportation problem allows only shipments that go directly from supply points to demand points. In many situations, shipments are allowed between supply points or between demand points. Sometimes there may also be points (called transshipment points) through which goods can be transshipped on their journey from a supply point to a demand point. Fortunately, the optimal solution to a transshipment problem can be found by solving a transportation problem.
Transshipment Problem
An extension of a transportation problem
More general than the transportation problem in that in this problem there are intermediate transshipment points. In addition, shipments may be allowed between supply points and/or between demand points
LP Formulation
Supply point: it can send goods to another point but cannot receive goods from any other point Demand point It can receive goods from other points but cannot send goods to any other point Transshipment point: It can both receive goods from other points send goods to other points
The following steps describe how the optimal solution to a transshipment problem can be found by solving a transportation problem. Step1. If necessary, add a dummy demand point (with a supply of 0 and a demand equal to the problems excess supply) to balance the problem. Shipments to the dummy and from a point to itself will be zero. Let s= total available supply. Step2. Construct a transportation tableau as follows: A row in the tableau will be needed for each supply point and transshipment point, and a column will be needed for each demand point and transshipment point.
Each supply point will have a supply equal to its original supply, and each demand point will have a demand to its original demand. Let s= total available supply. Then each transshipment point will have a supply equal to (points original supply)+s and a demand equal to (points original demand)+s. This ensures that any transshipment point that is a net supplier will have a net outflow equal to points original supply and a net demander will have a net inflow equal to points original demand. Although we dont know how much will be shipped through each transshipment point, we can be sure that the total amount will not exceed s.
Contoh Soal Assignment
Mesin 1 Pekerjaan 1 Pekerjaan 2 Pekerjaan 3 5 14 15 Mesin 2 7 10 13 Mesin 3 9 12 16
Menciptakan elemen nol dengan mengurangkan elemen terkecil dalam setiap baris (kolom)- berikut yang dikurangkan adalah baris Mesin 1 Mesin 1 0 0 4 4 2 2 Mesin 2 Mesin 2 2 2 0 0 0 0 Mesin 3 Mesin 3 4 2 2 0 3 1
Pekerjaan 1 Pekerjaan 1 Pekerjaan 2 Pekerjaan 2 Pekerjaan 3 Pekerjaan 3
2 0 1
Total cost menjadi 5 +13+12 =30
Contoh Soal Assignment
0 1 9 4 8 4 7 5 7 6 10 11 8 3 9 7 5 3 5 2 0 2 0 3 3 0 1 2 2 0 4 0 2 2 3 0
2
0 3
0
1 2
3
7 3
2
3 0
0
3 0 4
2
0 0 2
1
0 3 0
1
2 2 0 Total cost : 1 + 5+10+5 = 21
Contoh Soal Assignment
Petugas A W X Y Z 4 0 1 0 0 0 0 2 1 1 2 0 Pekerjaan B C D
10 9 12 3
1 1 4 0
2 5 7 1
8 11 14 4
3 0 0 0 0 1 0 3
6 9 14 2
0 1 1 0 0 1 3 0
8 4 5 2
0 0 0 0
6 6 7 3
4 4 7 1
6 2
0 0
3 3
3 3
3
0
0
0
4
0
6
0
Total cost = 8+9 + 7+2=26
Tugas Besok
Berikut tabel ongkos untuk setiap pekerjaan yang ditawarkan oleh setiap petugas. Hitunglah penempatan setiap petugas yang memberikan ongkos terkecil
Petugas A W X Y Z Pekerjaan B C D
7 3 7 3
2 5 8 1
8 5 14 4
7 2 10 2
