forked from EmilienDupont/facilityLocation
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfacility.py
More file actions
executable file
·95 lines (68 loc) · 2.41 KB
/
facility.py
File metadata and controls
executable file
·95 lines (68 loc) · 2.41 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
#!/usr/bin/env python
from gurobipy import *
import math
import StringIO
clients = [[100,200], [150,250], [650, 200], [50, 300]]
facilities = []; charge = []
for i in range(10):
for j in range(10):
facilities.append([i*70, j*50])
charge.append(1)
def mycallback(model, where):
if where == GRB.callback.MESSAGE:
print >>model.__output, model.cbGet(GRB.callback.MSG_STRING),
def distance(a,b):
dx = a[0] - b[0]
dy = a[1] - b[1]
return math.sqrt(dx*dx + dy*dy)
def optimize(clients, facilities, charge, output=False):
numFacilities = len(facilities)
numClients = len(clients)
m = Model()
if not output:
m.params.OutputFlag = 0
m.setParam('TimeLimit', 10)
# Add variables
x = {}
y = {}
d = {} # Distance matrix (not a variable)
for j in range(numFacilities):
x[j] = m.addVar(vtype=GRB.BINARY, name="x%d" % j)
for i in range(numClients):
for j in range(numFacilities):
y[(i,j)] = m.addVar(lb=0, vtype=GRB.CONTINUOUS, name="t%d,%d" % (i,j))
d[(i,j)] = distance(clients[i], facilities[j])
m.update()
# Add constraints
for i in range(numClients):
for j in range(numFacilities):
m.addConstr(y[(i,j)] <= x[j])
for i in range(numClients):
m.addConstr(quicksum(y[(i,j)] for j in range(numFacilities)) == 1)
m.setObjective( quicksum( charge[j]*x[j] + quicksum(d[(i,j)]*y[(i,j)] for i in range(numClients))
for j in range(numFacilities) ), GRB.MINIMIZE)
output = StringIO.StringIO()
m.__output = output
m.optimize(mycallback)
if (m.status != 2):
return ["error"]
solution1 = []
solution2 = []
for j in range(numFacilities):
if (x[j].X > .5):
solution1.append(j)
for i in range(numClients):
for j in range(numFacilities):
if (y[(i,j)].X > .5):
solution2.append([i,j])
return [solution1, solution2, output.getvalue()]
def handleoptimize(jsdict):
if 'clients' in jsdict and 'facilities' in jsdict and 'charge' in jsdict:
solution = optimize(jsdict['clients'], jsdict['facilities'], jsdict['charge'])
return {'solution': solution }
if __name__ == '__main__':
import json
jsdict = json.load(sys.stdin)
jsdict = handleoptimize(jsdict)
print 'Content-Type: application/json\n\n'
print json.dumps(jsdict)