Chap4_Transportation Problem.ppt

Transportation Problem Many of its applications involve determining how to optimally transport goods. Transportation Problem (cont) How much should be shipped from several sources to several destinations Sources: Factories, warehouses etc. Destinations: Warehouses, stores etc. Solved using transportation models Find lowest cost shipping arrangement Used primarily for existing distribution systems Transportation Problem Graphically Transportation Problem Graphically Transportation Problem Graphically Transportation Problem Graphically Transportation Problem Graphically Transportation Problem Graphically Transportation Problem Graphically Transportation Problem Graphically Transportation Problem Graphically Linear Programming Formulation Linear Programming Formulation Min Z = C11X11 + ... + C1nX1n + C21X21 + ... + CmnXmn Linear Programming Formulation Min Z = C11X11 + ... + C1nX1n + C21X21 + ... + CmnXmn Subject to X11 + ... + X1n = a1X21 + ... + X2n = a2 :Xm1 + ... + Xmn = am Linear Programming Formulation Min Z = C11X11 + ... + C1nX1n + C21X21 + ... + CmnXmn Subject to X11 + ... + X1n = a1X21 + ... + X2n = a2 :Xm1 + ... + Xmn = am X11 + ... + Xm1 = b1X12 + ... + Xm2 = b2 : X1n + ... + Xmn = bn Specialized Methods Linear programming model is difficult to formulate solve Special purpose methods used Easier to formulate Faster to compute Give integer solutions Methods North-west corner method Transportation Problem Solution Steps Define problem Set up transportation table (matrix) Summarizes all data Keeps track of computations Develop initial solution Northwest corner rule Find optimal solution Transportation table Transportation table (cont) Transportation simplex method Initialization. Transportation simplex method 确定初始方案－最小元素法. Initialization Initialization (cont) Initialization (cont) An example First step : initialization Finding the least number in table Finding the least number in table (cont) Finding the least number in table