1
00:00:03,060 --> 00:00:06,910
Hello, bonjour, sup braddah, kia ora,

2
00:00:06,910 --> 00:00:10,910
Welcome to the 9th and final homework session

3
00:00:10,910 --> 00:00:14,910
of Statistical Mechanics: Algorithms and Computations

4
00:00:14,910 --> 00:00:17,860
from the Physics Department of Ecole Normale Supérieure.

5
00:00:17,860 --> 00:00:21,520
In this week's homework, you will apply by yourself

6
00:00:21,520 --> 00:00:25,520
the method of simulated annealing in two different problems.

7
00:00:27,260 --> 00:00:30,230
In the first part, you will study the problem of

8
00:00:30,230 --> 00:00:34,230
14 up to 50 disks

9
00:00:34,230 --> 00:00:37,400
on the surface of the unit sphere.

10
00:00:37,400 --> 00:00:41,400
The algorithm you will consider will allow you

11
00:00:41,400 --> 00:00:43,330
yo obtain in a few seconds

12
00:00:43,330 --> 00:00:47,330
better results than those obtained by sophisticated methods

13
00:00:47,330 --> 00:00:50,930
that were developed during years and even decades.

14
00:00:53,750 --> 00:00:57,250
In the second part, you will then study one of the classic

15
00:00:57,250 --> 00:01:00,660
and most important problems of combinatorial optimization:

16
00:01:00,660 --> 00:01:02,830
the travelling salesman.

17
00:01:02,830 --> 00:01:06,830
It has many important applications in computer science.

18
00:01:06,830 --> 00:01:11,900
You will see how simulated annealing - a method from statistical mechanics - 

19
00:01:11,900 --> 00:01:15,900
gives not optimal yet very good results.

20
00:01:15,900 --> 00:01:19,900
So have fun with the final homework session for this course.