Académique Documents
Professionnel Documents
Culture Documents
Data
Objective Function: (in $ of transportation cost) Min 5XDA + 4XDB + 3XDC + 8XEA + 4XEB + 3XEC + 9XFA + 7XFB + 5XFC
Subject to the constraints:
Flow Balance For Each Supply Node (inflow) - (outflow) = Net flow - (XDA + XDB + XDC) = -100 (Des Moines)
OR
(Des Moines)
Other Supply Nodes XEA + XEB + XEC = 300 XFA + XFB + XFC = 300
Flow Balance For Each Demand Node XDA + XEA + XFA = 300 (Albuquerque) XDB + XEB + XFB = 200 (Boston) XDC + XEC + XFC = 200 (Cleveland)
Go to File 5-1.xls
Flow Balance inflow < outflow inflow > outflow inflow = outflow
Objective Function: (in $ of transportation cost) Min 5XDA + 4XDB + 3XDC + 2XDE + 3XEA + 2XEB + 1XEC + 9XFA + 7XFB + 5XFC + 2XFE
Subject to the constraints:
Supply Nodes (with outflow only) - (XDA + XDB + XDC + XDE) = -100 (Des Moines) - (XFA + XFB + XFC + XFE) = -300 (Ft
Lauderdale)
Evansville (a supply node with inflow) (XDE + XFE) (XEA + XEB + XEC) = -300 Demand Nodes XDA + XEA + XFA = 300 XDB + XEB + XFB = 200 XDC + XEC + XFC = 200
(Albuquerque)
(Boston)
(Cleveland)
Go to File 5-4.xls
Assignment Model
For making one-to-one assignments Such as:
People to tasks Classes to classrooms Etc.
Decision Variables Xij = 1 if worker i is assigned to project j 0 otherwise Objective Function (in $ of wage cost) Min 11XA1 + 14XA2 + 6XA3 + 8XB1 + 10XB2 + 11XB3 + 9XC1 + 12XC2 + 7XC3
One Project Per Worker (supply nodes) - (XA1 + XA2 + XA3) = -1 (Adams) - (XB1 + XB2 + XB3) = -1 (Brown) - (XC1 + XC2 + XC3) = -1 (Cooper)
One Worker Per Project (demand nodes) XA1 + XB1 + XC1 = 1 (project 1) XA2 + XB2 + XC2 = 1 (project 2) XA3 + XB3 + XC3 = 1 (project 3)
Go to File 5-5.xls
Decision Variables Xij = number of cars per hour flowing from node i to node j Dummy Arc The X61 arc was created as a dummy arc to measure the total flow from node 1 to node 6
Flow Balance At Each Node (X61 + X21) (X12 + X13 + X14) (X12 + X42 + X62) (X21 + X24 + X26) (X13 + X43 + X53) (X34 + X35) (X14+ X24 + X34 + X64)(X42+ X43 + X46) (X35) (X53 + X56) (X26 + X46 + X56) (X61 + X62 + X64)
Node
=0 =0 =0 =0 =0 =0
2
3 4
5
6
Decision Variables Xij = flow from node i to node j Note: flow on arc ij will be 1 if arc ij is used, and 0 if not used Roads are bi-directional, so the 9 roads require 18 decision variables
Objective Function (in distance) Min 100X12 + 200X13 + 100X21 + 50X23 + 200X24 + 100X25 + 200X31 + 50X32 + 40X35 + 200X42 + 150X45 + 100X46 + 40X53 + 100X52 + 150X54 + 100X56 + 100X64 + 100X65
Subject to the constraints:
Node
(X12+X32+X42+X52)(X21+X23+X24+X25)=0
(X13 + X23 + X53) (X31 + X32 + X35) = 0
2
3
4
5 6
=1
Steps 1 and 2 Starting arbitrarily with node (house) 1, the closest node is node 3
After all nodes (homes) are connected the total distance is 16 or 1,600 feet of water pipe