Computational Complexity of Air Travel Planning Carl de Marcken ITA Software
[email protected] This document is an annotated set of slides on the computational complexity of air travel planning. The goal is to give somebody with an undergraduate level computer science background enough information to understand why air travel planning is an interesting and especially difficult problem. It provides a basic introduction to the air travel planning problem and then presents a variety of original computational complexity results as well as some related demos. The complexity slides assume a basic familiarity with formal languages, computational complexity and computability, but the introduction to the problem should be accessible without this. ITA Software produces search and optimization software for the travel industry. Our search engines power popular web sites such as Orbitz and Cheap Tickets; airline web sites such as America West, Continental Airlines and Alaska Airlines; computer reservation systems (CRS/GDSes) used by travel agencies, such as Galileo; and various travel agencies. ITA was founded by MIT computer scientists and is located adjacent to MIT in Cambridge, MA. Copyright 2003 ITA Software Notes for MIT course 6.034, Fall, 2003 1 Air Travel Planning QUERY SFOÆBOS April 2 BOSÆSFO April 5 Airline Agent Travel Agent Search Engine Travel Website Airline Website RESULT SFO AA123 BOS BOS AA191 DFW AA15 SFO $634 Flights Prices Seat availability Suppose a traveler is planning a round trip from San Francisco to Boston and back. Most likely they’ll contact an airline reservation agent or a travel agent, or perhaps visit an airline's website or a general travel website like Orbitz, providing a query made up of airport and travel time requirements.