Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 314

The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.

Planning for Robust Airline Operations: Optimizing Aircraft Routings and Flight Departure Times to Minimize Passenger Disruptions

Lan, Shan, Clarke, John-Paul, Barnhart, Cynthia·2006·Transportation Science

Abstract

Airlines typically construct their schedules assuming that every flight leg will depart and arrive as planned. Because this optimistic scenario rarely occurs, these plans are frequently disrupted and airlines often incur significant costs in addition to those originally planned. Flight delays and schedule disruptions also cause passenger delays and disruptions. A more robust plan can reduce the occurrence and impact of these delays, thereby reducing costs. In this paper, we present two new approaches to minimize passenger disruptions and achieve robust airline schedule plans. The first approach involves routing aircraft, and the second involves retiming flight departure times. Because each airplane usually flies a sequence of flight legs, delay of one flight leg might propagate along the aircraft route to downstream flight legs and cause further delays and disruptions. We propose a new approach to reduce delay propagation by intelligently routing aircraft. We formulate this problem as a mixed-integer programming problem with stochastically generated inputs. An algorithmic solution approach is presented. Computational results obtained using data from a major U.S. airline show that our approach can reduce delay propagation significantly, thus improving on-time performance and reducing the numbers of passengers disrupted. Our second area of research considers passengers who miss their flight legs due to insufficient connection time. We develop a new approach to minimize the number of passenger misconnections by retiming the departure times of flight legs within a small time window. We formulate the problem and an algorithmic solution approach is presented. Computational results obtained using data from a major U.S. airline show that this approach can substantially reduce the number of passenger misconnections without significantly increasing operational costs.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1287/trsc.1050.0134

Cites

37 of 37 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 37 references

Cited by

See all 314

Metadata

Authors
Lan, S., Clarke, J.-P., & Barnhart, C.
Venue
Transportation Science
Published
2006-02
Volume
40
Issue
1
Pages
15-28
ISSN
  • 0041-1655 (ISSN-L)
  • 1526-5447
OpenAlex
W2125071777
Cited by
314
References
37
FWCI
19.53
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Planning for Robust Airline Operations: Optimizing Aircraft Routings and Flight Departure Times to Minimize Passenger Disruptions. https://app.cochat.ai/papers/10.1287/trsc.1050.0134
The paper
Lan, S., Clarke, J.-P., & Barnhart, C. (2006). Planning for Robust Airline Operations: Optimizing Aircraft Routings and Flight Departure Times to Minimize Passenger Disruptions. Transportation Science. https://doi.org/10.1287/trsc.1050.0134

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.