• A
• A
• A
• ABC
• ABC
• ABC
• А
• А
• А
• А
• А
Regular version of the site

# Algorithms for Airline Crew Scheduling Problem

Student: Tatiana Nasedkina

Supervisor:

Educational Programme: Data Mining (Master)

Next to fuel costs, crew costs are the largest direct operating cost of airlines. The goal of airlines is to find the best schedule for the crews. In this paper we present a Branch and Price algorithm for solving crew scheduling problem as deterministic and do not explicitly include information on potential disruptions. The method consists of the following stages: the formulation of the master and slave problems, their solution and implementation of the branch and bound method to get an integer solution for the initial problem. To formulate the master problem, a greedy algorithm was proposed to search for a subset of variables. The paper presents a heuristic algorithm for searching for the initial solution, which is then used to find the most violated constraint in the dual problem. The search for the integer solution of the original problem is performed using the branch and bound method in the Branch and Price method. Branching occurs in fractional variables with fixed values of integer variables.

Full text (added May 26, 2017)

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.