7 views

Uploaded by Mimi

Production management

- OR
- Wang 2003
- 1 Introduction
- 6%2E1994-4361
- out19
- Some New Algorithms for Solving a System of General
- Reviewer MGNT
- birge_quantdays2007_dynamicportfolios
- Supplementary Material
- AISC
- modelado ec.diferenciales
- Skrainka_OptHessians
- Documentation of the Calculations
- OD Intro 2010
- Unbounded Solution
- Shell Structures
- Matlab Optimization
- 20816205
- Lund E. Finite Element Based Design Sensitivity Analysis and Optimization (1994)(en)(234s)
- 3_041

You are on page 1of 20

Model

Casanova

Lim

Mai

Transportation Model

cost for distributing homogeneous units of a product from several

points of supply (origin) to a number of points of demand

(destinations)

– WHAT ARE THE CHEAPEST ROUTES TO SEND A CERTAIN NUMBER OF

PRODUCTS FROM A CERTAIN NUMBER OF SUPPLIER TO A CERTAIN

NUMBER OF DESTINATIONS?

Consider the following:

1. Number of sources

and their capacity to

supply the products to

distribute

2. Number of

destinations and their

demand

3. Per-unit cost of

shipping the products

from a certain source

to a certain

destination

TERMS

source or supply location in a transportation problem

– Unused squares are squares which represent routes where no quantity is

shipped between a source and a destination

– Used squares/ Stone squares

Problem:

The WSS Company sells desktop computers to IT companies in Metro Manila, and ships

them from three distribution warehouses located in three (3) different areas. The company

is able to supply the following numbers of desktop computers to IT companies by the

beginning of the year:

Distribution Warehouse Supply

Warehouse 1 150

Warehouse 2 200

Warehouse 3 50

Total 400

IT Companies have ordered desktop computers that must be delivered and

installed by the beginning of the year:

IT Company Demand

(Desktop computers)

AUS Link 100

SJS Networking Inc. 80

RFS Data Limited 220

Total 400

The shipping costs per desktop computer from each distributor to each

company are as follows:

From Destination

A B C

1 7 5 9

2 10 12 10

3 6 3 14

Solution:

Distribution Warehouse Supply

Warehouse 1 150

Warehouse 2 200

Warehouse 3 50

Total 400

IT Company Demand

(Desktop computers)

AUS Link 100

SJS Networking Inc. 80

RFS Data Limited 220

Total 400

From Destination

A B C

1 7 5 9

2 10 12 10

3 6 3 14

Objective Function:

Minimize C = 7X1A + 5X1B + 9X1C + 10X2A + 12X2B + 10X2C + 6X3A + 3X3B +

14X3C

Constraints:

Subject to: X1A+X1B+X1C = 150

X2A+X2B+X2C = 200

X3A+X3B+X3C = 50

X1A+X2a+X3A = 100

X1B+X2B+X3B = 80

X1C+X2C+X3C = 220

Xij ≥ 0

METHODS OF

ESTABLISHING THE

INITIAL FEASIBLE

SOLUTION

1. Northwest Corner Rule (NCR)

2. Greedy Method or Minimum Cost Method (MCM)

3. Vogel’s Approximation Method (VAM)

Northwest Corner Rule (NCR)

problem that starts with allocating units to the upper left-hand corner and

ends in the lower right corner of any transportation problem.

Solution:

METHODS OF

ESTABLISHING THE

OPTIMAL FEASIBLE

SOLUTION

1. Stepping Stone Method (SSM)

2. Modified Distribution Method (MODI)

OTHER

TRANSPORTATION

PROBLEMS

1. Degeneracy

2. Maximization Problems

3. Unbalanced Transportation Problem

Degeneracy

occupied cells that is less than the number of rows plus the number of columns

minus one, or R + C – 1.

Degeneracy (cont.)

material, in some cells until R + C – 1 cells have some amount in them. The 𝜀 is

assigned to that unoccupied cell which has the minimum transportation cost.

Degeneracy (cont.)

Maximization Problem

transportation problem by subtracting each transportation cost from maximum

transportation cost.

Unbalanced Transportation

Problem

The total supply is not equal to the total demand.

To solve:

– If supply is greater than demand, add another column

– If demand is greater than supply, add another row.

Sources

http://www.universalteacherpublications.com/univ/ebooks/or/Ch5/degen.htm

http://www.universalteacherpublications.com/univ/ebooks/or/Ch5/max.htm

http://www.universalteacherpublications.com/univ/ebooks/or/Ch5/unbal.htm

– Dilworth, J.B. (1993). The Transportation Method. Linear Programming, 703-

705.

– Ibid., 710-713

– Sirug, W.S. (2012). Methods in Establishing the Initial and Optimal Feasible

Solution. Transportation Model, 142-166.

- ORUploaded byapi-3751356
- Wang 2003Uploaded byKrešo Ivišić
- 1 IntroductionUploaded byNomanqureshi
- 6%2E1994-4361Uploaded byCromeXza
- out19Uploaded bymfmechanics
- Some New Algorithms for Solving a System of GeneralUploaded byRafia Latif
- Reviewer MGNTUploaded byJv Chiu
- birge_quantdays2007_dynamicportfoliosUploaded byXi Wang
- Supplementary MaterialUploaded byProduction_Research
- AISCUploaded byIngrid Irreño Palomo
- modelado ec.diferencialesUploaded byEstrada Louis
- Skrainka_OptHessiansUploaded byHector Perez Saiz
- Documentation of the CalculationsUploaded bymissesspeedy
- OD Intro 2010Uploaded bycarolinarvsocn
- Unbounded SolutionUploaded byHunain Memon
- Shell StructuresUploaded byAshraf Mahmoud
- Matlab OptimizationUploaded bymjdjar
- 20816205Uploaded bysingh
- Lund E. Finite Element Based Design Sensitivity Analysis and Optimization (1994)(en)(234s)Uploaded byPrashant Gupta
- 3_041Uploaded byWeins Gemerlap
- Fast Voltage Stabilty Index Based Optimal Reactive Power Planning Using Differential EvolutionUploaded byAnonymous LSebPS
- 4.2d - 4.6b -Uploaded byVashish Ramrecha
- Chap 012Uploaded byLina Ahmed
- Optimization GRG_ MethodUploaded byDeepak Sharma
- 191557879-Differential-Evolution-Gp.pdfUploaded byselvam
- Aspecte Privind Costurile Si Per for Manta IntreprinderiiUploaded byjuventute
- PresentationOM.pptxUploaded byGohil Hardik
- Numerical PDE -- Juan Carlos de Los ReyesUploaded byNatalie Mcintyre
- Teaching Mechanics With MapleUploaded byBlueOneGauss
- final imdcUploaded byAhmad Zikri

- Block Lu FactorizationUploaded byJubayer Ahmed
- Ecuacion de 6 GradoUploaded byDarkzen Dragon
- Notes (PennStateU)-Interpolation (Newton's Polynomial - Proof)Uploaded bywillcatemp
- 1309.6064_3Uploaded bymittalnipun2009
- Recursive Automata 2Uploaded bybbscribed
- C03.01 MEC500RK Roots of Equation - Bracketing MethodUploaded byjuuuunnnnssss
- Linear Programing and Types of Matrix (2)Uploaded byAbdu Mohammed
- scientific-computing.pdfUploaded byBcalh3
- Linear Prog Graphical MethodUploaded byMuhamad Ridzuan
- Fast Fourier TransformUploaded byLucas Gallindo
- Simpson RuleUploaded byNichupan Pratheeprat
- chap4.pdfUploaded byGetachew
- Secant MethodUploaded bysofianina05
- Fem Project 1Uploaded byMainak Sarkar
- Transportation ProbUploaded bySuvam
- Fuzzy LogicUploaded byKebenaran Itupahit
- shootingUploaded byHatice Kzkrn Karabenli
- 4-The Simplex MethodUploaded bySaurabh sinha
- Runge Kutta 2nd OrderUploaded byALlan ABiang
- root finding methods.pdfUploaded bycoolsef
- Curve FittingUploaded byhillary
- Project 2 ReportUploaded byVenuAgarwal
- 2 Overview of Numerical AnalysisUploaded byVashish Ramrecha
- Numerical Op Tim IzationUploaded bySescioreanu Mihai
- The Decompositional Approach to Matrix ComputationUploaded byPeet89
- IS_PowerMethodUploaded byYun Jun Ng
- Two Layers Soil Stratification Using NumericalUploaded byRaul Marihuan González
- Solved Papers QM II(2005) Quiz3(Key)Uploaded byvignesh__m
- multigrids1Uploaded byDaniil Andrienko
- Neutrosophic Goal Programming Technique and its ApplicationUploaded byMia Amalia