Hello and welcome to this lecture, where I'm going to present this second case study of the class,
which is related to flight schedule optimization.
Let's take a look at this map of some cities in Europe, and there are six people one in Lisbon, one
in Madrid, one in Paris, one in Brussels, one in London and the last one in Dublin.
Suppose they are from the same family and they need to meet in Rome here.
Each of them will take a flight from their city to Rome as they need to make some kind of business together.
For example, we have the first flight from Madrid, from Paris to Rome, from Brussels to Rome, from
London to Rome, and finally from Dublin from when they all arrive at the Rome airport.
They will rent a van and go together to the city centre to do the business.
For example, sign a contract.
It is important to emphasize that they will leave the airports to gather to share the van after they
sit, do the business in the city centre.
They will use this same van and return should the airports should take order flight should there see
this?
As you can see here, from Rome to Lisbon, from Rome to Madrid, from Rome, you berries, from Rome
to Brussels to London, and finally from Rome to Dublin again, they needs to go to the airport together,
sharing the van based on this information.
The goal of this case study is to minimize the cost of the airline tickets, so we will try to find
the best sets off flights to reduce the prices.
In other words, we need to select the cheapest flights in the next lecture.
We are going to start the implementation it buys them first.
You will learn how to present the problem and then we will solve it using deep and Melrose libraries.
See you there!