Airlines Management Sysytem
Airlines Management Sysytem
(Batch - F8)
We would like to extend our deepest gratitude to Dr. Minal Tandekar, whose insightful
guidance, expertise, and continuous encouragement have been instrumental in the successful
completion of this project. Her dedication to helping us understand the core principles of
Algorithms and Problem Solving and her constructive feedback throughout the course of the
project have greatly contributed to our learning experience. We are immensely grateful to all
the team members involved in this project: Arman Gupta, Tanya Chauhan, Divyansh Singh,
Saumya Agarwal. Each member played an integral role in gathering data, conducting
analysis, and collaborating to ensure the successful completion of the project. Their
teamwork, dedication, and active participation were key to producing quality work.
We would also like to express our appreciation to the Jaypee Institute of Information
for providing us with the platform and resources to explore the subject of Algorithms and
Problem Solving. The institution has enabled us to apply theoretical knowledge to practical
settings, helping us gain valuable insights into responsible career choices and its
implications.
Lastly, we acknowledge the support and cooperation of the various individuals and our
Key Features:
● Route Optimization: Implement an algorithm to identify the most
cost-effective flight routes between airports by evaluating available flight
options and their respective costs.
● Flight Scheduling: Provide tools for scheduling flights between different
airports, taking into account departure and arrival times, operational
constraints, and associated expenses.
● Price Prediction: Apply predictive modeling techniques using historical
flight data to estimate ticket prices for new flights, enabling airlines to
remain competitive in pricing strategies.
● Passenger Seat Allocation: Ensure optimal seat assignment by allocating
seats to passengers on a first-come, first-served basis, maximizing the use
of available flight capacity.
● Feedback Analysis: Leverage natural language processing (NLP)
methods to interpret and analyze passenger feedback, offering valuable
insights into customer satisfaction and highlighting areas that need
improvement.
OBJECTIVE
Features:
● Automate flight booking, cancellation, and management.
● Enable passengers to search for both shortest and cheapest routes.
● Implement efficient crew assignment using greedy and backtracking
algorithms.
● Employ tree traversal techniques for data management and search.
● Provide comprehensive reporting for administrators.
PROPOSED SOLUTION
● It is used to find the shortest path from a source node (airport) to all other
nodes (airports) in the graph (flight network).
● It's chosen because it efficiently finds the optimal route between two
airports based on the distance.
● The algorithm ensures that passengers can reach their destination faster.
● It is used to find the route with the minimum total cost, not necessarily
the shortest in time.
● Similar to Dijkstra, but edge weights represent prices instead of durations.
● If there are constraints (like maximum stops), Bellman-Ford or BFS with
cost tracking is used.
● The algorithm explores all possible routes, updating the minimum cost
for each node.
3. Greedy Algorithm for Crew Vacancy :
Fig 1.1 Comprehensive Admin Panel Showcasing ASCII Art and Real-Time Output of
the AddFlight Method Execution
Fig 1.2 Admin Panel Interface with Structured and Dynamic Flight Listing Display
Fig 1.3 Output demonstrating crew assignment using assignCrewtoFlight(),
assignCrewToAllFlights(), and iscrewAvailable(); applies greedy algorithms to minimize
required crew for overlapping flights and backtracking to avoid scheduling conflicts
Fig 1.4 New Crew Recruitment using addcrew() method to fulfill the min
requirement calculated using greedy Algorithm
Fig 1.5 Crew Duties listing
Fig 1.6Passenger panel output demonstrating shortest and cheapest flight route searches
using Dijkstra’s algorithm on the AirportGraph. The system efficiently finds the
shortest route by time (SLN → KSP → DEL in 140 mins) and the cheapest route by cost
(SLN → DEL for 4000 INR), providing passengers with optimal travel options based on
their preferences.
CONCLUSION