Minimum-Cost Flight Package Development Using Dijkstra's Shortest Path

Abstract

In order to save money and get more trips, many websites and companies give their customers a comparison between the flying companies to help them choose the cheapest trip. These kinds of services are limited because they give the customer a comparison between flying companies only but more tricks can help the customer save more money. One of these tricks is to travel to the destination from another country instead of traveling directly from the native country where the ticket can be more costly than what it can cost from another one. This article gives a new solution for saving money during traveling. The new solution consist of studying all the trips cost between all the airports in the world and all the flying companies, and with all these data, the system will choose the cheapest trips sequence between all these trips to get the customer to their destination from the original country. This project provides the customers the cheapest path a user can use in their trip using a traditional shortest path algorithm, Dijkstra's algorithm, to save money as much as they can. This article studies a problem case where a customer wants to travel from Beirut to New York City and the system will help decisionmakers in making the right decision that saves money on the trip.