Scribd Logo
Upload

Welcome to Scribd!

  • 267 views

    Group-2 Bloomex

    Uploaded by

    Rajneesh
    The document presents a logistics optimization problem for transporting goods from supply nodes to demand nodes with minimum cost. It involves determining the optimal amounts to transport between nodes while satisfying supply, demand and transshipment constraints. The methodology is to minimize the overall transportation costs subject to the constraints. The problem is represented as a network flow problem and solved using linear programming to determine the least cost solution.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd

    Group-2 Bloomex

    Uploaded by

    Rajneesh
    267 views7 pages
    The document presents a logistics optimization problem for transporting goods from supply nodes to demand nodes with minimum cost. It involves determining the optimal amounts to transport between nodes while satisfying supply, demand and transshipment constraints. The methodology is to minimize the overall transportation costs subject to the constraints. The problem is represented as a network flow problem and solved using linear programming to determine the least cost solution.

    Original Description:

    Bloomex operations research

    Original Title

    GROUP-2_BLOOMEX

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document presents a logistics optimization problem for transporting goods from supply nodes to demand nodes with minimum cost. It involves determining the optimal amounts to transport between nodes while satisfying supply, demand and transshipment constraints. The methodology is to minimize the overall transportation costs subject to the constraints. The problem is represented as a network flow problem and solved using linear programming to determine the least cost solution.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Download as xlsx, pdf, or txt
    267 views7 pages

    Group-2 Bloomex

    Uploaded by

    Rajneesh
    The document presents a logistics optimization problem for transporting goods from supply nodes to demand nodes with minimum cost. It involves determining the optimal amounts to transport between nodes while satisfying supply, demand and transshipment constraints. The methodology is to minimize the overall transportation costs subject to the constraints. The problem is represented as a network flow problem and solved using linear programming to determine the least cost solution.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Download as xlsx, pdf, or txt
    You are on page 1of 7

    GROUP 2 - BLOOMEX.

    CA LOGISTICS OPTIM

    NETWORK REPRESENTATI

    SUPPLY TRANSHIPMENT

    South America

    Southeast Asia

    Europe

    Ontario

    Formulation of the problem


    Minimize Cij*Xij

    Cij- The cost of transporting from node i to j(Unit cost)


    Xij - The amount transported from node i to j

    Nodes:-

    SUPPLY TRANSHIPMENT DEMAND


    1050 South America-1 Ontario-5 Ontario-8
    30 Southeast Asia-2 Florida-6 Vancouver-9
    UNLIMITED Europe-3 Vancouver-7 Calgary-10
    100 Ontario-4 Winnipeg-11
    Ottawa-12
    Montreal-13
    Halifax-14

    TRANSPORTATION COSTS:-

    Ontario Florida Vancouver


    SA 14 9 20
    SEA 35 20 35
    Europe 30 15 35
    Ontario 0 0 15

    Ontario Vancouver Calgary


    Ontario 0 15 14
    Florida 5 10 10
    Vancouver 14 0 7

    METHODOLOGY ADOPTED:-

    Minimize the Overall Transportation Costs

    14X15+9X16+20X17+35X25+20X26+35X27+30X35+15X36+35X37+0X45+15X47
    X511+3.5X512+3.5X513+4X514+5X68+10X69+10X610+10X611+7.5X612+7.5X61
    7X710+8X711+14X712+14X713+22X714

    Subject to:-

    Demand constraints at each delivery point


    X58+X68+X78=381
    X59+X69+X79=191
    X510+X610+X710=171
    X511+X611+X711=64
    X512+X612+X712=127
    X513+X613+X713=184
    X514+X614+X714=64

    Transshipment constraint (In-out=0)


    X15+X25+X35+X45-X58-X59-X510-X511-X512-X513-X514=0
    X16+X26+X36-X68-X69-X610-X611-X612-X613-X614=0
    X17+X27+X37+X47-X78-X79-X710-X711-X712-X713-X714=0
    Supply constraint
    X15+X16+X17<=1050
    X25+X26+X27<=30
    X35+X36+X37<=INFINITE
    X45+X47<=100
    X.CA LOGISTICS OPTIMIZATION CASE SOLUTION

    WORK REPRESENTATION

    NSHIPMENT DEMAND

    Ontario

    Vancouver

    Ontario Calgary

    Florida Winnipeg

    Vancouver Ottawa

    Montreal

    Halifax

    DEMAND
    381
    191
    171
    64
    127
    184
    64

    Winnipeg Ottawa Montreal Halifax


    13 3.5 3.5 4
    10 7.5 7.5 10
    8 14 14 22

    X35+15X36+35X37+0X45+15X47+0X58+15X59+14X510+13
    0X610+10X611+7.5X612+7.5X613+10X614+14X78+0X79+

    X513-X514=0

    X713-X714=0
    SUPPLY
    Ontario Florida Vancouver Agg Supply
    SA 345 705 0.00 1050
    SEA 0 0 0 0
    Europe 0 32 0 32
    Ontario 100 0 0 100
    Inflow to TC 445 737 0.00

    DEMAND
    Ontario Vancouver Calgary Winnipeg
    Ontario 381 0 0 0
    Florida 0 191 171 64
    Vancouver 0 0 0 0
    Agg. Demand 381 191 171 64
    Total Demand 381 191 171 64

    TRANSPORTATION COSTS

    Ontario Florida Vancouver


    SA 14 9 20
    SEA 35 20 35
    Europe 30 15 35
    Ontario 0 0 15

    Ontario Vancouver Calgary Winnipeg


    Ontario 0 15 14 13
    Florida 5 10 10 10
    Vancouver 14 0 7 8
    Total Supply
    <= 1050
    <= 30
    <= 1182 (unlimited)
    <= 100

    Ottawa Montreal Halifax Outflow from TC Infow to TC


    0 0 64 445 = 445
    127 184 0 737 = 737
    0 0 0 0 = 0.00
    127 184 64
    127 184 64

    Final Cost 18503.5

    Ottawa Montreal Halifax


    3.5 3.5 4
    7.5 7.5 10
    14 14 22

    You might also like