Abstract
A model developed to support route planning at a large North American airline is presented. The problem of assigning spoke cities to particular complex times at airport hubs is described as well as an integer programming formulation for solution of the problem. This solution formulation as well as some system implementation issues are discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kennington, J. L. and R. V. Helgason (1980), Algorithms for Network Programming, John Wiley and Sons, New York, New York.
Rabbani, N.M. and B.W. Patty, “Aircraft Routing at American Airline”, Proceedings of the 32nd AGIFORS Annual Symposium, Budapest, Hungary, October 1992.
Anbil, R., Gelman, E., Patty, B., and R. Tanga (1991), “Recent Advances in Crew-Pairing Optimization at American Airlines”, Interfaces, 21, 1.
Abara, J. (1989), “Applying Integer Linear Programming to the Fleet Assignment Problem”, Interfaces, 19, 4.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Patty, B.W., Diamond, J. (1998). The Complex Configuration Model. In: Yu, G. (eds) Operations Research in the Airline Industry. International Series in Operations Research & Management Science, vol 9. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5501-8_12
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5501-8_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7513-5
Online ISBN: 978-1-4615-5501-8
eBook Packages: Springer Book Archive