The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
Abstract
Given a set of flight legs to be flown by a single type of aircraft, the simultaneous aircraft routing and crew scheduling problem consists of determining a minimum-cost set of aircraft routes and crew pairings such that each flight leg is covered by one aircraft and one crew, and side constraints are satisfied. While some side constraints such as maximum flight time and maintenance requirements involve only crews or aircraft, linking constraints impose minimum connection times for crews that depend on aircraft connections. To handle these linking constraints, a solution approach based on Benders decomposition is proposed. The solution process iterates between a master problem that solves the aircraft routing problem, and a subproblem that solves the crew pairing problem. Because of their particular structure, both of these problems are solved by column generation. A heuristic branch-and-bound method is used to compute integer solutions. On a set of test instances based on data provided by an airline, the integrated approach produced significant cost savings in comparison with the sequential planning process commonly used in practice. The largest instance solved contains more than 500 flight legs over a 3-day period.
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
Decomposition Principle for Linear Programs
Dantzig, G. B., & Wolfe, P. (1960) · Operations Research · doi:10.1287/opre.8.1.101 · Cited by 2,315
Solving Airline Crew Scheduling Problems by Branch-and-Cut
Hoffman, K. L., & Padberg, M. (1993) · Management Science · doi:10.1287/mnsc.39.6.657 · Cited by 537
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
Flight String Models for Aircraft Fleeting and Routing
Barnhart, C., Boland, N. L., Clarke, L. W., Johnson, E. L., Nemhauser, G. L., & Shenoi, R. G. (1998) · Transportation Science · doi:10.1287/trsc.32.3.208 · Cited by 360
Applying Integer Linear Programming to the Fleet Assignment Problem
Abara, J. (1989) · Interfaces · doi:10.1287/inte.19.4.20 · Cited by 276
A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems
Desaulniers, G., Desrosiers, J., loachim, I., Solomon, M. M., Soumis, F., & Villeneuve, D. (1998) · Fleet Management and Logistics · doi:10.1007/978-1-4615-5755-5_3 · Cited by 238
Self-citationDaily Aircraft Routing and Scheduling
Desaulniers, G., Desrosiers, J., Dumas, Y., Solomon, M. M., & Soumis, F. (1997) · Management Science · doi:10.1287/mnsc.43.6.841 · Cited by 227
Self-citationFlight 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
Lavoie, S., Minoux, M., & Odier, E. (1988) · European Journal of Operational Research · doi:10.1016/0377-2217(88)90377-3 · Cited by 203
Desaulniers, G., Desrosiers, J., Dumas, Y., Marc, S., Rioux, B., Solomon, M. M., & Soumis, F. (1997) · European Journal of Operational Research · doi:10.1016/s0377-2217(96)00195-6 · Cited by 187
Self-citationThe Aircraft Maintenance Routing Problem
Gopalan, R., & Talluri, K. T. (1998) · Operations Research · doi:10.1287/opre.46.2.260 · Cited by 185
Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
Vance, P. H., Barnhart, C., Johnson, E. L., & Nemhauser, G. L. (1997) · Operations Research · doi:10.1287/opre.45.2.188 · Cited by 183
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
Operations Research in the Airline Industry
(1998) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4615-5501-8 · Cited by 159
Simultaneous Assignment of Locomotives and Cars to Passenger Trains
Cordeau, J., Soumis, F., & Desrosiers, J. (2001) · Operations Research · doi:10.1287/opre.49.4.531.11226 · Cited by 137
Self-citationGraves, G. W., McBride, R. D., Gershkoff, I., Anderson, D., & Mahidhara, D. (1993) · Management Science · doi:10.1287/mnsc.39.6.736 · Cited by 129
The Four-Day Aircraft Maintenance Routing Problem
Talluri, K. T. (1998) · Transportation Science · doi:10.1287/trsc.32.1.43 · Cited by 124
Deadhead Selection for the Long-Haul Crew Pairing Problem
Barnhart, C., Hatay, L., & Johnson, E. L. (1995) · Operations Research · doi:10.1287/opre.43.3.491 · Cited by 69
Integrated Airline Schedule Planning
Barnhart, C., Lu, F., & Shenoi, R. G. (1998) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-1-4615-5501-8_13 · Cited by 48
Cited by
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
Applications 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
Rajendran, S., & Srinivas, S. (2020) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2020.102090 · Cited by 256
Metadata
- Authors
- Cordeau, J.-F., Stojković, G., Soumis, F., & Desrosiers, J.
- Venue
- Transportation Science
- Published
- 2001-11
- Volume
- 35
- Issue
- 4
- Pages
- 375-388
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2059559546
- Cited by
- 302
- References
- 20
- FWCI
- 16.49
- 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.