The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Flight String Models for Aircraft Fleeting and Routing
Abstract
Given a schedule of flight legs to be flown by an airline, the fleet assignment problem is to determine the minimum cost assignment of flights to aircraft types, called fleets, such that each scheduled flight is assigned to exactly one fleet, and the resulting assignment is feasible to fly given a limited number of aircraft in each fleet. Then the airline must determine a sequence of flights, or routes, to be flown by individual aircraft such that assigned flights are included in exactly one route, and all aircraft can be maintained as necessary. This is referred to as the aircraft routing problem. In this paper, we present a single model and solution approach to solve simultaneously the fleet assignment and aircraft routing problems. Our approach is robust in that it can capture costs associated with aircraft connections and complicating constraints such as maintenance requirements. By setting the number of fleets to one, our approach can be used to solve the aircraft routing problem alone. We show how to extend our model and solution approach to solve aircraft routing problems with additional constraints requiring equal aircraft utilization. With data provided by airlines, we provide computational results for the combined fleet assignment and aircraft routing problems without equal utilization requirements and for aircraft routing problems requiring equal aircraft utilization.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Time Constrained Routing and Scheduling
Desrosiers, J., Solomon, M. M., Soumis, F., & Dumas, Y. (1992) · PolyPublie (École Polytechnique de Montréal) · doi:10.1016/s0927-0507%2805%2980106-9 · Cited by 709
The fleet assignment problem: Solving a large-scale integer program
Hane, C. A., Barnhart, C., Johnson, E. L., Marsten, R. E., Nemhauser, G. L., & Sigismondi, G. (1995) · Mathematical Programming · doi:10.1007/bf01585938 · Cited by 418
Self-citationChapter 2 Time constrained routing and scheduling
Desrosiers, J., Dumas, Y., Solomon, M. M., & Soumis, F. (1995) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80106-9 · Cited by 374
Applying Integer Linear Programming to the Fleet Assignment Problem
Abara, J. (1989) · Interfaces · doi:10.1287/inte.19.4.20 · Cited by 276
Flight Scheduling and Maintenance Base Planning
Feo, T. A., & Bard, J. F. (1989) · Management Science · doi:10.1287/mnsc.35.12.1415 · Cited by 221
Clarke, L., Johnson, E., Nemhauser, G., & Zhu, Z. (1997) · Annals of Operations Research · doi:10.1023/a:1018945415148 · Cited by 212
Self-citationComputer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling
Feder, P. I. (1982) · Technometrics · doi:10.1080/00401706.1982.10487724 · Cited by 186
The Aircraft Maintenance Routing Problem
Gopalan, R., & Talluri, K. T. (1998) · Operations Research · doi:10.1287/opre.46.2.260 · Cited by 185
Maintenance and Crew Considerations in Fleet Assignment
Clarke, L. W., Hane, C. A., Johnson, E. L., & Nemhauser, G. L. (1996) · Transportation Science · doi:10.1287/trsc.30.3.249 · Cited by 168
Self-citationMINTO, a mixed INTeger optimizer
Nemhauser, G. L., Savelsbergh, M. W. P., & Sigismondi, G. C. (1994) · Operations Research Letters · doi:10.1016/0167-6377(94)90013-2 · Cited by 161
Self-citationThe Four-Day Aircraft Maintenance Routing Problem
Talluri, K. T. (1998) · Transportation Science · doi:10.1287/trsc.32.1.43 · Cited by 124
Swapping Applications in a Daily Airline Fleet Assignment
Talluri, K. T. (1996) · Transportation Science · doi:10.1287/trsc.30.3.237 · Cited by 104
A polyhedral approach to edge coloring
Nemhauser, G. L., & Park, S. (1991) · Operations Research Letters · doi:10.1016/0167-6377(91)90003-8 · Cited by 57
Self-citation
Cited by
Selected Topics in Column Generation
Lübbecke, M. E., & Desrosiers, J. (2005) · Operations Research · doi:10.1287/opre.1050.0234 · Cited by 1,102
Containership Routing and Scheduling in Liner Shipping: Overview and Future Research Directions
Meng, Q., Wang, S., Andersson, H., & Thun, K. (2014) · Transportation Science · doi:10.1287/trsc.2013.0461 · Cited by 455
Disruption management in the airline industry—Concepts, models and methods
Clausen, J., Larsen, A., Larsen, J., & Rezanova, N. J. (2010) · Computers & Operations Research · doi:10.1016/j.cor.2009.03.027 · Cited by 343
Lan, S., Clarke, J.-P., & Barnhart, C. (2006) · Transportation Science · doi:10.1287/trsc.1050.0134 · Cited by 314
Self-citationApplications of operations research in the air transport industry
Barnhart, C., Belobaba, P., & Odoni, A. R. (2003) · Transportation Science · doi:10.1287/trsc.37.4.368.23276 · Cited by 309
Self-citation
Metadata
- Authors
- Barnhart, C., Boland, N. L., Clarke, L. W., Johnson, E. L., Nemhauser, G. L., & Shenoi, R. G.
- Venue
- Transportation Science
- Published
- 1998-08
- Volume
- 32
- Issue
- 3
- Pages
- 208-220
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2115760878
- Cited by
- 360
- References
- 13
- FWCI
- 21.38
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.