Taxi planning: Branch and price decomposition

Taxi planning problem studies aircraft routing and scheduling on the airport ground. Taxi planning has been formulated using a binary multicommodity flow model in a space-time airport network. The flow capacity constraints are used to represent the conflicts among aircraft, given an airport’s capacity. Branch and price methodology has been adapted to take advantage of the integer model structures. The computational tests have been run with real data from Adolfo Suárez Madrid-Barajas airport. The tests were oriented toward comparing the new adapted branch and price with the classic Branch and Bound algorithm, trying to obtain conclusions that are useful for airport managers.

Aircraft Routing and Scheduling: a Case Study in an Airline Company

A major problem faced by every airline is to construct a daily schedule for a heterogeneous aircraft fleet. In the present paper implementation of aircraft routing and scheduling for cargo transportation, known as one of the scheduling problem in transportation, in an air-line is presented. First, problems faced by the company are defined and then implementation steps and expected improvements that will result from carrying out the solution of mathematical model of the problem are given in detail. The purpose of this paper is to describe, analyze and evaluate a case study of how an aircraft scheduling was managed in an air-line.