The DOI matches its Crossref record.
Daily Aircraft Routing and Scheduling
Abstract
In this paper we consider the daily aircraft routing and scheduling problem (DARSP). It consists of determining daily schedules which maximize the anticipated profits derived from the aircraft of a heterogeneous fleet. This fleet must cover a set of operational flight legs with known departure time windows, durations and profits according to the aircraft type. We present two models for this problem: a Set Partitioning type formulation and a time constrained multicommodity network flow formulation. We describe the network structure of the subproblem when a column generation technique is applied to solve the linear relaxation of the first model and when a Dantzig-Wolfe decomposition approach is used to solve the linear relaxation of the second model. The linear relaxation of the first model provides upper bounds. Integer solutions to the overall problem are derived through branch-and-bound. By exploiting the equivalence between the two formulations, we propose various optimal branching strategies compatible with the column generation technique. Finally we report computational results obtained on data provided by two different airlines. These results show that significant profit improvement can be generated by solving the DARSP using our approach and that this can be obtained in a reasonable amount of CPU time.
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
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
Self-citationLan, 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
“To guarantee feasible solutions, particularly in low-frequency, 372 Transportation Science/Vol. 37, No. 4, November 2003 point-to-point networks, researchers have integrated fleet assignment and aircraft routing models, as in Desaulniers et al. (1997) and Barnhart et al. (1998a).”
BackgroundBenders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
Cordeau, J.-F., Stojković, G., Soumis, F., & Desrosiers, J. (2001) · Transportation Science · doi:10.1287/trsc.35.4.375.10432 · Cited by 302
Self-citationA technical review of column generation in integer programming
Wilhelm, W. E. (2001) · Optimization and Engineering · doi:10.1023/a:1013141227104 · Cited by 108
“Desrochers et al. (1992a) noted that over covering did not occur in their numerical experiments and is guaranteed not to occur if costs satisfy the triangle inequality.”
Background
Metadata
- Authors
- Desaulniers, G., Desrosiers, J., Dumas, Y., Solomon, M. M., & Soumis, F.
- Venue
- Management Science
- Published
- 1997-06
- Volume
- 43
- Issue
- 6
- Pages
- 841-855
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W1987569535
- Cited by
- 227
- References
- 0
- FWCI
- 16.23
- 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.