-
Notifications
You must be signed in to change notification settings - Fork 11
/
cps2.py
297 lines (246 loc) · 11.2 KB
/
cps2.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
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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
import numpy as np
import pandas as pd
import random as rd
pd.set_option('display.expand_frame_repr', False) # DataFrame 출력시 짤림 해결
pd.set_option('display.max_rows', 400)
pd.set_option('display.max_columns', 200)
pd.set_option('display.width', 1000)
class Machine :
# ['Set', job, operation, machine, processingTime, start]
def __init__(self, setup, number):
print('...'+str(number)+'번 Machine를 초기화중입니다...')
self.isIdle = True
self.setup = setup
self.number = number
self.machine_time = 0
self.recentSetup = 0
self.queue = [] # 아직 못들어간 대기 엔티티들
self.system = [] # 기계 안에서 직접 할당중인 엔티티
def allocation(self, info):
self.system.append(info)
self.isIdle = False
self.recentSetup = int(info[0])
return info
def deallocation(self):
self.system.pop()
self.isIdle = True
class Simulator :
def __init__(self, environment, setup, number_of_jobs, operations_per_jobs, number_of_machines):
print('...Simulator를 초기화중입니다...')
self.environment = environment
self.number_of_jobs = number_of_jobs
self.operations_per_jobs = operations_per_jobs
self.number_of_machines = number_of_machines
self.setup = setup
self.machineInit()
self.eventlist = []
self.TNOW = 0
self.index = 0
self.completer = []
print('Simulating 준비가 모두 끝났습니다.')
def initialize(self):
self.eventlist = []
self.TNOW = 0
self.index = 0
self.completer = []
self.machineInit()
def machineInit(self):
self.machineList = []
self.machine_assign = []
self.machine_per_index = []
for i in range(1, self. number_of_machines+1) :
self.machineList.append(Machine(self.setup[i-1], i))
self.machine_assign.append([])
self.machine_per_index.append(0)
def sortEventlist(self):
self.eventlist = sorted(self.eventlist, key=lambda x : x[-1])
def feasibleChecker(self):
# TODO Fully Feasible 체커는 좀 나중에 구현하는 걸로... 방법은 J,O 떼와서 정렬인지 확인 + M할당 적합성 확인?
return True
def getDepartureInfo(self, JOM):
alloc_machine = self.machineList[int(JOM[2]) - 1]
job = int(JOM[0])
operation = int(JOM[1])
machine = int(JOM[2])
processingTime = self.environment[job-1][operation-1][machine-1]
if alloc_machine.recentSetup == 0 :
processingTime += self.setup[int(job)-1][int(job)-1] # 디폴트 셋업
elif alloc_machine.recentSetup != job or alloc_machine.recentSetup != int(job) :
processingTime += self.setup[int(job)-1][alloc_machine.recentSetup - 1]
finishTime = self.TNOW + processingTime
alloc_machine.allocation([job, operation, machine, processingTime, finishTime])
return ['Dep', job, operation, machine, processingTime, finishTime]
def output_per_index(self):
print(self.index, "번 째 Event list :", self.eventlist, 'TNOW : ', self.TNOW)
def machine_assigner(self):
for i in self.solution :
self.machine_assign[int(i[2])-1].append(i)
def finder(self, JO):
finder = None
for i in range(self.number_of_machines) :
try :
if JO == str(int(self.machine_assign[i][self.machine_per_index[i]][0:2])-1) and self.machineList[i].isIdle == True :
finder = self.machine_assign[i][self.machine_per_index[i]]
except :
pass
return finder
def simulate(self, solution):
self.initialize()
self.solution = solution
if self.feasibleChecker() == False : # 모든 해가 유효하게 가정 및 유도
print("해가 유효하지 않습니다.")
return
print(solution)
self.machine_assigner() # Machine assign 산출
print(self.machine_assign)
# initialer = 0
for i in range(self.number_of_machines) :
if self.machine_assign[i][0][1] == '1' :
todo = self.machine_assign[i][0]
self.eventlist.append(self.getDepartureInfo(todo))
# for i in range(initialer) :
# todo = self.machine_assign[i][0]
# self.eventlist.append(self.getDepartureInfo(todo))
# # self.machine_per_index[i] += 1
self.eventlist.append(['End', 9999, 9999, 9999, 9999, 9999])
self.sortEventlist()
self.output_per_index()
while self.eventlist[0][0] != 'End' :
self.index += 1 # 인덱스 +1
self.output_per_index()
self.TNOW = self.eventlist[0][-1]
currenter = self.machine_assign[int(self.eventlist[0][3]) - 1][self.machine_per_index[int(self.eventlist[0][3]) - 1]] # JOM
try :
nexter = self.machine_assign[int(self.eventlist[0][3])-1][self.machine_per_index[int(self.eventlist[0][3])-1]+1] # J'O'M'
except :
pass
self.machineList[int(self.eventlist[0][3])-1].deallocation()
self.completer.append(currenter[0:2]) # JO
self.eventlist.pop(0)
print(currenter, '를 해치웠다!', self.TNOW)
if self.machine_per_index[int(currenter[2])-1] < len(self.machine_assign[int(currenter[2])-1]) :
self.machine_per_index[int(currenter[2])-1] +=1
print("case0")
# JOM 다음이 JO+1M일경우 바로 할당
if currenter == str(int(nexter)-10) :
todo = nexter
self.eventlist.append(self.getDepartureInfo(todo))
# self.machine_per_index[int(currenter[2])-1] += 1
self.sortEventlist()
print("case1-1")
# JOM 다음이 J'O'M인데, J', O'-1이 끝난 상황이면 바로 할당
elif (str(int(nexter[0:2])-1) in self.completer or nexter[1] == '1') and currenter[-1] == nexter[-1] and currenter != nexter :
todo = nexter
self.eventlist.append(self.getDepartureInfo(todo))
# self.machine_per_index[int(currenter[-1])-1] += 1
self.sortEventlist()
print("case2-1")
finder = self.finder(currenter[0:2])
if finder != None :
todo = finder
self.eventlist.append(self.getDepartureInfo(todo))
# self.machine_per_index[int(todo[-1])-1] += 1
self.sortEventlist()
print("case3-1")
return self.TNOW
class CuckooSearch :
def __init__(self, popSize, maxIter, number_of_jobs, operations_per_jobs, number_of_machines, target_env, method):
self.number_of_jobs = number_of_jobs
self.operation_per_jobs = operations_per_jobs
self.number_of_machines = number_of_machines
self.target_env = target_env
self.popSize = popSize
self.maxIter = maxIter
self.pa = 0.25
self.selPres = 0.5
self.iteration = 0
self.population = []
self.method = method
def initialize(self):
solution = []
env = []
for i in range(1, self.number_of_jobs+1) :
jobNum = i
temp = []
for j in range(1, self.operation_per_jobs+1) :
temp.append(str(jobNum)+str(j))
env.append(temp)
while 1 :
if env == [[], [], [], []] :
break
rand1 = rd.randint(0, self.number_of_jobs-1)
try :
solution.append(env[rand1].pop(0))
except :
pass
solution_result = []
for i in solution :
machine = 0
job = i[0]
operation = i[1]
machine_pool = self.target_env[int(job)-1][int(operation)-1]
while 1:
rand2 = rd.randint(1, len(machine_pool))
if np.isnan(self.target_env[int(job)-1][int(operation)-1][rand2-1]) :
pass
else :
machine = rand2
break
solution_result.append(i+str(machine))
return solution_result
def get_fitness(self, solution):
return self.method.simulate(solution)
def sorting(self):
self.population = sorted(self.population, key=lambda x : x[-1])
def search(self):
# initialize
for i in range(self.popSize) :
temp = []
temp.append(self.initialize())
temp.append(self.get_fitness(temp[0]))
self.population.append(temp)
self.sorting()
print(self.population)
# todo levystep, smallstep, largestep
if __name__ == "__main__" :
target_env = [
[[20, 15, 18, 17], [7, np.nan, 8, np.nan], [12, 10, np.nan, 15], [14, np.nan, 12, 12], [11, np.nan, 12, 12]],
[[np.nan, 23, np.nan, 32], [22, np.nan, 12, np.nan], [23, 19, np.nan, np.nan], [27, np.nan, np.nan, 25], [np.nan, 13, 16, np.nan]],
[[16, 5, 5, 4], [np.nan, 5, np.nan, 5], [12, 5, 5, 7], [np.nan, 5, np.nan, 5], [14, 5, 6, 7]],
[[12, np.nan, 14 ,np.nan], [17, np.nan, 18, np.nan], [np.nan, 20, np.nan, 21], [22, np.nan ,np.nan, 23], [np.nan, 12, 26, np.nan]],
]
setup_time = [[5, 4, 2, 4],
[2, 5, 2, 3],
[1, 5, 5, 1],
[4, 4, 4, 5]]
number_of_jobs = 4
operations_per_jobs = 5
number_of_machines = 4
solution = ['111', '212', '314', '413', '121',
'223', '322', '423', '131', '232',
'333', '434', '143', '241', '342',
'444', '154', '253', '352', '452']
minju_solution = ['314', '212', '411', '113', '324',
'223', '121', '423', '333', '232',
'131', '434', '143', '244', '441',
'342', '352', '452', '253', '151']
minju_solution2 = ['212', '114', '313', '411', '223',
'421', '121', '322', '132', '232',
'434', '333', '444', '342', '241',
'143', '153', '252', '353', '453']
hard = ['411', '313', '113', '423', '121', '212', '221', '232', '324', '333', '241', '342', '351', '432', '131', '141', '441', '452', '253', '151']
simul = Simulator(environment=target_env,
setup=setup_time,
number_of_jobs=number_of_jobs,
operations_per_jobs=operations_per_jobs,
number_of_machines=number_of_machines)
result = simul.simulate(solution=minju_solution2)
print(result)
cs = CuckooSearch(popSize=20,
maxIter=100,
number_of_jobs=number_of_jobs,
operations_per_jobs = operations_per_jobs,
number_of_machines = number_of_machines,
target_env=target_env,
method=simul)
# cs.search()