Transportation model

  • 15,398 views
Uploaded on

If you want this presentation just give me a mail to lokeshpayasi@gmail.com

If you want this presentation just give me a mail to lokeshpayasi@gmail.com

More in: Education
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
  • how to solve the north corner rule method
    Are you sure you want to
    Your message goes here
No Downloads

Views

Total Views
15,398
On Slideshare
0
From Embeds
0
Number of Embeds
0

Actions

Shares
Downloads
419
Comments
1
Likes
1

Embeds 0

No embeds

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
    No notes for slide

Transcript

  • 1. GYAN GANGA INSTITUTE OF
    TECHNOLOGY AND MANAGEMENT, BHOPAL
    Transportation Problem
    Presented by:
    • Aditya Khare
    • 2. Dhruvnanada Singh Gour
    • 3. Mohd. Muqeem Mansoori
    • 4. Rahul Jain
    Guided by:
    Prof. Lokesh Payasi
  • 5. Definition
    • It deals with problems concerning as to what happens to the effectiveness function when we associate each of a number of origins with each of a possibly different number of destination.
  • History
    • “The Distribution of a Product from Several Sources of Numerous Localities”
    Study by: F.L. Hitchcock(1941)
    • “Optimum Utilization of the Transportation System”
    Study by: T.C. Koopmans(1947)
    These two contribution are mainly responsible for the development of Transportation Model.
  • 6. Application of Transportation Problem
    • Minimize shipping costs
    • 7. Determine low cost location
    • 8. Find minimum cost production schedule
    • 9. Military distribution system
  • Process
    • Standardization of problem
    • 10. Check the nature of the problem
    • 11. Check prohibited cell
    • 12. Check balancing problem
  • Methods
    • North West Corner Rule (NWCR)
    • 13. Row Minima Method
    • 14. Column Minima Method
    • 15. Least Cost Method
    • 16. Vogle Approximation Method (VAM)
  • North West Corner Rule (NWCR)
    • This method consists in allocating in the north-west corner of the matrix.
    Supply
    North-west Corner
    6
    Demand
    /1
  • 17. Row Minima Method
    • This method consists in allocating as much as possible lowest cost cell of the first row.
    Supply
    Minimum cost in the Row
    Demand
  • 18. Column Minima Method
    • This method consists in allocating as much as possible lowest cost cell of the first column.
    Supply
    Minimum cost in the Column
    Demand
  • 19. Least Cost Method
    • This method consists in allocating as much as possible lowest cost cell of the table.
    Supply
    Minimum cost in the Table
    Demand
  • 20. Vogle’s Approximation Method
    • Step 1: Compute the penalties.
    • 21. Step 2: Identify the largest penalty and assign the highest possible value to
    the variable.
    • Step 3: Identify the largest penalty and assign the highest possible value to
    the variable.
    • Step 4: Identify the largest penalty and assign the highest possible value to
    the variable.
  • 22. Vogel’s Method
    Transportation-12
  • 23. AssignmentProblem
  • 24. Introduction
    • It concern to assign a number of resources (origin) to equal number
    of jobs (destination) on to one basis so as to minimize total costs of performing the tasks at hand or maximize total profit of allocation.
  • 25. Applications
    • Assign vehicles to routes.
    • 26. Assign salesmen to sales territories.
    • 27. Assign accountant to clients accounts.
    • 28. Assign development engineers to several construction sites.
    • 29. Assign contracts to bidders through systematic evaluation of bids from competing suppliers.
    • 30. Schedule teachers to classes, etc.
  • Few important Points
    • Balanced Assignment Problem.
    • 31. Unbalanced Assignment Problem.
    • 32. Dummy Job/Facility
    • 33. An Infeasible Assignment.
  • Solution
    Minimum Value of the column
    New Matrix after subtracting the minimum value
  • 34. Thank You