-
Notifications
You must be signed in to change notification settings - Fork 0
/
simulated_annealing.py
69 lines (54 loc) · 1.88 KB
/
simulated_annealing.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
# -*- coding: utf-8 -*-
"""Simulated_Annealing.ipynb
Automatically generated by Colaboratory.
Original file is located at
https://colab.research.google.com/drive/1o9jM3wgIoC7RqFyHYWxT-bqvNvFo1y9z
"""
import math
import random
def init():
a = [2, 1, 5, 0, 8, 4, 10, 0, 20, 10]
return a
def calc_cost(state):
cost = 0
for i in range(len(state)):
for j in range(i, len(state) - 1):
if state[i] > state[j + 1]:
cost = cost + 1
return cost
def State_generation2(current_state, current_state_cost):
for i in range(len(current_state)):
for j in range(i + 1, len(current_state)):
current_state[i], current_state[j] = current_state[j], current_state[i]
latest_cost = calc_cost(current_state)
if latest_cost > current_state_cost:
return State_generation2(current_state, latest_cost)
elif latest_cost == current_state_cost:
DE = -1
ePowDE = math.exp(DE)
random_number_generate = random.uniform(0, 1)
if random_number_generate <= ePowDE:
return State_generation2(current_state, latest_cost)
elif latest_cost < current_state_cost:
DE = latest_cost - current_state_cost
ePowDE = math.exp(DE)
random_number_generate = random.uniform(0, 1)
if random_number_generate <= ePowDE:
return State_generation2(current_state, latest_cost)
return current_state, None
def goal_test(state):
if calc_cost(state) == 0:
return True
else:
return False
def main():
state = init()
cost = calc_cost(state)
while goal_test(state) != 1:
state, cost = State_generation2(state, cost)
if cost is None:
print(state)
return
print(state)
return
main()