Searching For Relevant Features To Classify Crew Pairing Problems

University essay from Göteborgs universitet/Institutionen för data- och informationsteknik

Abstract: Machine learning (ML) is an emerging technology. Jeppesen, a leader of commercial optimization products in the airline industry, has started exploring ML methods to facilitate optimization algorithm development. This thesis investigates one of the company’s products, the crew pairing optimizer. The optimizer can use dierent algorithms to solve crew pairing problems, and the thesis looks into what features of a pairing problem inuence algorithm selection, i.e. the best choice of algorithm for a problem, based on the performance of dierent algorithms. With little prior knowledge about features of pairing problems and their relation with algorithm performance, using ML, the thesis rst generates over twenty features, and then uses dierent feature selection methods to nd the most informative feature subsets. Each feature subset is then fed into multiple classiers to test its robustness. Besides ML, the thesis also includes statistical analysis as a comparison. The thesis has some interesting ndings, including a subset of features that might inuence algorithm performance. However, none of the methods used can nd a feature subset to accurately classify the pairing problems by the best performing algorithm. The thesis discusses possible reasons for the results. It also lists what to consider before applying ML to real-world problems.

  AT THIS PAGE YOU CAN DOWNLOAD THE WHOLE ESSAY. (follow the link to the next page)