1
00:00:00,360 --> 00:00:07,950
Hello and welcome to this lecture, where I'm going to present this second case study of the class,

2
00:00:08,340 --> 00:00:12,750
which is related to flight schedule optimization.

3
00:00:13,290 --> 00:00:23,850
Let's take a look at this map of some cities in Europe, and there are six people one in Lisbon, one

4
00:00:23,850 --> 00:00:34,830
in Madrid, one in Paris, one in Brussels, one in London and the last one in Dublin.

5
00:00:35,400 --> 00:00:42,860
Suppose they are from the same family and they need to meet in Rome here.

6
00:00:43,320 --> 00:00:53,550
Each of them will take a flight from their city to Rome as they need to make some kind of business together.

7
00:00:53,970 --> 00:01:04,620
For example, we have the first flight from Madrid, from Paris to Rome, from Brussels to Rome, from

8
00:01:04,620 --> 00:01:14,580
London to Rome, and finally from Dublin from when they all arrive at the Rome airport.

9
00:01:15,120 --> 00:01:22,170
They will rent a van and go together to the city centre to do the business.

10
00:01:22,470 --> 00:01:25,050
For example, sign a contract.

11
00:01:25,380 --> 00:01:34,590
It is important to emphasize that they will leave the airports to gather to share the van after they

12
00:01:34,590 --> 00:01:37,380
sit, do the business in the city centre.

13
00:01:37,860 --> 00:01:47,130
They will use this same van and return should the airports should take order flight should there see

14
00:01:47,130 --> 00:01:47,460
this?

15
00:01:47,790 --> 00:01:58,890
As you can see here, from Rome to Lisbon, from Rome to Madrid, from Rome, you berries, from Rome

16
00:01:59,400 --> 00:02:10,260
to Brussels to London, and finally from Rome to Dublin again, they needs to go to the airport together,

17
00:02:10,260 --> 00:02:14,130
sharing the van based on this information.

18
00:02:14,430 --> 00:02:25,530
The goal of this case study is to minimize the cost of the airline tickets, so we will try to find

19
00:02:25,650 --> 00:02:30,450
the best sets off flights to reduce the prices.

20
00:02:30,750 --> 00:02:37,440
In other words, we need to select the cheapest flights in the next lecture.

21
00:02:37,620 --> 00:02:41,880
We are going to start the implementation it buys them first.

22
00:02:41,910 --> 00:02:51,270
You will learn how to present the problem and then we will solve it using deep and Melrose libraries.

23
00:02:51,630 --> 00:02:52,320
See you there!