1
00:00:00,210 --> 00:00:07,830
Hello and welcome to the séquence and last section of the class on genetic algorithms in Python.

2
00:00:08,250 --> 00:00:14,610
In this lecture, I'm going to show you the plan of attack, as you can read right here.

3
00:00:14,970 --> 00:00:22,930
The goal of this section is to present to use some genetic algorithms libraries now that you know the

4
00:00:22,940 --> 00:00:29,910
intuition about this topic and have implemented your own algorithm from scratch.

5
00:00:30,240 --> 00:00:36,510
It's time to implement genetic algorithms using pre-built libraries.

6
00:00:36,810 --> 00:00:41,250
You will learn how to work with two important libraries.

7
00:00:41,910 --> 00:00:49,800
The first one is deep, which means distributed evolutionary algorithms by them.

8
00:00:50,130 --> 00:00:53,880
And the second one is M. L. Rose.

9
00:00:54,300 --> 00:01:03,450
We will also solve the same problem about the transportation of products where the goal is to maximize

10
00:01:03,450 --> 00:01:04,320
the profits.

11
00:01:04,890 --> 00:01:12,270
The interesting point is that you will be able to compare the results of the algorithm implemented from

12
00:01:12,270 --> 00:01:15,690
scratch with the results of the actual libraries.

13
00:01:15,990 --> 00:01:25,860
Additionally, we work with another case study that aims to minimize the value of airline tickets.

14
00:01:26,100 --> 00:01:34,140
Let's consider the example of France, who live in different places and they will meet in one city.

15
00:01:34,410 --> 00:01:40,830
So we need to choose the flights with the lowest price for each person.

16
00:01:41,250 --> 00:01:50,230
We will also implement this new case study using deep and rose libraries in the next lecture.

17
00:01:50,280 --> 00:01:52,380
We will start the implementations.

18
00:01:52,650 --> 00:01:53,370
See you there!