Integrated aircraft and passenger recovery with cruise time controllability

2016-01-01
Arikan, Ugur
Gürel, Sinan
Akturk, M. Selim
Disruptions in airline operations can result in infeasibilities in aircraft and passenger schedules. Airlines typically recover aircraft schedules and disruptions in passenger itineraries sequentially. However, passengers are severely affected by disruptions and recovery decisions. In this paper, we present a mathematical formulation for the integrated aircraft and passenger recovery problem that considers aircraft and passenger related costs simultaneously. Using the superimposition of aircraft and passenger itinerary networks, passengers are explicitly modeled in order to use realistic passenger related costs. In addition to the common routing recovery actions, we integrate several passenger recovery actions and cruise speed control in our solution approach. Cruise speed control is a very beneficial action for mitigating delays. On the other hand, it adds complexity to the problem due to the nonlinearity in fuel cost function. The problem is formulated as a mixed integer nonlinear programming (MINLP) model. We show that the problem can be reformulated as conic quadratic mixed integer programming (CQMIP) problem which can be solved with commercial optimization software such as IBM ILOG CPLEX. Our computational experiments have shown that we could handle several simultaneous disruptions optimally on a four-hub network of a major U.S. airline within less than a minute on the average. We conclude that proposed approach is able to find optimal tradeoff between operating and passenger-related costs in real time.
ANNALS OF OPERATIONS RESEARCH

Suggestions

Robust Airline Scheduling with Controllable Cruise Times and Chance Constraints
Duran, A. Serasu; Gürel, Sinan; Akturk, M. Selim (2015-01-02)
Robust airline schedules can be considered as flight schedules that are likely to minimize passenger delay. Airlines usually add an additional time-e.g., schedule padding-to scheduled gate-to-gate flight times to make their schedules less susceptible to variability and disruptions. There is a critical trade-off between any kind of buffer time and daily aircraft productivity. Aircraft speed control is a practical alternative to inserting idle times into schedules. In this study, block times are considered in...
Integrated aircraft-path assignment and robust schedule design with cruise speed control
Safak, Ozge; Gürel, Sinan; Akturk, M. Selim (2017-08-01)
Assignment of aircraft types, each having different seat capacity, operational expenses and availabilities, critically affects airlines' overall cost. In this paper, we assign fleet types to paths by considering not only flight timing and passenger demand, as commonly done in the literature, but also operational expenses, such as fuel burn and carbon emission costs associated with adjusting the cruise speed to ensure the passenger connections. In response to flight time uncertainty due to the airport conges...
Modeling demand management strategies for evacuations
Tüydeş Yaman, Hediye (Springer Science and Business Media LLC, 2014-06-01)
Evacuations are massive operations that create heavy travel demand on road networks some of which are experiencing major congestions even with regular traffic demand. Congestion in traffic networks during evacuations, can be eased either by supply or demand management actions. This study focuses on modeling demand management strategies of optimal departure time, optimal destination choice and optimal zone evacuation scheduling (also known as staggered evacuation) under a given fixed evacuation time assumpti...
The planar hub location problem: a probabilistic clustering approach
İyigün, Cem (Springer Science and Business Media LLC, 2013-12-01)
Given the demand between each origin-destination pair on a network, the planar hub location problem is to locate the multiple hubs anywhere on the plane and to assign the traffic to them so as to minimize the total travelling cost. The trips between any two points can be nonstop (no hubs used) or started by visiting any of the hubs. The travel cost between hubs is discounted with a factor. It is assumed that each point can be served by multiple hubs.
An Interactive Algorithm for Multi-objective Route Planning
Tezcaner, Diclehan; Köksalan, Mustafa Murat (Springer Science and Business Media LLC, 2011-08-01)
We address the route selection problem for Unmanned Air Vehicles (UAV) under multiple objectives. We consider a general case for this problem, where the UAV has to visit several targets and return to the base. We model this problem as a combination of two combinatorial problems. First, the path to be followed between each pair of targets should be determined. We model this as a multi-objective shortest path problem. Additionally, we need to determine the order of the targets to be visited. We model this as ...
Citation Formats
U. Arikan, S. Gürel, and M. S. Akturk, “Integrated aircraft and passenger recovery with cruise time controllability,” ANNALS OF OPERATIONS RESEARCH, pp. 295–317, 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/37697.