Optimierung
Robust Tail AssignmentRobust Tail AssignmentNowadays, airlines use discrete optimization in many fields in order to plan and control resources like crews and aircraft. The biggest current problem is growing number of delays and delayed flights what significantly increases operational costs and harms goodwill of the airline. Therefore growing importance lies in robust optimization that can provide more stable solutions, with respect to delays, and therefore minimizes operational costs of airline. In our project, we focus on one part of the planning, namely on Tail assignment. |
|
Beschreibung
Aim of the robust optimization is to deal with problems with uncertainty in data. In our case with flight departures and arrivals influenced by delays. In case of discrete problem is it very difficult task, because small change in input data can cause big change in quality of the solution. For example, small delay on one flight can end up by later cancellation of flight or passangers can miss their connecting flight. Here play aircraft important role, because aircraft rotation is one of the major sources causing delays.
Tail assignment problem is the problem of assigning flights to individual aircraft in order to satisfy number of constraints like airport curfews, minimal connection times between flights and maintenance constraints.
Our goal is to develop more robust aircraft rotations by solving set partitioning model by column generation algorithm.
|
|