Robust Airline Fleet Assignment: Imposing Station Purity Using Station Decomposition

Authors:
Barry C. Smith;Ellis L. Johnson
Affiliations:
Sabre Holdings, 3150 Sabre Drive, Southlake, Texas 76092;School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205
Venue:
Transportation Science
Year:
2006

Citing 15
Cited 0

Modelling and strong linear programs for mixed integer programming

Algorithms and model formulations in mathematical programming
Scenarios and policy aggregation in optimization under uncertainty

Mathematics of Operations Research
Demand driven dispatch: a method for dynamic aircraft capacity assignment, models, and algorithms

Operations Research
The fleet assignment problem: solving a large-scale integer program

Mathematical Programming: Series A and B
Stabilized column generation

Discrete Mathematics
Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching

Computational Optimization and Applications
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm

Operations Research
Itinerary-Based Airline Fleet Assignment

Transportation Science
Airline fleet assignment and schedule design: integrated models and algorithms

Airline fleet assignment and schedule design: integrated models and algorithms
A Bundle Algorithm Approach for the Aircraft Schedule Recovery Problem During Hub Closures

Transportation Science
A Robust Fleet-Assignment Model with Hub Isolation and Short Cycles

Transportation Science
A neighborhood search algorithm for the combined through and fleet assignment model with time windows

Networks
Computational results with a primal-dual subproblem simplex method

Operations Research Letters
A parallel primal-dual simplex algorithm

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The statement of the standard vehicle routing problem cannot always capture all aspects of real-world applications. As a result, extensions or modifications to the model are warranted. Here we consider the case when customers can call in orders ...