Demand Driven Dispatch: A method for dynamic aircraft capacity assignment, models and algorithms

Demand Driven Dispatch: A method for dynamic aircraft capacity assignment, models and algorithms

0.00 Avg rating0 Votes
Article ID: iaor1994175
Country: United States
Volume: 41
Issue: 1
Start Page Number: 153
End Page Number: 168
Publication Date: Jan 1993
Journal: Operations Research
Authors: ,
Keywords: networks: flow, heuristics
Abstract:

A major problem for the airline industry is the assignment of airplane capacity to flight schedules to meet fluctuating market needs. Demand Driven Dispatch (D3) is an operating concept that addresses this problem. Utilizing a demand forecast which improves as flight departure approaches, aircraft are dynamically assigned to flights to better match the predicted final demands. The result, demonstrated in studies of actual airline systems, is an increase in passenger loads and revenues with simultaneously reduced costs for a net of 1-5% improvement in operating profits. Concept implementation is simplified by the prevalence of yield management systems which provide the forecasting capability, and the emergence of airplane families which provide the necessary operational flexibility. Implementation also requires frequent solution of extremely large aircraft assignment problems. These problems, which can be formulated in terms of a multicommodity network flow, can be solved with heuristic algorithms shown to exhibit an accuracy and efficiency essential to successful concept implementation.

Reviews

Required fields are marked *. Your email address will not be published.