2014
DOI: 10.1016/j.jairtraman.2014.01.005
|View full text |Cite
|
Sign up to set email alerts
|

An airline connection builder using maximum connection lag with greedy parameter selection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 25 publications
(12 citation statements)
references
References 7 publications
0
12
0
Order By: Relevance
“…However, including connections with three or even more legs would lead to a dramatic increase in the number of feasible connections, making the described process of determining the set of competitive connections by pairwise comparisons even more complex. In addition, on a worldwide level, the share of passengers traveling on three or more legs is less than 3% (Seredynski et al, 2014), thus, the additional informative value for the study would be limited.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…However, including connections with three or even more legs would lead to a dramatic increase in the number of feasible connections, making the described process of determining the set of competitive connections by pairwise comparisons even more complex. In addition, on a worldwide level, the share of passengers traveling on three or more legs is less than 3% (Seredynski et al, 2014), thus, the additional informative value for the study would be limited.…”
Section: Discussionmentioning
confidence: 99%
“…Research on airline networks and connectivity typically makes use of connection builders, i.e., algorithms that construct flight connections using a set of rules and parameters, that are calibrated with schedule and booking data (Seredynski et al, 2014). In our approach, a feasible transfer connection must not only meet conditions of minimum connecting time, maximum connecting time, and maximum detour factor.…”
Section: Introductionmentioning
confidence: 99%
“…Maximum Geographical Detour (MGD). MCT is the shortest time required to transfer passengers and baggage from the arriving to the departing flight (Seredyński et al, 2014) and depends on both airport-specific parameters and connection type. Airports usually compile and publish monthly updates on the applicable MCTs for all types of connections; however such rules can be very complex for major airports, including hundreds of exceptions.…”
Section: Hub Airport Connectivitymentioning
confidence: 99%
“…The flights are then filtered by the codes of the published airline and its partners. Using a SAS algorithm, best weekly flight connections are built on the following restrictions (adapted from Seredynski et al, 2014): a) the published minimum connecting times (minct) must be met, b) the maximum connecting time (maxct) is arbitrarily set at one hour above the shortest weekly connection time (as in Voltes-Dorta et al, 2017) 5 , c) passengers on each first-leg flight prefer the alternative with the shortest travel time, and d) passengers on each final-leg flight also prefer the shortest travel times. For the example in Table B1, the published minct was 60 min, which matches the best weekly connection time.…”
Section: Eastern Us To Indiamentioning
confidence: 99%