Scribd Logo
Upload

Welcome to Scribd!

  • OPRH Session 17 Template

    Uploaded by

    Deepanjan Sur
    7 views6 pages
    The document appears to be a description of a shortest route problem for Tri-State Shipping Company. It includes a distance matrix showing the distances between 6 cities (Chicago, Indianapolis, Green Bay, South Bend, Detroit, Cincinnati) and Cleveland. It also includes the variables and constraints that would be set up to model this problem as a linear program to determine the shortest routes between locations while respecting flow constraints.

    Original Description:

    Original Title

    OPRH_Session_17_Template.xlsx

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document appears to be a description of a shortest route problem for Tri-State Shipping Company. It includes a distance matrix showing the distances between 6 cities (Chicago, Indianapolis, Green Bay, South Bend, Detroit, Cincinnati) and Cleveland. It also includes the variables and constraints that would be set up to model this problem as a linear program to determine the shortest routes between locations while respecting flow constraints.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views6 pages

    OPRH Session 17 Template

    Uploaded by

    Deepanjan Sur
    The document appears to be a description of a shortest route problem for Tri-State Shipping Company. It includes a distance matrix showing the distances between 6 cities (Chicago, Indianapolis, Green Bay, South Bend, Detroit, Cincinnati) and Cleveland. It also includes the variables and constraints that would be set up to model this problem as a linear program to determine the shortest routes between locations while respecting flow constraints.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 6

    Sr No Arc Distance

    1 1 to 2 9
    2 1 to 6 8
    3 2 to 3 8
    4 2 to 5 12
    5 3 to 4 7
    6 4 to 5 10
    7 4 to 8 15
    8 4 to 9 11
    9 5 to 8 5
    10 5 to 6 10
    11 6 to 7 6
    12 6 to 8 14
    13 7 to 8 20
    14 7 to 11 9
    15 8 TO 9 18
    16 9 TO 10 10
    17 8 TO 11 7
    18 8 TO 10 6
    19 7 TO 12 18
    20 10 TO11 9
    21 9 TO 17 14
    22 10 TO 17 11
    23 10 TO 16 10
    24 11 TO 12 17
    25 11 TO 14 11
    26 12 TO 14 7
    27 14 TO 16 12
    28 16 TO 17 13
    29 12 TO 13 13
    30 13 TO 14 15
    31 13 TO 15 19
    32 14 TO 15 10
    33 15 TO 16 9
    34 16 TO 18 11
    35 15 TO 18 18
    Sr No Arc
    9 5 to 8 5
    11 6 to 7 6
    18 8 TO 10 6
    5 3 to 4 7
    17 8 TO 11 7
    26 12 TO 14 7
    2 1 to 6 8
    3 2 to 3 8
    1 1 to 2 9
    14 7 to 11 9
    20 10 TO11 9
    33 15 TO 16 9
    6 4 to 5 10
    10 5 to 6 10
    16 9 TO 10 10
    23 10 TO 16 10
    32 14 TO 15 10
    8 4 to 9 11
    22 10 TO 17 11
    25 11 TO 14 11
    34 16 TO 18 11
    4 2 to 5 12
    27 14 TO 16 12
    28 16 TO 17 13
    29 12 TO 13 13
    12 6 to 8 14
    21 9 TO 17 14
    7 4 to 8 15
    30 13 TO 14 15
    24 11 TO 12 17
    15 8 TO 9 18
    19 7 TO 12 18
    35 15 TO 18 18
    31 13 TO 15 19
    13 7 to 8 20
    Tri-State Shipping Company Shortest Route Problem
    0-1 Varaible Matrix
    From/To Chicago (1) Indianapolis (2) Green Bay (3) South Bend (4) Detriot (5) Cincinnati (6)
    Chicago (1)
    Indianapolis (2)
    Green Bay (3)
    South Bend (4)
    Detriot (5)
    Cincinnati (6)
    Cleveland (7)
    Total Flow out
    Distance Matrix
    From/To Chicago (1) Indianapolis (2) Green Bay (3) South Bend (4) Detriot (5) Cincinnati (6)
    Chicago (1) 9999 180 200 100 9999 9999
    Indianapolis (2) 180 9999 9999 145 9999 120
    Green Bay (3) 200 9999 9999 300 450 9999
    South Bend (4) 100 145 300 9999 215 240
    Detriot (5) 9999 9999 450 215 9999 9999
    Cincinnati (6) 9999 120 9999 240 9999 9999
    Cleveland (7) 9999 9999 9999 250 160 225
    Total Distance 0
    Cleveland (7) Total Flow in
    Flow Conservation
    Constraints
    Nodes Network Flow
    1 0
    2 0
    3 0
    4 0
    5 0
    6 0
    Cleveland (7) 7 0
    9999
    9999
    9999
    250
    160
    225
    9999
    Question 1
    Matrix of Actual Flow
    From\To 1 2 3 4 5 Total Flow from
    1 0
    2 0
    3 0
    4 0
    5 0
    Total Flow to 0 0 0 0 0
    Matrix Flow Capacities
    From\To 1 2 3 4 5 Nodes Net Flow
    1 12 8 10 1 0
    2 4 7 2 0
    3 4 3 14 3 0
    4 3 6 4 0
    5 9999 5 0

    Maximum Flow = 0
    RHS
    0
    0
    0
    0
    0

    You might also like