Transportation Science
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


TRANSPORTATION SCIENCE
Vol. 37, No. 4, November 2003, pp. 392-407
DOI: 10.1287/trsc.37.4.392.23281
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Thengvall, B. G.
Right arrow Articles by Yu, G.
Right arrow Search for Related Content

A Bundle Algorithm Approach for the Aircraft Schedule Recovery Problem During Hub Closures

Benjamin G. Thengvall, Jonathan F. Bard, Gang Yu

Graduate Program in Operations Research, Department of Mechanical Engineering, University of Texas, Austin, Texas 78712-1063
Graduate Program in Operations Research, Department of Mechanical Engineering, University of Texas, Austin, Texas 78712-1063
Department of Management Science and Information Systems, Graduate School of Business, University of Texas, Austin, Texas 78712-1175

ben{at}calebtech.com
jbard{at}mail.utexas.edu
yu{at}uts.cc.utexas.edu

A bundle algorithm is presented to solve a multicommodity network model for determining a recoveryplanfor a single carrier with multiple fleets following a hub closure. The algorithm is shown to provide feasible near–optimal solutions much more quickly than can be obtained using a standard commercial mixed–integer programming code (CPLEX). In this application, a bundle method is used to solve a Lagrangian relaxation of the integer programming formulation. The full algorithm includes heuristic techniques for finding feasible solutions from the solutions to the relaxed problems. Extensive computations were performed using data from Continental Airlines. The results show that the proposed approach provides faster times to optimality in some cases and always obtains feasible, near–optimal solutions for larger problems much more quickly than can be found using CPLEX. In addition, while a standard commercial code will provide only one solution, this approach provides multiple high–quality solutions.

History: Received: May 1999; revised: May 2001; accepted: February 2002.




This article has been cited by other articles:


Home page
Transportation ScienceHome page
B. C. Smith and E. L. Johnson
Robust Airline Fleet Assignment: Imposing Station Purity Using Station Decomposition
Transportation Science, November 1, 2006; 40(4): 497 - 516.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2003 by INFORMS.