-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLocalSearch.py
More file actions
166 lines (133 loc) · 6.49 KB
/
Copy pathLocalSearch.py
File metadata and controls
166 lines (133 loc) · 6.49 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
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
from Instance import Instance
from Solution import Solution
class LocalSearch:
def __init__(self, inst: Instance):
self.inst = inst
def insertion(self, solu: Solution):
while True:
best_delta = 0
best_mov = []
for i in range(self.inst.get_m()):
if solu.get_c(i) < solu.get_makespan():
continue
mi = self.inst.get_n()+i
jobi = solu.get_suc(mi)
while jobi != mi:
deltai = self.inst.get_s(
solu.get_pre(jobi), solu.get_suc(jobi))
deltai -= self.inst.get_s(solu.get_pre(jobi), jobi)
deltai -= self.inst.get_s(jobi, solu.get_suc(jobi))
if solu.get_c(i) + deltai > solu.get_makespan():
jobi = solu.get_suc(jobi)
continue
for j in range(self.inst.get_m()):
mj = self.inst.get_n()+j
if j == i or solu.get_suc(mj) == mj:
continue
jobj = mj
while True:
deltaj = -self.inst.get_s(jobj, solu.get_suc(jobj))
deltaj += self.inst.get_s(jobi, solu.get_suc(jobj))
deltaj += self.inst.get_s(jobj, jobi)
if solu.get_c(j) + deltaj > solu.get_makespan():
jobj = solu.get_suc(jobj)
if jobj == mj:
break
continue
if deltai + deltaj < best_delta:
best_delta = deltai + deltaj
best_mov = [i, jobi, j, jobj]
jobj = solu.get_suc(jobj)
if jobj == mj:
break
jobi = solu.get_suc(jobi)
if best_delta == 0:
break
solu.ejeta_job(best_mov[0], best_mov[1])
solu.insert_job(best_mov[2], best_mov[1], best_mov[3])
def swap(self, solu: Solution):
while True:
best_delta = 0
best_mov = []
for i in range(self.inst.get_m()):
if solu.get_c(i) < solu.get_makespan():
continue
mi = self.inst.get_n()+i
jobi = solu.get_suc(mi)
while jobi != mi:
for j in range(i+1, self.inst.get_m()):
mj = self.inst.get_n()+j
jobj = solu.get_suc(mj)
while jobj != mj:
deltaj = -self.inst.get_s(solu.get_pre(jobj), jobj)
deltaj -= self.inst.get_s(jobj, solu.get_suc(jobj))
deltaj += self.inst.get_s(solu.get_pre(jobj), jobi)
deltaj += self.inst.get_s(jobi, solu.get_suc(jobj))
deltai = -self.inst.get_s(solu.get_pre(jobi), jobi)
deltai -= self.inst.get_s(jobi, solu.get_suc(jobi))
deltai += self.inst.get_s(solu.get_pre(jobi), jobj)
deltai += self.inst.get_s(jobj, solu.get_suc(jobi))
if solu.get_c(j) + deltaj > solu.get_makespan() or \
solu.get_c(i) + deltai > solu.get_makespan():
jobj = solu.get_suc(jobj)
if jobj == mj:
break
continue
if solu.get_c(j) + deltaj < solu.get_makespan() or \
solu.get_c(i) + deltai < solu.get_makespan():
if deltai + deltaj <= best_delta:
best_delta = deltai + deltaj
best_mov = [i, jobi, j, jobj]
jobj = solu.get_suc(jobj)
jobi = solu.get_suc(jobi)
if best_delta == 0:
break
prei = solu.get_pre(best_mov[1])
prej = solu.get_pre(best_mov[3])
solu.ejeta_job(best_mov[0], best_mov[1])
solu.ejeta_job(best_mov[2], best_mov[3])
solu.insert_job(best_mov[0], best_mov[3], prei)
solu.insert_job(best_mov[2], best_mov[1], prej)
def gen_insert(self, solu: Solution, m: int) -> bool:
if solu.get_num_jobs_machine(m) < 3:
print("insercao generalizada nao pode ser aplicada, nr insuficientes de tarefas: 3")
return False
ok = False
while True:
job1 = self.inst.get_n() + m
job2 = solu.get_suc(job1)
job3 = solu.get_suc(job2)
best_delta = 0
best_move = []
for _ in range(solu.get_num_jobs_machine(m)-3):
for _ in range(1, solu.get_num_jobs_machine(m)-2):
for _ in range(2, solu.get_num_jobs_machine(m)-1):
delta = -self.inst.get_s(solu.get_pre(job1), job1)
delta -= self.inst.get_s(solu.get_pre(job2), job2)
delta -= self.inst.get_s(solu.get_pre(job3), job3)
delta += self.inst.get_s(solu.get_pre(job1), job2)
delta += self.inst.get_s(solu.get_pre(job2), job3)
delta += self.inst.get_s(solu.get_pre(job3), job1)
if delta < best_delta:
best_delta = delta
best_move = [job1, job2, job3]
job3 = solu.get_suc(job3)
job2 = solu.get_suc(job2)
job3 = solu.get_suc(job2)
job1 = solu.get_suc(job1)
job2 = solu.get_suc(job1)
job3 = solu.get_suc(job2)
if best_delta < 0:
pre1 = solu.get_pre(best_move[0])
pre2 = solu.get_pre(best_move[1])
pre3 = solu.get_pre(best_move[2])
solu.cut(best_move[0])
solu.cut(best_move[1])
solu.cut(best_move[2])
solu.patch(pre1, best_move[1])
solu.patch(pre2, best_move[2])
solu.patch(pre3, best_move[0])
ok = True
else:
break
return ok