Scribd Logo
Unggah

Selamat datang di Scribd!

  • Transshipment

    Diunggah oleh

    HABIB UR REHMAN
    48 tayangan10 halaman
    Transportation problem allows only shipments that go directly from supply points(source) to demand points(Destination) But in many situations some intermediary involved between supply and demand points. By solving transshipment problems through lonear programming we seek to minimize total cost of transshipment.

    Deskripsi Asli:

    Hak Cipta

    © Attribution Non-Commercial (BY-NC)

    Format Tersedia

    PPTX, PDF, TXT atau baca online dari Scribd

    Apakah menurut Anda dokumen ini bermanfaat?

    Apakah konten ini tidak pantas?

    Laporkan Dokumen Ini
    Transportation problem allows only shipments that go directly from supply points(source) to demand points(Destination) But in many situations some intermediary involved between supply and demand points. By solving transshipment problems through lonear programming we seek to minimize total cost of transshipment.

    Hak Cipta:

    Attribution Non-Commercial (BY-NC)
    Unduh sebagai PPTX, PDF, TXT atau baca online dari Scribd
    Tandai sebagai konten tidak pantas
    48 tayangan10 halaman

    Transshipment

    Diunggah oleh

    HABIB UR REHMAN
    Transportation problem allows only shipments that go directly from supply points(source) to demand points(Destination) But in many situations some intermediary involved between supply and demand points. By solving transshipment problems through lonear programming we seek to minimize total cost of transshipment.

    Hak Cipta:

    Attribution Non-Commercial (BY-NC)
    Unduh sebagai PPTX, PDF, TXT atau baca online dari Scribd
    Tandai sebagai konten tidak pantas
    dari 10

    SSHIPMENT

    constraint

    Click to edit Master subtitle style

    Courte sy: Beyond Food Products

    5/2/12

    Introduction:
    A transportationproblem allows onlyshipments that go directly from supply points(source) to demand points(Destination). But in many situations some intermediary involved between supply & demand points. Such problem are called transshipment problem. By solving Transshipment problems through lonear programming we seek to minimize total cost of transshipment.

    5/2/12

    Example (Beyond Foods Pakistan) Ware Houses


    Supply Plant 600units Lahore 400units Rawalpin di Demand 200units Clifton
    (per unit cost)

    Gulshan
    (per unit cost)

    70

    74

    78 Retail Outlets 82 150units 350units 300units Nazimaba Defence Johar PECHS Cost per unit Cost per unit Cost per unit d
    Cost per unit

    Warehous es Clifton Gulshan

    15 18

    10 20

    20 15

    12 5/2/12 10

    Some Consideration:

    PECHS Outlet will also receive goods directly from Rawalpindi warehouse & also from Johar outlet, for this cost are shown below:
    PECHS Per unit Cost 80 8

    Rawalpindi (warehouse) Johar (Retail-outlet)

    Demand=Supply Nothing will remain at warehouse Looking for Transshipment cost 5/2/12

    Network Representation:
    Supply (Source Nodes)

    Demand (Destination Nodes)

    Ware House (Transshipment Nodes)

    Nazimabad 200

    Lahore 600

    2
    Rwpindi 400

    8 0 8Nodes=8Const raints 14arcs=14varia

    7 0 7 4 7 8 8 2

    3 1 Clifton 5 1 0 2 0 1 41 2 82 Gulshan 01 5 1 0

    6
    Defence 150

    7 Joh ar 8 350 8
    5/2/12
    PECH S 300

    Construct

    Formulate Linear Programming Model


    each arc: Source Nodes Constraints: 600 X13+X14 <= X23+X24+X28<=40 0 Constraint for each node & variable for Transshipment Nodes X35Constraints: = X13+X23 +X36+X37+X38
    -X13-X23+X35+X36+X37+X38 = 0 X45+X46+X47+X48=X14+X24 -X14-X24+X45+X46+X47+X48 = 0

    Destination Nodes Constraints: X35+X45=200 X36+X46=150 X37+X47-X78=350 X38+X48+X28+X78=300

    5/2/12

    Formulate Linear Programming Model


    Minimize

    70X13+74X14+78X23+82X24 15X35+10X36+20X37+12X38 +18X45+20X46+15X47+10X48 +8X78+80X28


    Xij>=0 for all i & j

    Origin nodes i Destination nodes j


    5/2/12

    QM Windows Results:
    Variable X13 (plant) X14 (plant) X23 (plant) X24 (plant) X35 (warehouse) X36 (warehouse) X37 (warehouse) X38 (warehouse) Status Basic Basic Basic NONBasi c Basic Basic Value 250 350 100 0 200 150

    NONBasi 0 c NONBasi 0 c

    5/2/12

    Costing:
    Directi on X13:
    X14: X23: X35: X36: X47: X28:

    Tot Uni Co al ts 250 x st 70= 17500

    350 x 74= 25900 100 x 78= 7800 200 x 15= 3000 150 x 10= 1500 350 x 15= 5250 300 x 80= 24000

    84950
    5/2/12

    THANK YOU ALL


    Click to edit Master subtitle style

    5/2/12

    Anda mungkin juga menyukai