This project will implement search algorithms for air travel planning. Given flight schedules, minimum connection times, fare rules (e.g. Saturday night stays, advanced booking), seat availability and user preferences, listing of feasible flights (sorted according to various criteria such as prices, number of connections, length of travel etc.) will be performed after the search. Air travel search involves difficult combinatorial optimization problems ;some problem formulations are NP-hard, some can be even undecidable. To speed-up solution finding parallel processing techniques will be made use of.
Funding Institution:
Turkish Airlines