Per-Seat, On-Demand Air Transportation Part I: Problem Description and an Integer Multicommodity Flow Model

Authors:
D. Espinoza;R. Garcia;M. Goycoolea;G. L. Nemhauser;M. W. P. Savelsbergh
Affiliations:
School of Industrial Engineering, Universidad de Chile, Santiago, Chile;DayJet Corporation, Boca Raton, Florida 33431;School of Business, Universidad Adolfo Ibáòez, Santiago, Chile;H. Milton School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332;H. Milton School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
Venue:
Transportation Science
Year:
2008

Citing 0
Cited 5

Tactical and Operational Planning of Scheduled Maintenance for Per-Seat, On-Demand Air Transportation

Transportation Science
Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem

INFORMS Journal on Computing
A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times

Journal of Intelligent Manufacturing
A Reference Point Approach for the Resource Constrained Shortest Path Problems

Transportation Science
Mathematical Programming Guides Air-Ambulance Routing at Ornge

Interfaces

Quantified Score

Hi-index	0.00

Visualization

Abstract

The availability of relatively cheap small jet planes has led to the creation of on-demand air transportation services in which travelers call a few days in advance to schedule a flight. A successful on-demand air transportation service requires an effective scheduling system to construct minimum-cost pilot and jet itineraries for a set of accepted transportation requests. We present an integer multicommodity network flow model with side constraints for such dial-a-flight problems. We develop a variety of techniques to control the size of the network and to strengthen the quality of the linear programming relaxation, which allows the solution of small instances. In Part II, we describe how this core optimization technology is embedded in a parallel, large-neighborhood, local search scheme to produce high-quality solutions efficiently for large-scale real-life instances.