FilesExpand file tree

master

/

SimulatedAnnealing.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

26 lines (24 loc) · 969 Bytes

master

/

SimulatedAnnealing.py

Copy path

Top

File metadata and controls

• Code
• Blame

26 lines (24 loc) · 969 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

import random

from math import exp

class SimulatedAnnealing():

def __init__(self, problem, *args, **kwargs):

self.problem = problem

def solve(self):

current_state = self.problem.initial_state()

count = 0

local_try = 1000

temperature = 10000

sch = 0.99

t_min = 1

while temperature > t_min:

print(current_state)

random_neighbour = random.choice(self.problem.neighbours(current_state))

efficiency = self.problem.heuristic(random_neighbour) - self.problem.heuristic(current_state)

#Replace new state if it is better than older one

if efficiency < 0:

current_state = random_neighbour

#Replace new state if the probability is good

elif exp((-(efficiency))/temperature) > random.random():

current_state = random_neighbour

temperature *= sch

print(current_state)