OSD/gjx.py at main · peyote0916/OSD · GitHub

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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
# -*- coding: utf-8 -*-
# @Author : Xin He
# @E-mail ：2938268503@qq.com
import sys,os,random,time,copy,math
import arcpy
from pulp import *
reload(sys)
sys.setdefaultencoding('utf-8')

dataframe_s=[]
dataframe_d=[]
num_units=''
num_united=''
facilityCapacity =[]
nodes=[]
def TP_model(nodejs):

    aa=os.getcwd()

    import pulp
    try:
        prob = pulp.LpProblem("init_sdp",pulp.LpMinimize)#调用pulp
    except:
        prob = pulp.LpProblem("init_sdp",const.LpMinimize)#调用pulp
    variables = {}
    costs = {}

    for i in range(num_united):
        for j in range(num_units):
            variables["x_" +str(i)+ "_"+ str(j)]=pulp.LpVariable("x_" +str(i)+ "_"+ str(j), 0, None, pulp.LpInteger) #
            cost=nodejs[i][j]
            costs["x_" +str(i)+ "_"+ str(j)]=cost
    obj = 0
    # 计算所有需求点到所有供给点的总成本
    for x in variables:
        obj += costs[x] * variables[x]
    prob += obj
    #对于每个需求点来说，被服务的人口之和要等于需求点总人口
    for i in range(num_united):
        s = 0
        for j in range(num_units):
            s += variables["x_" + str(i) + "_" + str(j)]
        prob += s == nodes[i]
    for k in range(num_units):
        s = 0
        for i in range(num_united):
            s += variables["x_" + str(i) + "_" + str(k)]
        prob += s <= facilityCapacity[k]


    cbc = COIN_CMD()

    #模型求解
    #初始化求解时间
    prob.solve(cbc)
    if prob.status<0:
        arcpy.AddMessage("错误。求解失败，请重新核对数据")
    else:
        arcpy.AddMessage("解析并输出求解结果")

        assignsum = 0
        list_c = []
        for v in prob.variables():
            if v.varValue > 0:
                list_r = []
                items = v.name.split('_')
                i = int(items[1])
                k = int(items[2])
                dis=nodejs[i][k]
                assign = v.varValue
                list_r.append(i)
                list_r.append(k)
                list_r.append(assign)
                list_r.append(dis)
                list_c.append(list_r)
    return list_c
def TP_model_1(nodejs):

    aa=os.getcwd()

    import pulp
    try:
        prob = pulp.LpProblem("init_sdp",pulp.LpMinimize)#调用pulp
    except:
        prob = pulp.LpProblem("init_sdp",const.LpMinimize)#调用pulp
    variables = {}
    costs = {}

    for i in range(num_united):
        for j in range(num_units):
            variables["x_" +str(i)+ "_"+ str(j)]=pulp.LpVariable("x_" +str(i)+ "_"+ str(j), 0, None, pulp.LpInteger) #
            cost=nodejs[i][j]
            costs["x_" +str(i)+ "_"+ str(j)]=cost
    obj = 0
    # 计算所有需求点到所有供给点的总成本
    for x in variables:
        obj += costs[x] * variables[x]
    prob += obj
    #对于每个需求点来说，被服务的人口之和要等于需求点总人口
    for i in range(num_united):
        s = 0
        for j in range(num_units):
            s += variables["x_" + str(i) + "_" + str(j)]
        prob += s <= nodes[i]
    for k in range(num_units):
        s = 0
        for i in range(num_united):
            s += variables["x_" + str(i) + "_" + str(k)]
        prob += s == facilityCapacity[k]


    cbc = COIN_CMD()

    #模型求解
    #初始化求解时间
    prob.solve(cbc)
    if prob.status<0:
        arcpy.AddMessage("错误。求解失败，请重新核对数据")
    else:
        arcpy.AddMessage("解析并输出求解结果")

        assignsum = 0
        list_c = []
        for v in prob.variables():
            if v.varValue > 0:
                list_r = []
                items = v.name.split('_')
                i = int(items[1])
                k = int(items[2])
                dis=nodejs[i][k]
                assign = v.varValue
                list_r.append(i)
                list_r.append(k)
                list_r.append(assign)
                list_r.append(dis)
                list_c.append(list_r)
    return list_c