-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathulpkm3maxdistance.py
91 lines (82 loc) · 5 KB
/
ulpkm3maxdistance.py
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
from scipy import optimize as opt
import numpy as np
from scipy.optimize import minimize
import math
import copy
from km3maxdistance import km
# from helloword import User
class ulpkm:
def __init__(self,user,region,pB,k,B,cell,celllength):
self.cell=cell
self.cellltngth=celllength
self.user=user
self.region=region
self.pB=pB
self.k=k
self.B=B
self.pi=np.zeros(len(user))
self.kmuser=copy.deepcopy(user)
initregion = copy.deepcopy(region)
psokm = km(region=initregion, user=self.kmuser)
psokm.build_graph()
self.kmuser = psokm.KM()
# print("self.kmuser",self.kmuser)
def objective(self,x):
temp = 0
for i in range(len(self.kmuser)):
if (self.kmuser[i][5] != -1 and self.kmuser[i][6] != -1):
temp += math.pow(x[2 * i] - self.kmuser[i][5], 2) + math.pow(x[2 * i + 1] - self.kmuser[i][6], 2)
return temp
def constraint1(self,x):
for i in range(len(self.kmuser)):
# 用户匹配缺车匹配成功
if (self.kmuser[i][5] != -1 and self.kmuser[i][6] != -1):
lslarr = math.sqrt(math.pow((self.user[i][0] - self.user[i][2]), 2) + math.pow(
(self.user[i][1] - self.user[i][3]), 2)) # 起点到终点
lslact = math.sqrt(
math.pow((self.user[i][0] - x[2 * i]), 2) + math.pow((self.user[i][1] - x[2 * i + 1]), 2)) # 起点到实际位置
larrlact = math.sqrt(
math.pow((x[2 * i] - self.user[i][2]), 2) + math.pow((x[2 * i + 1] - self.user[i][3]), 2))
self.pi[i] = self.pB * (lslact - lslarr) + self.k * (larrlact) * (larrlact)
if (self.pi[i] < 0):
self.pi[i] = 0
# 匹配未成功，用户无需匹配，直接归还到目的地
else:
self.pi[i] = 0
return -(sum(self.pi) - self.B)
def run(self):
cons = list()
# for i in range(len(self.user)):
# con = lambda x: -(math.pow(x[2 * i] - self.user[i][2], 2) + math.pow(x[2 * i + 1] - self.user[i][3], 2) - math.pow(
# self.user[i][4], 2))
# cons.append({'type': 'ineq', 'fun': con})
cons.append({'type': 'ineq', 'fun': self.constraint1})
x0 = list()
for i in range(len(self.user)):
x0.append(self.user[i][2])
x0.append(self.user[i][3])
bnds = [[0,self.cell*self.cellltngth ] for x in x0]
solution = minimize(self.objective, x0, method='SLSQP', bounds=bnds, constraints=cons)
x = solution.x
# print('目标值: ' + str(self.objective(x)))
# print('答案为')
# for i in range(len(x)):
# x[i]=round(x[i],3)
# for i in range(len(self.user)):
# print('x' + str(i) + '=' + str(x[2 * i]))
# print('y' + str(i) + '=' + str(x[2 * i + 1]))
return x,self.objective(x)
# user=copy.deepcopy(User)
# Region=[[0, 2, 6, 1.0, 1.0], [0, 1, 10, 3.0, 1.0], [0, 1, 3, 1.0, 3.0], [0, 2, 9, 3.0, 3.0]]
# ulp1=ulpkm(user=user,region=Region,pB=1,k=2,B=5,cell=4,celllength=2)
# x,y=ulp1.run()
# print(x)
# print(y)
# Region=[[0, 0, 0, 1.5, 1.5], [0, 0, 0, 4.5, 1.5], [0, 0, 0, 7.5, 1.5], [0, 0, 1, 10.5, 1.5], [0, 1, 0, 1.5, 4.5], [0, 0, 1, 4.5, 4.5], [0, 0, 1, 7.5, 4.5], [0, 0, 0, 10.5, 4.5], [0, 0, 0, 1.5, 7.5], [0, 1, 1, 4.5, 7.5], [0, 0, 0, 7.5, 7.5], [0, 0, 2, 10.5, 7.5], [0, 0, 0, 1.5, 10.5], [0, 1, 1, 4.5, 10.5], [0, 0, 1, 7.5, 10.5], [0, 0, 2, 10.5, 10.5]]
# Region=[[0, 0, 0, 1.5, 1.5], [0, 0, 1, 4.5, 1.5], [0, 0, 0, 7.5, 1.5], [0, 0, 0, 10.5, 1.5], [0, 0, 1, 1.5, 4.5], [0, 0, 0, 4.5, 4.5], [0, 0, 0, 7.5, 4.5], [0, 0, 1, 10.5, 4.5], [0, 0, 0, 1.5, 7.5], [0, 0, 1, 4.5, 7.5], [0, 0, 2, 7.5, 7.5], [0, 0, 1, 10.5, 7.5], [0, 0, 3, 1.5, 10.5], [0, 0, 1, 4.5, 10.5], [0, 0, 0, 7.5, 10.5], [0, 0, 1, 10.5, 10.5]]
# Region=[[0, 0, 0, 1.5, 1.5], [0, 0, 0, 4.5, 1.5], [0, 0, 1, 1.5, 4.5], [0, 0, 1, 4.5, 4.5]]
# user=[[1,4,6,6,3.208,-1,-1],[2,0,3,6,1.88,-1,-1]]
# # user=[[6, 8, 5, 10, 2.2441861840702186, -1, -1], [12, 8, 3, 1, 3.0469537822133437, -1, -1], [1, 2, 2, 2, 3.826148690733884, -1, -1], [3, 4, 12, 5, 2.5208770865554477, -1, -1], [4, 5, 5, 5, 0.4784342320494666, -1, -1], [3, 9, 12, 11, 3.7265134398112427, -1, -1], [2, 9, 8, 12, 0.437954991661377, -1, -1], [0, 6, 1, 6, 3.637907100939602, -1, -1], [12, 2, 2, 5, 0.48169532108143925, -1, -1], [9, 12, 6, 1, 2.3972824075158976, -1, -1], [3, 9, 1, 4, 1.532545576551751, -1, -1], [4, 9, 8, 1, 1.9226308879732301, -1, -1]]
# # # user=[[2, 2, 12, 2, 4.136562658805103, -1, -1], [5, 4, 1, 11, 2.1603046544320463, -1, -1], [11, 0, 12, 5, 3.448325332946857, -1, -1], [9, 12, 10, 8, 3.5310177934362983, -1, -1], [8, 2, 0, 11, 3.6208157554616824, -1, -1], [3, 4, 12, 1, 2.86471847777233, -1, -1], [7, 12, 6, 8, 1.050923237754301, -1, -1], [5, 2, 4, 7, 0.10251571186543765, -1, -1], [10, 6, 9, 0, 0.2617508493747883, -1, -1]]
# ulp1=ulpkm(user=user,region=Region,pB=1,k=100,B=500000,cell=2,celllength=3)
# ulp1.run()