KEMBAR78
Transshipment Model | PDF | Systems Theory | Computational Science
Scribd
Upload
72 views5 pages

Transshipment Model

The solver found a solution that minimized the total cost of 5200. It assigned values to 13 transportation routes between 4 cities to satisfy all constraints and shipment requirements. The solution had Denver shipping 550 units to Kansas City and 50 units to Louisville, and other routes between Atlanta, Kansas City, Louisville, Detroit, Miami, Dallas, and New Orleans to meet the supply and demand levels at each location while minimizing overall cost.

Uploaded by

Aryan Verma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
72 views5 pages

Transshipment Model

The solver found a solution that minimized the total cost of 5200. It assigned values to 13 transportation routes between 4 cities to satisfy all constraints and shipment requirements. The solution had Denver shipping 550 units to Kansas City and 50 units to Louisville, and other routes between Atlanta, Kansas City, Louisville, Detroit, Miami, Dallas, and New Orleans to meet the supply and demand levels at each location while minimizing overall cost.

Uploaded by

Aryan Verma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Microsoft Excel 14.

0 Answer Report
Worksheet: [Ryan.xlsx]Solution
Report Created: 2/20/2011 2:57:39 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine

Solver Options

Objective Cell (Min)


Name Original Value Final Value
Minimize Total Cost 0.000 5200.000

Variable Cells
Model Variable Name Original Value Final Value
X13 Denver - Kansas City 0.000 550.000
X14 Denver - Louisville 0.000 50.000
X23 Atlanta - Kansas City 0.000 0.000
X24 Atlanta - Louisville 0.000 400.000
X35 Kansas City - Detroit 0.000 200.000
X36 Kansas City - Miami 0.000 0.000
X37 Kansas City - Dallas 0.000 350.000
X38 Kansas City - New Orleans 0.000 0.000
X45 Louisville - Detroit 0.000 0.000
X46 Louisville - Miami 0.000 150.000
X47 Louisville - Dallas 0.000 0.000
X48 Louisville - New Orleans 0.000 300.000

Constraints
Name Cell Value Status Slack
Denver Net Shipments 600 Binding 0
Atlanta Net Shipments 400 Binding 0
Kansas City Net Ship 0 Binding 0
Louisville Net Shipme 0 Binding 0
Detroit Net Shipments -200 Binding 0
Miami Net Shipments -150 Binding 0
Dallas Net Shipments -350 Binding 0
New Orleans Net Ship -300 Binding 0
Integer
Contin
Contin
Contin
Contin
Contin
Contin
Contin
Contin
Contin
Contin
Contin
Contin
A B C D E F G H I J K L
1 Ryan Electronics Transshipment
2
3
4 Arc Cost
5 Denver - Kansas City 2 550 Units Shipped Net
6 Denver - Louisville 3 50 Node In Out Shipments Supply
7 Atlanta - Kansas City 3 0 Denver 600 600 <= 600
8 Atlanta - Louisville 1 400 Atlanta 400 400 <= 400
9 Kansas City - Detroit 2 200 Kansas City 550 550 0 = 0
10 Kansas City - Miami 6 0 Louisville 450 450 0 = 0
11 Kansas City - Dallas 3 350 Detroit 200 -200 = -200
12 Kansas City - New Orleans 6 0 Miami 150 -150 = -150
13 Louisville - Detroit 4 0 Dallas 350 -350 = -350
14 Louisville - Miami 4 150 New Orleans 300 -300 = -300
15 Louisville - Dallas 6 0
16 Louisville - New Orleans 5 300
17
18 Minimize Total Cost 5200
19
20
21
Denver - Kansas City 2 1
Denver - Louisville 3 1
Atlanta - Kansas City 3 1
Atlanta - Louisville 1 1
Kansas City - Detroit 2 1
Kansas City - Miami 6 1
Kansas City - Dallas 3 1
Kansas City - New Orleans 6 1
Louisville - Detroit 4 1
Louisville - Miami 4 1
Louisville - Dallas 6 1
Louisville - New Orleans 5 1

Minimize Total Cost


Units Shipped Net
Node In Out Shipments Supply
Denver 2 2 <= 600
Atlanta 2 2 <= 400
Kansas City 2 4 2 = 0
Louisville 2 4 2 = 0
Detroit 200 -200 = -200
Miami 150 -150 = -150
Dallas 350 -350 = -350
New Orleans 300 -300 = -300

45

You might also like