Assignment of Arrival Slots
|
|
- Elvin Holland
- 6 years ago
- Views:
Transcription
1 Assignment of Arrival Slots James Schummer Rakesh V. Vohra Kellogg School of Management (MEDS) Northwestern University March 2012 Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
2 Overview Bad weather reduces available landing slots and causes flight cancelations. Initially, scarce resources (slot rationing). Eventually, excess resources (flight cancelations). A (re-)matching problem. Studied from operations perspective; little from mechanism design perspective. FAA/airlines agree on desirable attributes (mechanism design axioms). Our goal: formalize attributes; critique existing mechanism; offer superior alternative. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
3 Overview Bad weather reduces available landing slots and causes flight cancelations. Initially, scarce resources (slot rationing). Eventually, excess resources (flight cancelations). A (re-)matching problem. Studied from operations perspective; little from mechanism design perspective. FAA/airlines agree on desirable attributes (mechanism design axioms). Our goal: formalize attributes; critique existing mechanism; offer superior alternative. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
4 Ground Delay Program (part 1 of 2) Rationing a scarce supply of slots to scheduled flights. Slot Flight 1:00 BA027 1:01 UA301 1:02 UA081 1:03 AA111 1:04 AF023 1:05 BA229 1:06 UA123 = Slot 1:00 1:02 1:04 1:06. Flight... U.S. F.A.A. now uses Ration-by-Schedule: first-come first-served, based on position in previous schedule. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
5 Ground Delay Program (part 1 of 2) Rationing a scarce supply of slots to scheduled flights. Slot Flight 1:00 BA027 1:01 UA301 1:02 UA081 1:03 AA111 1:04 AF023 1:05 BA229 1:06 UA123.. = Slot Flight 1:00 BA027 1:02 UA301 1:04 UA081 1:06 AA111.. U.S. F.A.A. now uses Ration-by-Schedule: first-come first-served, based on position in previous schedule. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
6 GDP (part 2 of 2): Reassignment Rationing/bad weather/mechanical problems may cause an airline to cancel a flight, leaving excess resources (slots). Part 2 of GDP is to move flights up, making efficiency use of landing capacity. Slot Flight 1:00 BA027 1:02 UA301 1:04 UA081 1:06 AA111 1:08 AF023 1:10 BA229 1:12 UA :58 EI022 U.S. FAA now uses the Compression Algorithm (described later). Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
7 GDP (part 2 of 2): Reassignment Rationing/bad weather/mechanical problems may cause an airline to cancel a flight, leaving excess resources (slots). Part 2 of GDP is to move flights up, making efficiency use of landing capacity. Slot Flight 1:00 1:02 UA301 1:04 1:06 AA111 1:08 AF023 1:10 BA229 1:12 UA :58 EI022 U.S. FAA now uses the Compression Algorithm (described later). Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
8 GDP (part 2 of 2): Reassignment Rationing/bad weather/mechanical problems may cause an airline to cancel a flight, leaving excess resources (slots). Part 2 of GDP is to move flights up, making efficiency use of landing capacity. Slot Flight 1:00 1:02 UA301 1:04 1:06 AA111 1:08 AF023 1:10 BA229 1:12 UA :58 EI022 U.S. FAA now uses the Compression Algorithm (described later). Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
9 A matching problem Our objective: study only GDP part 2 (the reassignment problem). We take part 1 s rationing (RBS) as given. Any improvement we offer over the current algorithms becomes more striking, since adapting to RBS is a design constraint. In actuality, RBS is executed just once, while part 2 is repeatedly iterated over time: too complex to make reassignment a function of previous rounds trades. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
10 Industry Objectives Incentives The FAA and airlines agree on various objectives. If an airline reported a mechanical delay on a flight, the system would re-project its arrival time. If [rationing with Grover Jack were done] at that time, that flight would likely receive an additional delay on top of its mechanical delay. These effects were known as the Double Penalty issue... The airlines would simply not send in information that would [harm themselves]. RBS removes this disincentive." FAA website ( That is, the FAA likes strategy-proofness: incentive to report feasible arrival times truthfully. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
11 Industry Objectives Incentives The FAA and airlines agree on various objectives. If an airline reported a mechanical delay on a flight, the system would re-project its arrival time. If [rationing with Grover Jack were done] at that time, that flight would likely receive an additional delay on top of its mechanical delay. These effects were known as the Double Penalty issue... The airlines would simply not send in information that would [harm themselves]. RBS removes this disincentive." FAA website ( That is, the FAA likes strategy-proofness: incentive to report feasible arrival times truthfully. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
12 Industry Objectives Incentives Once arrival slots have been allocated, the Compression algorithm performs schedule updates by an inter-airline slot exchange, which aims to provide airlines with an incentive to report flight cancelations and delays. Vossen and Ball (2006) Note, two incentive conditions: Incentive to report delays (arrival times). (strategy-proofness) Incentive to report cancelations (infinite arrival time?). No formalization in this trans/ops literature. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
13 Industry Objectives Incentives If an airline sits on a slot that it is not planning to use, is there any way for [the system] to detect this and to take this slot away from the airline? Should this be done?" US DOT internal memo, Concern about failure to truthfully report cancelations. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
14 Industry Objectives Property Rights Under the FAA s Facility Operation and Administration handbook, airlines can rearrange their own portion of the schedule. [An airline] can reassign its flight-slot assignment... It should be emphasized that this notion of slot ownership is one of the main tenets of the CDM paradigm: there is a general consensus among airlines that this is indeed a fair method of rationing arrival capacity." Vossen and Ball (2006) The CDM paradigm results from collaboration between FAA and airlines. We view this as an endorsement of the normative idea that airlines have a degree of property rights associated with some degree of ownership" of the slots assigned to them by the RBS procedure. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
15 Industry Objectives Money? No. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
16 Overview of Talk -2 Explanation of GDP -1 Discussion of objectives 0 Overview 1 Model 2 Compression Algorithm characteristics 3 TradeCycle algorithm Connection to previous literature characteristics Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
17 Model Set of slots S = {1, 2,..., S }. (s, t S) Set of airlines A. (A, B A) Set of flights F. (f, g F A F) earliest arrival time for f : e f S. Landing Schedule Π: F S (feasible). Slot ownership function Φ: S A (consistent with Π). We call (Π, Φ) an assignment. An Instance (or Economy) is I = (S, A, (F A ) A, e, Π, Φ). ( F < S ) A matching function maps I Π. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
18 Model Set of slots S = {1, 2,..., S }. (s, t S) Set of airlines A. (A, B A) Set of flights F. (f, g F A F) earliest arrival time for f : e f S. Landing Schedule Π: F S (feasible). Slot ownership function Φ: S A (consistent with Π). We call (Π, Φ) an assignment. An Instance (or Economy) is I = (S, A, (F A ) A, e, Π, Φ). ( F < S ) A matching function maps I Π. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
19 Example of an Instance Slot Flight Airline feasible arrival time e f 1 vacant A 2 f 2 B 1 3 f 3 C 1 4 f 4 A 2 Slot 1: vacant and owned by airline A. Slot 2: owned by B, occupied by f 2 F B which could arrive in slot 1. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
20 Example of an Instance Slot Flight Airline feasible arrival time e f 1 vacant A 2 f 2 B 1 3 f 3 C 1 4 f 4 A 2 5 vacant B 6 f 6 C 5 7 f 7 A 5 8 f 8 B 6 9 vacant C 10 f 10 A 9 11 f 11 B 9 12 f 12 C 10 Slot 1: vacant and owned by airline A. Slot 2: owned by B, occupied by f 2 F B which could arrive in slot 1. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
21 Formalizing Objectives: preferences We are concerned with matching functions satisfying... Strategy-proofness; Non-manipulability by withholding slots; property rights (via IR, core, etc.). When is an airline better off? A weak" model: An airline gains only if each flight gains. Why use? Airlines already have some ability to make tradeoffs, by swapping flights within their own subschedule. Negative results are stronger. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
22 Formalizing Objectives: preferences We are concerned with matching functions satisfying... Strategy-proofness; Non-manipulability by withholding slots; property rights (via IR, core, etc.). When is an airline better off? A weak" model: An airline gains only if each flight gains. Why use? Airlines already have some ability to make tradeoffs, by swapping flights within their own subschedule. Negative results are stronger. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
23 Formalizing Objectives: preferences We are concerned with matching functions satisfying... Strategy-proofness; Non-manipulability by withholding slots; property rights (via IR, core, etc.). When is an airline better off? A weak" model: An airline gains only if each flight gains. Why use? Airlines already have some ability to make tradeoffs, by swapping flights within their own subschedule. Negative results are stronger. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
24 Formalizing Objectives We are concerned with matching functions that are... Strategy-proof: no airline can gain by misreporting the arrival times of its flights. Non-manipulable by slot destruction: no airline can gain by withholding (destroying) a vacant slot from the mechanism. (Weak) core selecting: no coalition of airlines could all (strictly) gain by simply trading amongst themselves. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
25 Basic Literature Our model is similar to housing problems (Shapley-Scarf). Differences are: Airlines can own multiple flights. Vacant slots (houses) belong to airlines. Preferences (of flights) are restricted: e f e f + 1 s 1 e f 1 Nevertheless we will see a connection to previous housing-market generalizations, e.g. Abdulkadiroglu and Sonmez (1999); Papai (2000). Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
26 Basic Literature Our model is similar to housing problems (Shapley-Scarf). Differences are: Airlines can own multiple flights. Vacant slots (houses) belong to airlines. Preferences (of flights) are restricted: e f e f + 1 s 1 e f 1 Nevertheless we will see a connection to previous housing-market generalizations, e.g. Abdulkadiroglu and Sonmez (1999); Papai (2000). Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
27 Compression Algorithm Compression: If an airline can t use a slot, it trades with the next scheduled flight that can use it. Step 0 Begin with an initial assignment (Π, Φ). Set V = the set of vacant slots. Step 1 If V =, end the algorithm at (Π, Φ). Otherwise make active the earliest vacant slot s V. Step 2 Let A = Φ(s) denote the airline that owns s. If A has a later flight f F A that could feasibly use slot s, move f to s, make f s original slot active, and repeat Step 2. Otherwise go to Step 3. Step 3 If any other airline B has a later flight that could feasibly use slot s, let f be the earliest such flight. Move f to s, assign f s original slot to A, make it active, and return to Step 2. Otherwise delete useless slot s from V and return to Step 1. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
28 Compression Example Slot Flight Airline feasible arrival time e f 1 vacant A 2 f 2 B 1 3 f 3 C 1 4 f 4 A 2 5 vacant B 6 f 6 C 5 7 f 7 A 5 8 f 8 B 6 9 vacant C 10 f 10 A 9 11 f 11 B 9 12 f 12 C 10 Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
29 Compression Example Slot Flight Airline feasible arrival time e f 1 f 2 B 1 2 vacant A 3 f 3 C 1 4 f 4 A 2 5 vacant B 6 f 6 C 5 7 f 7 A 5 8 f 8 B 6 9 vacant C 10 f 10 A 9 11 f 11 B 9 12 f 12 C 10 Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
30 Compression Example Slot Flight Airline feasible arrival time e f 1 f 2 B 1 2 f 4 A 2 3 f 3 C 1 4 vacant A 5 vacant B 6 f 6 C 5 7 f 7 A 5 8 f 8 B 6 9 vacant C 10 f 10 A 9 11 f 11 B 9 12 f 12 C 10 Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
31 Compression Example Slot Flight Airline feasible arrival time e f 1 f 2 B 1 2 f 4 A 2 3 f 3 C 1 4 vacant A 5 f 6 C 5 6 vacant B 7 f 7 A 5 8 f 8 B 6 9 vacant C 10 f 10 A 9 11 f 11 B 9 12 f 12 C 10 Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
32 Compression Example Slot Flight Airline feasible arrival time e f 1 f 2 B 1 2 f 4 A 2 3 f 3 C 1 4 vacant A 5 f 6 C 5 6 f 8 B 6 7 f 7 A 5 8 vacant B 9 vacant C 10 f 10 A 9 11 f 11 B 9 12 f 12 C 10 Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
33 Compression Example Slot Flight Airline feasible arrival time e f 1 f 2 B 1 2 f 4 A 2 3 f 3 C 1 4 vacant A 5 f 6 C 5 6 f 8 B 6 7 f 7 A 5 8 vacant B 9 f 10 A 9 10 vacant C 11 f 11 B 9 12 f 12 C 10 Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
34 Compression Example Slot Flight Airline feasible arrival time e f 1 f 2 B 1 2 f 4 A 2 3 f 3 C 1 4 vacant A 5 f 6 C 5 6 f 8 B 6 7 f 7 A 5 8 vacant B 9 f 10 A 9 10 f 12 C f 11 B 9 12 vacant C Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
35 Compression: incentives Theorem The compression algorithm is strategy-proof: it cannot be manipulated by misreporting an arrival time. Proof. Suppose f gets s by reporting e f honestly, but reports e f. If e f < e f s, then the outcome of the algorithm cannot be affected. Whenever f is the flight chosen in Steps 2 or 3 when e f is reported, f would still be chosen when e f is reported, because f never moved into a slot earlier than s. If s < e f, then f would have to end up in a slot strictly worse than s, since the Compression Algorithm never places a flight in a slot earlier than its reported earliest arrival time. If e f < e f, then the only way this misreport can change the outcome is to assign f to a slot earlier than e f, which is infeasible for f. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
36 Compression: slot destruction Proposition The Compression Algorithm is manipulable by slot destruction. Proof. Slot Flight Airline feasible arrival time e f 1 vacant A 2 vacant B 3 vacant A 4 f 4 C 2 5 f 5 B 4 6 f 6 A 4 7 f 7 B 1 Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
37 Compression: slot destruction Proposition The Compression Algorithm is manipulable by slot destruction. Proof. Slot Flight Airline feasible arrival time e f 1 f 7 B 1 2 vacant B 3 vacant A 4 f 4 C 2 5 f 5 B 4 6 f 6 A 4 7 vacant A Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
38 Compression: slot destruction Proposition The Compression Algorithm is manipulable by slot destruction. Proof. Slot Flight Airline feasible arrival time e f 1 f 7 B 1 2 f 4 C 2 3 vacant A 4 vacant B 5 f 5 B 4 6 f 6 A 4 7 vacant A Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
39 Compression: slot destruction Proposition The Compression Algorithm is manipulable by slot destruction. Proof. Slot Flight Airline feasible arrival time e f 1 f 7 B 1 2 f 4 C 2 3 vacant A 4 f 5 B 4 5 vacant B 6 f 6 A 4 7 vacant A Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
40 Compression: slot destruction Proposition The Compression Algorithm is manipulable by slot destruction. Proof. Slot Flight Airline feasible arrival time e f 1 f 7 B 1 2 f 4 C 2 3 vacant A 4 f 5 B 4 5 f 6 A 4 6 vacant B 7 vacant A Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
41 Compression: slot destruction Proposition The Compression Algorithm is manipulable by slot destruction. Proof. Slot Flight Airline feasible arrival time e f 1 vacant A 2 vacant B 3 vacant A 4 f 4 C 2 5 f 5 B 4 6 f 6 A 4 7 f 7 B 1 Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
42 Compression: slot destruction Proposition The Compression Algorithm is manipulable by slot destruction. Proof. Slot Flight Airline feasible arrival time e f 1 vacant A 2 vacant B 3 vacant A 4 f 4 C 2 5 f 5 B 4 6 f 6 A 4 7 f 7 B 1 Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
43 Compression: slot destruction Proposition The Compression Algorithm is manipulable by slot destruction. Proof. Slot Flight Airline feasible arrival time e f 1 vacant A 2 f 7 B 1 3 vacant A 4 f 4 C 2 5 f 5 B 4 6 f 6 A 4 7 vacant B Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
44 Compression: slot destruction Proposition The Compression Algorithm is manipulable by slot destruction. Proof. Slot Flight Airline feasible arrival time e f 1 vacant A 2 f 7 B 1 3 f 4 C 2 4 vacant A 5 f 5 B 4 6 f 6 A 4 7 vacant B Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
45 Compression: slot destruction Proposition The Compression Algorithm is manipulable by slot destruction. Proof. Slot Flight Airline feasible arrival time e f 1 vacant A 2 f 7 B 1 3 f 4 C 2 4 f 6 A 4 5 f 5 B 4 6 vacant A 7 vacant B Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
46 The Core Definition An assignment is in the core if no coalition of airlines can strictly gain by simply trading amongst themselves from their original endowments. Loosely speaking, if an outcome is not in the core, then some airlines are not receiving the best slots to which they are entitled, based on their slot endowments. In this sense, the core provides a form of property rights. The Strong Core can be empty. (E.g., airline with a vacant slot and no flights.) Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
47 The Core Definition An assignment is in the core if no coalition of airlines can strictly gain by simply trading amongst themselves from their original endowments. Loosely speaking, if an outcome is not in the core, then some airlines are not receiving the best slots to which they are entitled, based on their slot endowments. In this sense, the core provides a form of property rights. The Strong Core can be empty. (E.g., airline with a vacant slot and no flights.) Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
48 Core: Example revisited Slot Flight Airline feasible arrival time e f 1 vacant A 2 f 2 B 1 3 f 3 C 1 The strong core can be empty. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
49 Core: Example revisited Slot Flight Airline feasible arrival time e f 1 vacant A 2 f 2 B 1 3 f 3 C 1 4 f 4 A 2 Unique (strong) core matching (a là Shapley Scarf). Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
50 Core: Example revisited Slot Flight Airline feasible arrival time e f 1 vacant A 2 f 2 B 1 3 f 3 C 1 4 f 4 A 2 5 vacant B 6 f 6 C 5 7 f 7 A 5 8 f 8 B 6 9 vacant C 10 f 10 A 9 11 f 11 B 9 12 f 12 C 10 The core can be multi-valued. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
51 Compression and Core Apply Compression to the following example. Slot Flight Airline feasible arrival time e f 1 vacant A 2 vacant B 3 f 3 C 1 4 f 4 B 1 5 f 5 A 2 f 3 assigned to slot 1. Slot 3 is active; f 5 fills it. Slot 2 is active; f 4 fills it. However, this is not in the core. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
52 Compression and Core Apply Compression to the following example. Slot Flight Airline feasible arrival time e f 1 f 3 C 1 2 vacant B 3 vacant A 4 f 4 B 1 5 f 5 A 2 f 3 assigned to slot 1. Slot 3 is active; f 5 fills it. Slot 2 is active; f 4 fills it. However, this is not in the core. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
53 Compression and Core Apply Compression to the following example. Slot Flight Airline feasible arrival time e f 1 f 3 C 1 2 vacant B 3 f 5 A 2 4 f 4 B 1 5 vacant A f 3 assigned to slot 1. Slot 3 is active; f 5 fills it. Slot 2 is active; f 4 fills it. However, this is not in the core. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
54 Compression and Core Apply Compression to the following example. Slot Flight Airline feasible arrival time e f 1 f 3 C 1 2 f 4 B 1 3 f 5 A 2 4 vacant B 5 vacant A f 3 assigned to slot 1. Slot 3 is active; f 5 fills it. Slot 2 is active; f 4 fills it. However, this is not in the core. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
55 Top trading cycles Housing markets Each airline has exactly one flight/slot. No vacant slots. However, preferences are arbitrary. Shapley & Scarf describe the top trading cycle algorithm to find the unique core outcome. Each flight points to its favorite slot. Cycles exist, and are cleared. Repeat. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
56 Top trading cycles Housing markets Each airline has exactly one flight/slot. No vacant slots. However, preferences are arbitrary. Shapley & Scarf describe the top trading cycle algorithm to find the unique core outcome. Each flight points to its favorite slot. Cycles exist, and are cleared. Repeat. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
57 TradeCycle Algorithm tep 0 Take as input an initial assignment, and declare all slots and flights active." tep 1 If the set of active flights is empty, the algorithm ends. Otherwise, construct a graph as follows. Step 1a Introduce a node for each active slot and each active flight. Step 1b From each flight f, draw a directed edge to the earliest active slot that f can occupy. Step 1c From each occupied slot, draw a directed edge to the flight that occupies it. Step 1c From each vacant slot owned by any airline A, draw a directed edge to (i) the earliest scheduled active flight in F A, if one exists; (ii) the earliest scheduled active flight in F, otherwise. tep 2 Within any (directed) cycle in the graph: Permanently assign each flight to the slot it points to in the cycle; declare the flight and its assigned slot inactive. (Newly vacated slots within a cycle remain active.) Return to Step 1. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
58 TradeCycle Algorithm tep 0 Take as input an initial assignment, and declare all slots and flights active." tep 1 If the set of active flights is empty, the algorithm ends. Otherwise, construct a graph as follows. Step 1a Introduce a node for each active slot and each active flight. Step 1b From each flight f, draw a directed edge to the earliest active slot that f can occupy. Step 1c From each occupied slot, draw a directed edge to the flight that occupies it. Step 1c From each vacant slot owned by any airline A, draw a directed edge to (i) the earliest scheduled active flight in F A, if one exists; (ii) the earliest scheduled active flight in F, otherwise. tep 2 Within any (directed) cycle in the graph: Permanently assign each flight to the slot it points to in the cycle; declare the flight and its assigned slot inactive. (Newly vacated slots within a cycle remain active.) Return to Step 1. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
59 TradeCycle Algorithm tep 0 Take as input an initial assignment, and declare all slots and flights active." tep 1 If the set of active flights is empty, the algorithm ends. Otherwise, construct a graph as follows. Step 1a Introduce a node for each active slot and each active flight. Step 1b From each flight f, draw a directed edge to the earliest active slot that f can occupy. Step 1c From each occupied slot, draw a directed edge to the flight that occupies it. Step 1c From each vacant slot owned by any airline A, draw a directed edge to (i) the earliest scheduled active flight in F A, if one exists; (ii) the earliest scheduled active flight in F, otherwise. tep 2 Within any (directed) cycle in the graph: Permanently assign each flight to the slot it points to in the cycle; declare the flight and its assigned slot inactive. (Newly vacated slots within a cycle remain active.) Return to Step 1. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
60 Example Apply TC to this example. Slot Flight Airline feasible arrival time e f 1 vacant A 2 vacant B 3 f 3 C 1 4 f 4 B 1 5 f 5 A 2 Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
61 Example Apply TC to this example. Slot Flight Airline feasible arrival time e f 1 vacant A 2 vacant B 3 f 3 C 1 4 f 4 B 1 5 f 5 A 2 Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
62 Example Apply TC to this example. Slot Flight Airline feasible arrival time e f 1 vacant A 2 vacant B 3 f 3 C 1 4 f 4 B 1 5 f 5 A 2 Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
63 Example Apply TC to this example. Slot Flight Airline feasible arrival time e f 1 vacant A 2 vacant B 3 f 3 C 1 4 f 4 B 1 5 f 5 A 2 Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
64 Example Apply TC to this example. Slot Flight Airline feasible arrival time e f 1 vacant A 2 vacant B 3 f 3 C 1 4 f 4 B 1 5 f 5 A 2 Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
65 Example Apply TC to this example. Slot Flight Airline feasible arrival time e f 1 vacant A 2 vacant B 3 f 3 C 1 4 f 4 B 1 5 f 5 A 2 Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
66 Link to past work Proposition TradeCycle is algorithmically equivalent to a fixed endowment hierarchical exchange rule (Pápai 2000) where 1 flights are treated as individual agents, and 2 each slot has an inheritance structure that prioritizes flights in the following order: 1 the flight that occupies it (if any), 2 other flights of the same airline, by ETA (if any), 3 flights of other airlines, by ETA. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
67 Incentives Theorem TradeCycle is strategy-proof: it cannot be manipulated by misreporting an arrival time. Proof. From Pápai 2000, FEHE rules for assignment problems are group strategy-proof even when arbitrary preferences over slots are permitted. Here, an airline is a coalition of flights, and (flight) preferences are restricted (e f e f + 1, etc.). Since group strategy-proofness is preserved under domain reduction, the result follows. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
68 Main Point Theorem TradeCycle returns an assignment in the weak core. Proof. Suppose B blocks the assignment via Π B. If B flights point to Π B, assignment stays same (gsp). Consider first round in which B loses a slot to B c. A cycle is formed where a flight in B c is pointed to by a vacant slot from B. Its owner must already be fully assigned, receiving its favorite slot for each airline, not strictly better off at Π B, contradiction. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
69 Tradecycle: slot destruction Proposition TradeCycle is manipulable by slot destruction. Proof. Slot Flight Airline feasible arrival time e f 1 vacant C 2 f 2 A 1 3 vacant A 4 vacant D 5 f 5 B 3 6 f 6 C 5 7 f 7 A 5 8 f 8 D 7 Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
70 Tradecycle: slot destruction Proposition TradeCycle is manipulable by slot destruction. Proof. Slot Flight Airline feasible arrival time e f 1 f 2 A 1 2 vacant A 3 f 5 B 3 4 vacant D 5 f 6 C 5 6 vacant C 7 f 7 A 5 8 f 8 D 7 Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
71 Tradecycle: slot destruction Proposition TradeCycle is manipulable by slot destruction. Proof. Slot Flight Airline feasible arrival time e f 1 f 2 A 1 2 vacant A 3 f 5 B 3 4 vacant D 5 f 6 C 5 6 f 7 A 5 7 f 8 D 7 8 vacant C Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
72 Tradecycle: slot destruction Proposition TradeCycle is manipulable by slot destruction. Proof. Slot Flight Airline feasible arrival time e f 1 vacant C 2 f 2 A 1 3 vacant A 4 vacant D 5 f 5 B 3 6 f 6 C 5 7 f 7 A 5 8 f 8 D 7 Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
73 Tradecycle: slot destruction Proposition TradeCycle is manipulable by slot destruction. Proof. Slot Flight Airline feasible arrival time e f 1 vacant C 2 f 2 A 1 3 vacant A 4 vacant D 5 f 5 B 3 6 f 6 C 5 7 f 7 A 5 8 f 8 D 7 Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
74 Tradecycle: slot destruction Proposition TradeCycle is manipulable by slot destruction. Proof. Slot Flight Airline feasible arrival time e f 1 vacant C 2 f 2 A 1 3 vacant A 4 f 5 B 3 5 f 7 A 5 6 f 6 C 5 7 f 8 D 7 8 vacant D Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
75 Tradecycle: slot destruction Proposition TradeCycle is manipulable by slot destruction. Proof. Slot Flight Airline feasible arrival time e f 1 vacant C 2 f 2 A 1 3 vacant A 4 f 5 B 3 5 f 7 A 5 6 f 6 C 5 7 f 8 D 7 8 vacant D Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
76 Tradecycle: slot destruction Proposition TradeCycle is manipulable by slot destruction. Proof. Slot Flight Airline feasible arrival time e f 1 f 2 A 1 2 vacant C 3 vacant A 4 f 5 B 3 5 f 7 A 5 6 f 6 C 5 7 f 8 D 7 8 vacant D Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
77 Slot Destruction" in other matching models Theorem (Atlamaz and Klaus, 2007) Using our terminology, suppose airlines have arbitrary preferences over all subsets of slots. Then [Efficient + Individually Rational] [Manipulable by Endowment Destruction] No implication to our model, due to our preference restriction. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
78 Wrap-up Application of matching theory to another real world problem: reassignment of landing slots. FAA s current algorithm may fall outside of weak core. Our algorithm has the same incentives properties, and selects from the core. Our motivation for core rests more on property rights than on stability (e.g. unraveling in doctor/hospital markets). Strategy-proofness: obtainable (weak definition of prefs.) Core: obtainable. Airline incentive to keep useless slot. (proof of concept; is it widespread?) Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
79 Wrap-up Application of matching theory to another real world problem: reassignment of landing slots. FAA s current algorithm may fall outside of weak core. Our algorithm has the same incentives properties, and selects from the core. Our motivation for core rests more on property rights than on stability (e.g. unraveling in doctor/hospital markets). Strategy-proofness: obtainable (weak definition of prefs.) Core: obtainable. Airline incentive to keep useless slot. (proof of concept; is it widespread?) Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
80 Work in progress (with Azer Abizade) We suppose airlines can evaluate tradeoffs between flights. An airline may prefer moving one flight earlier at the cost of moving another flight later. This requires more preference information. Responsive? Separable? Linear? Preliminary results Any mechanism that does not solicit full preference information is manipulable. Strategy-proofness conflicts with Pareto-optimality. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
81 Work in progress (with Azer Abizade) We suppose airlines can evaluate tradeoffs between flights. An airline may prefer moving one flight earlier at the cost of moving another flight later. This requires more preference information. Responsive? Separable? Linear? Preliminary results Any mechanism that does not solicit full preference information is manipulable. Strategy-proofness conflicts with Pareto-optimality. Schummer & Vohra (Northwestern Univ.) Assignment of Arrival Slots March / 38
Assignment of Arrival Slots
Assignment of Arrival Slots James Schummer Rakesh V. Vohra March 22, 2009 Abstract When inclement weather reduces airport landing capacity, the FAA first creates a new schedule of feasible landing slots,
More informationIncentives in Landing Slot Problems
Incentives in Landing Slot Problems James Schummer 1 Azar Abizada 2 1 MEDS, Kellogg School of Management Northwestern University 2 School of Business Azerbaijan Diplomatic Academy June 2013 Schummer/Abizada
More informationProperty Rights in Runway Slots Allocation.
Property Rights in Runway Slots Allocation. Ken C. Ho Alexander Rodivilov October 24, 2016 For the latest version, please click here. Abstract This paper examines the runway slots allocation challenge
More informationIncentives in Landing Slot Problems
Incentives in Landing Slot Problems James Schummer Azar Abizada Current version: January 5, 2017 First version: March 2012 Abstract During weather-induced airport congestion, landing slots are reassigned
More informationFair Allocation Concepts in Air Traffic Management
Fair Allocation Concepts in Air Traffic Management Thomas Vossen, Michael Ball R.H. Smith School of Business & Institute for Systems Research University of Maryland 1 Ground Delay Programs delayed departures
More informationCombining Control by CTA and Dynamic En Route Speed Adjustment to Improve Ground Delay Program Performance
Combining Control by CTA and Dynamic En Route Speed Adjustment to Improve Ground Delay Program Performance James C. Jones, University of Maryland David J. Lovell, University of Maryland Michael O. Ball,
More informationCollaborative Decision Making By: Michael Wambsganss 10/25/2006
Collaborative Decision Making By: Michael Wambsganss 10/25/2006 TFM History De-regulation: leads to new demand patterns High fuel prices Air Traffic Controller s Strike*** TFM is born (mid 80s: eliminate
More informationEquity and Equity Metrics in Air Traffic Flow Management
Equity and Equity Metrics in Air Traffic Flow Management Michael O. Ball University of Maryland Collaborators: J. Bourget, R. Hoffman, R. Sankararaman, T. Vossen, M. Wambsganss 1 Equity and CDM Traditional
More informationAnalysis of Gaming Issues in Collaborative Trajectory Options Program (CTOP)
Analysis of Gaming Issues in Collaborative Trajectory Options Program (CTOP) John-Paul Clarke, Bosung Kim, Leonardo Cruciol Air Transportation Laboratory Georgia Institute of Technology Outline 2 Motivation
More informationCongestion Management Alternatives: a Toolbox Approach
Congestion Management Alternatives: a Toolbox Approach by Michael O. Ball University of Maryland & NEXTOR based on NEXTOR Congestion Management Project (coinvestigators: L. Ausubel, F. Berardino, P. Cramton,
More informationUC Berkeley Working Papers
UC Berkeley Working Papers Title The Value Of Runway Time Slots For Airlines Permalink https://escholarship.org/uc/item/69t9v6qb Authors Cao, Jia-ming Kanafani, Adib Publication Date 1997-05-01 escholarship.org
More informationSchedule Compression by Fair Allocation Methods
Schedule Compression by Fair Allocation Methods by Michael Ball Andrew Churchill David Lovell University of Maryland and NEXTOR, the National Center of Excellence for Aviation Operations Research November
More informationTransportation Timetabling
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 16 Transportation Timetabling 1. Transportation Timetabling Tanker Scheduling Air Transport Train Timetabling Marco Chiarandini DM87 Scheduling,
More informationFair Slot Allocation of Airspace Resources Based on Dual Values for Slots
Forth International Conference on Research in Air Transportation Fair Slot Allocation of Airspace Resources Based on Dual Values for Slots Nasim Vakili Pourtaklo School of Electrical and Computer Engineering
More informationInter-modal Substitution (IMS) in Airline Collaborative Decision Making
Inter-modal Substitution (IMS) in Airline Collaborative Decision Maing Yu Zhang UC Bereley NEXTOR Seminar Jan. 20, 2006 FAA, Washington D.C. 1 Road Map Introduction Delay In National Airspace System (NAS)
More informationAn Analysis of Dynamic Actions on the Big Long River
Control # 17126 Page 1 of 19 An Analysis of Dynamic Actions on the Big Long River MCM Team Control # 17126 February 13, 2012 Control # 17126 Page 2 of 19 Contents 1. Introduction... 3 1.1 Problem Background...
More informationSeen through an IATA lens A-CDM Globally
Seen through an IATA lens A-CDM Globally A-CDM Basics ATM Perspective Airport CDM is a part of the broader Collaborative Decision Making Focus: managing the turnaround of the aircraft fully transparent
More informationEquitable Allocation of Enroute Airspace Resources
Eighth USA/Europe Air Traffic Management Research and Development Seminar (ATM2009) Equitable Allocation of Enroute Airspace Resources Nasim Vakili Pourtaklo School of Electrical and Computer Engineering
More informationTraffic Flow Management
Traffic Flow Management Traffic Flow Management The mission of traffic management is to balance air traffic demand with system capacity to ensure the maximum efficient utilization of the NAS 2 Traffic
More informationPrice-Setting Auctions for Airport Slot Allocation: a Multi-Airport Case Study
Price-Setting Auctions for Airport Slot Allocation: a Multi-Airport Case Study An Agent-Based Computational Economics Approach to Strategic Slot Allocation SESAR Innovation Days Bologna, 2 nd December
More informationGROUND DELAY PROGRAM PLANNING UNDER UNCERTAINTY BASED ON THE RATION-BY-DISTANCE PRINCIPLE. October 25, 2007
GROUND DELAY PROGRAM PLANNING UNDER UNCERTAINTY BASED ON THE RATION-BY-DISTANCE PRINCIPLE Michael O. Ball, Robert H. Smith School of Business and Institute for Systems Research, University of Maryland,
More informationAbstract. Fair Allocation Concepts in Air Traffic Management. R.H. Smith School of Business
Abstract Title of Dissertation: Fair Allocation Concepts in Air Traffic Management Thomas W.M. Vossen, Doctor of Philosophy, 2002 Dissertation directed by: Professor M.O. Ball R.H. Smith School of Business
More informationAbstract. Introduction
COMPARISON OF EFFICIENCY OF SLOT ALLOCATION BY CONGESTION PRICING AND RATION BY SCHEDULE Saba Neyshaboury,Vivek Kumar, Lance Sherry, Karla Hoffman Center for Air Transportation Systems Research (CATSR)
More informationIncluding Linear Holding in Air Traffic Flow Management for Flexible Delay Handling
Including Linear Holding in Air Traffic Flow Management for Flexible Delay Handling Yan Xu and Xavier Prats Technical University of Catalonia (UPC) Outline Motivation & Background Trajectory optimization
More informationPRESENTATION OVERVIEW
ATFM PRE-TACTICAL PLANNING Nabil Belouardy PhD student Presentation for Innovative Research Workshop Thursday, December 8th, 2005 Supervised by Prof. Dr. Patrick Bellot ENST Prof. Dr. Vu Duong EEC European
More informationSafety Enhancement SE ASA Training - Policy and Training for Non-Normal Situations
Safety Enhancement Action: Implementers: (Select all that apply) Statement of Work: Total Financial Resources: Total: $1.2M Output 1: $0.6M Output 2: $0.6M Relation to Current Aviation Community Initiatives:
More informationAirline Scheduling: An Overview
Airline Scheduling: An Overview Crew Scheduling Time-shared Jet Scheduling (Case Study) Airline Scheduling: An Overview Flight Schedule Development Fleet Assignment Crew Scheduling Daily Problem Weekly
More informationAir Traffic Flow & Capacity Management Frederic Cuq
Air Traffic Flow & Capacity Management Frederic Cuq www.thalesgroup.com Why Do We Need ATFM/CDM? www.thalesgroup.com OPEN Why do we need flow management? ATM Large investments in IT infrastructure by all
More informationTwisted Frobenius extensions
Twisted Frobenius extensions Alistair Savage University of Ottawa Joint with: Jeffrey Pike (Ottawa) Slides available online: AlistairSavage.ca Preprint: arxiv:1502.00590 Alistair Savage (Ottawa) Twisted
More informationPeter Forsyth, Monash University Conference on Airports Competition Barcelona 19 Nov 2012
Airport Competition: Implications for Regulation and Welfare Peter Forsyth, Monash University Conference on Airports Competition Barcelona 19 Nov 2012 1 The Issue To what extent can we rely on competition
More informationOverview of Congestion Management Issues and Alternatives
Overview of Congestion Management Issues and Alternatives by Michael Ball Robert H Smith School of Business & Institute for Systems Research University of Maryland and Institute of Transportation Studies
More informationInterpretation of Force Majeure
EUSG 4 Effective from November 2017 Interpretation of Force Majeure 1. PURPOSE This document is aiming at providing guidance to slot coordinators about how the reasons provided by the aircraft operators
More informationA Review of Airport Runway Scheduling
1 A Review of Airport Runway Scheduling Julia Bennell School of Management, University of Southampton Chris Potts School of Mathematics, University of Southampton This work was supported by EUROCONTROL,
More informationAnalysis of Demand Uncertainty Effects in Ground Delay Programs
Analysis of Demand Uncertainty Effects in Ground Delay Programs Michael Ball, Thomas Vossen Robert H. Smith School of Business and Institute for Systems Research University of Maryland College Park, MD
More informationQuantifying and Reducing Demand Uncertainty in Ground Delay Programs. Michael O. Ball Thomas Vossen University of Maryland
Quantifying and Reducing Demand Uncertainty in Ground Delay Programs Michael O. Ball Thomas Vossen University of Maryland Ground Delay Program (GDP) delayed departures delayed departures delayed arrivals/
More informationApproximate Network Delays Model
Approximate Network Delays Model Nikolas Pyrgiotis International Center for Air Transportation, MIT Research Supervisor: Prof Amedeo Odoni Jan 26, 2008 ICAT, MIT 1 Introduction Layout 1 Motivation and
More informationOverview of the Airline Planning Process Dr. Peter Belobaba Presented by Alex Heiter
Overview of the Airline Planning Process Dr. Peter Belobaba Presented by Alex Heiter Istanbul Technical University Air Transportation Management M.Sc. Program Network, Fleet and Schedule Strategic Planning
More informationSERVICE NETWORK DESIGN: APPLICATIONS IN TRANSPORTATION AND LOGISTICS
SERVICE NETWORK DESIGN: APPLICATIONS IN TRANSPORTATION AND LOGISTICS Professor Cynthia Barnhart Massachusetts Institute of Technology Cambridge, Massachusetts USA March 21, 2007 Outline Service network
More informationIMPLEMENTING AND EVALUATING ALTERNATIVE AIRSPACE RATIONING METHODS. Jason Matthew Burke
IMPLEMENTING AND EVALUATING ALTERNATIVE AIRSPACE RATIONING METHODS by Jason Matthew Burke Thesis submitted to the Faculty of the Graduate School of the University of Maryland, College Park in partial fulfillment
More informationAirport Slot Capacity: you only get what you give
Airport Slot Capacity: you only get what you give Lara Maughan Head Worldwide Airport Slots 12 December 2018 Good afternoon everyone, I m Lara Maughan head of worldwide airports slots for IATA. Over the
More informationSALVADOR DECLARATION. Adopted in the city of Salvador de Bahia on 16 November 2009 by the XVIII ACI LAC Annual General Regional Assembly
SALVADOR DECLARATION Adopted in the city of Salvador de Bahia on 16 November 2009 by the XVIII ACI LAC Annual General Regional Assembly 1 IN CONSIDERATION: That the Airports Council International for Latin
More informationFuel Cost, Delay and Throughput Tradeoffs in Runway Scheduling
Fuel Cost, Delay and Throughput Tradeoffs in Runway Scheduling Hanbong Lee and Hamsa Balakrishnan Abstract A dynamic programming algorithm for determining the minimum cost arrival schedule at an airport,
More informationCDM Quick Reference Guide. Concepts I Need to Know for the Exam
CDM Quick Reference Guide Concepts I Need to Know for the Exam 1 What is the principle behind CDM? Sharing information between: ATC (al parts System Command & Control, Centers, TRACONS, Towers) Airlines
More informationAIRPORTS COMPETITION: IMPLICATIONS FOR
AIRPORTS COMPETITION: IMPLICATIONS FOR REGULATION AND WELFARE PETER FORSYTH (MU) COMMENTS BY: RICARDO FLORES-FILLOL (URV) CONFERENCE ON AIRPORTS COMPETITION 2012 AT UB NOVEMBER 2012 RICARDO FLORES-FILLOL
More informationFF-ICE A CONCEPT TO SUPPORT THE ATM SYSTEM OF THE FUTURE. Saulo Da Silva
International Civil Aviation Organization SIP/2012/ASBU/Dakar-WP/19 FF-ICE A CONCEPT TO SUPPORT THE ATM SYSTEM OF THE FUTURE Saulo Da Silva Workshop on preparations for ANConf/12 ASBU methodology (Dakar,
More informationGATWICK NIGHT MOVEMENT AND QUOTA ALLOCATION PROCEDURES
LOCAL RULE 1 GATWICK NIGHT MOVEMENT AND QUOTA ALLOCATION PROCEDURES 1. Policy All Night Flights require the prior allocation of a slot and corresponding Night Quota (movement and noise quota). Late arrivals
More informationMinimizing the Cost of Delay for Airspace Users
Minimizing the Cost of Delay for Airspace Users 12 th USA/Europe ATM R&D Seminar Seattle, USA Stephen KIRBY 29 th June, 2017 Overview The problem The UDPP* concept The validation exercise: Exercise plan
More informationChangi Airport A-CDM Handbook
Changi Airport A-CDM Handbook Intentionally left blank Contents 1. Introduction... 3 2. What is Airport Collaborative Decision Making?... 3 3. Operating concept at Changi... 3 a) Target off Block Time
More informationEstimating Avoidable Delay in the NAS
Estimating Avoidable Delay in the NAS Bala Chandran Avijit Mukherjee Mark Hansen Jim Evans University of California at Berkeley Outline Motivation The Bertsimas-Stock model for TFMP. A case study: Aug
More informationAIR TRAFFIC FLOW MANAGEMENT INDIA S PERSPECTIVE. Vineet Gulati GM(ATM-IPG), AAI
AIR TRAFFIC FLOW MANAGEMENT INDIA S PERSPECTIVE Vineet Gulati GM(ATM-IPG), AAI AIR TRAFFIC FLOW MANAGEMENT ATFM is a service provided with the objective to enhance the efficiency of the ATM system by,
More informationReview: Niche Tourism Contemporary Issues, Trends & Cases
From the SelectedWorks of Dr Philip Stone 2005 Review: Niche Tourism Contemporary Issues, Trends & Cases Philip Stone, Dr, University of Central Lancashire Available at: https://works.bepress.com/philip_stone/25/
More informationThe Impact of Ground Delay Program (GDP) Rationing Rules on Passenger and Airline Equity
The Impact of Ground Delay Program (GDP) Rationing Rules on Passenger and Airline Equity Bengi Manley Center for Air Transportation System Research George Mason University Fairfax, VA bmanley@gmu.edu Lance
More informationWhen air traffic demand is projected to exceed capacity, the Federal Aviation Administration implements
Vol. 46, No. 2, May 2012, pp. 262 280 ISSN 0041-1655 (print) ISSN 1526-5447 (online) http://dx.doi.org/10.1287/trsc.1110.0393 2012 INFORMS Equitable and Efficient Coordination in Traffic Flow Management
More informationI R UNDERGRADUATE REPORT. National Aviation System Congestion Management. by Sahand Karimi Advisor: UG
UNDERGRADUATE REPORT National Aviation System Congestion Management by Sahand Karimi Advisor: UG 2006-8 I R INSTITUTE FOR SYSTEMS RESEARCH ISR develops, applies and teaches advanced methodologies of design
More informationACI EUROPE POSITION PAPER
ACI EUROPE POSITION PAPER November 2018 Cover / Photo: Stockholm Arlanda Airport (ARN) Introduction Air traffic growth in Europe has shown strong performance in recent years, but airspace capacity has
More informationAIR TRANSPORT MANAGEMENT Universidade Lusofona January 2008
AIR TRANSPORT MANAGEMENT Universidade Lusofona Introduction to airline network planning: John Strickland, Director JLS Consulting Contents 1. What kind of airlines? 2. Network Planning Data Generic / traditional
More informationCopyright 2000, The MITRE Corporation. All rights reserved.
3 rd USA/Europe Air Traffic Management R&D Seminar, Napoli, 13-16 June 00 Modeling Distributed Human Decision-Making in Traffic Flow Management Operations 1 Keith C. Campbell Senior Staff Wayne W. Cooper,
More informationGATWICK NIGHT MOVEMENT AND QUOTA ALLOCATION PROCEDURES
LOCAL RULE 1 GATWICK NIGHT MOVEMENT AND QUOTA ALLOCATION PROCEDURES 1. Policy All Night Flights require the prior allocation of a slot and corresponding Night Quota (movement and noise quota). Late arrivals
More informationFAA Surface CDM. Collaborative Decision Making and Airport Operations. Date: September 25-27, 2017
FAA Surface CDM Collaborative Decision Making and Airport Operations Presented to: Third A-CDM Implementation Seminar/Workshop Presented by: Greg Byus, Manager, CDM and International Operations Date: September
More informationPASSUR Aerospace. Departure Metering Program at Toronto Pearson International Airport. Training Manual
PASSUR Aerospace Toronto Pearson International Airport Departure Metering Program at Toronto Pearson International Airport Training Manual Name: Today s Date: Toronto Pearson Deicing Sequencing Training
More informationAirport s Perspective of Traffic Growth and Demand Management CANSO APAC Conference 5-7 May 2014, Colombo, Sri Lanka
Airport s Perspective of Traffic Growth and Demand Management CANSO APAC Conference 5-7 May 2014, Colombo, Sri Lanka SL Wong Senior Manager - Technical & Industry Affairs The Question I Try to Answer How
More informationRECEDING HORIZON CONTROL FOR AIRPORT CAPACITY MANAGEMENT
RECEDING HORIZON CONTROL FOR AIRPORT CAPACITY MANAGEMENT W.-H. Chen, X.B. Hu Dept. of Aeronautical & Automotive Engineering, Loughborough University, UK Keywords: Receding Horizon Control, Air Traffic
More informationICAO Young Aviation Professionals Programme
ICAO Young Aviation Professionals Programme In partnership with and The International Civil Aviation Organization (ICAO), in partnership with the International Air Transport Association (IATA) and Airports
More informationFACILITATION PANEL (FALP)
International Civil Aviation Organization WORKING PAPER FALP/10-WP/19 Revised 29/8/18 FACILITATION PANEL (FALP) TENTH MEETING Montréal, 10-13 September 2018 Agenda Item 6: Other matters FACILITATION FOR
More informationJAPAN AIRLINES AGENCY DEBIT MEMO POLICY AND PROCEDURE FOR TRAVEL AGENTS IN ARC USA
JAPAN AIRLINES AGENCY DEBIT MEMO POLICY AND PROCEDURE FOR TRAVEL AGENTS IN ARC USA In accordance with IATA Resolution 850m, Japan Airlines (JAL) hereby revises its Agency Debit Memo (ADM) Policy to be
More informationMIME Noise Trading for Aircraft Noise Mitigation
Air Transport Research Society San Francisco 22 nd March 2007 MIME Noise Trading for Aircraft Noise Mitigation Peter Hullah EUROCONTROL Experimental Centre Brétigny sur Orge, France EUROCONTROL European
More informationIntentionally left blank
Intentionally left blank Contents 1. Introduction... 3 2. What is Airport Collaborative Decision Making?... 3 3. Operating concept at Changi... 3 a) Target off Block Time (TOBT)... 3 Who is responsible
More informationReduced Surface Emissions through Airport Surface Movement Optimization. Prof. Hamsa Balakrishnan. Prof. R. John Hansman
Reduced Surface Emissions through Airport Surface Movement Optimization Prof. Hamsa Balakrishnan Prof. R. John Hansman Aeronautics & Astronautics and Engineering Systems Motivation Opportunities to improve
More informationThe Impact of Ground Delay Program (GDP) Rationing Rules on Passenger and Airline Equity
The Impact of Ground Delay Program (GDP) Rationing Rules on Passenger and Airline Equity Bengi Manley Center for Air Transportation System Research George Mason University Fairfax, VA bmanley@gmu.edu Lance
More informationMulti Nodal Regional ATFM/CDM Concept and Operational Trials Colombo 7 May 2014
Multi Nodal Regional ATFM/CDM Concept and Operational Trials Colombo 7 May 2014 CANSO Asia Pacific Collaborative ATM Operations Workshop, Colombo 7 May 201 Evolution of the Regional ATFM Concept Research
More informationHEATHROW NIGHT MOVEMENT AND QUOTA ALLOCATION PROCEDURES Version 3
LOCAL RULE 1 HEATHROW NIGHT MOVEMENT AND QUOTA ALLOCATION PROCEDURES Version 3 1. POLICY All Night Flights require the prior allocation of a slot and corresponding Night Quota (movement and noise quota).
More informationNextGen Trajectory-Based Operations Status Update Environmental Working Group Operations Standing Committee
NextGen Trajectory-Based Operations Status Update Environmental Working Group Operations Standing Committee May 17, 2010 Rose Ashford Rose.Ashford@nasa.gov 1 Outline Key Technical Concepts in TBO Current
More informationIntroduction To Ecotourism
1 Module # 11 Component # 9 Introduction To Ecotourism Introduction Much is said these days about how lucrative ecotourism could be to a subcontinent unshackled from the political incorrectness of the
More informationBEFORE THE FEDERAL AVIATION ADMINISTRATION WASHINGTON, D.C.
BEFORE THE FEDERAL AVIATION ADMINISTRATION WASHINGTON, D.C. In the matter of Docket No. FAA-2007-029320 Operating Limitations at New York s John. F. Kennedy International Airport COMMENTS OF THE INTERNATIONAL
More informationRecommendations on Consultation and Transparency
Recommendations on Consultation and Transparency Background The goal of the Aviation Strategy is to strengthen the competitiveness and sustainability of the entire EU air transport value network. Tackling
More informationOlympics Managing Special Events Brendan Kelly, Head of Operational Policy
Olympics 2012 Managing Special Events Brendan Kelly, Head of Operational Policy Contents The shock and scale Olympics gives you 7 years notice, in ATM terms you need every minute Mobilisation It is not
More informationGlossary and Acronym List
AFS Safety Assurance System (SAS) Overview Glossary and Acronym List This document lists and defines many SAS acronyms and terms. This is not intended to be a complete list of terms and definitions. TERM
More informationTransit Vehicle Scheduling: Problem Description
Transit Vehicle Scheduling: Problem Description Outline Problem Characteristics Service Planning Hierarchy (revisited) Vehicle Scheduling /24/03.224J/ESD.204J Problem Characteristics Consolidated Operations
More informationThe DFS perspective on safe and fair integration of UAS into the national airspace system
The DFS perspective on safe and fair integration of UAS into the national airspace system Eurocontrol Workshop on RPAS ATM Integration Brussels, 06 April 2017 Angela Kies (0) Contents The DFS perspective
More informationMassport Study Team Evaluation of CAC Noise Study Alternatives. October 2010
Massport Study Team Evaluation of CAC Noise Study Alternatives October 2010 Massport s Evaluation Team Aviation Planning Capital Programs Aviation Operations Environmental Permitting Consultation with
More informationA Multilayer and Time-varying Structural Analysis of the Brazilian Air Transportation Network
A Multilayer and Time-varying Structural Analysis of the Brazilian Air Transportation Network Klaus Wehmuth, Bernardo B. A. Costa, João Victor M. Bechara, Artur Ziviani 1 National Laboratory for Scientific
More informationCluster A.2: Linear Functions, Equations, and Inequalities
A.2A: Representing Domain and Range Values: Taxi Trips Focusing TEKS A.2A Linear Functions, Equations, and Inequalities. The student applies mathematical process standards when using properties of linear
More informationTowards New Metrics Assessing Air Traffic Network Interactions
Towards New Metrics Assessing Air Traffic Network Interactions Silvia Zaoli Salzburg 6 of December 2018 Domino Project Aim: assessing the impact of innovations in the European ATM system Innovations change
More informationCivil Aviation Policy and Privatisation in the Kingdom of Saudi Arabia. Abdullah Dhawi Al-Otaibi
Civil Aviation Policy and Privatisation in the Kingdom of Saudi Arabia Abdullah Dhawi Al-Otaibi A thesis submitted to the University of Exeter for the degree of Doctor of Philosophy in Politics September
More informationAeronautical Information Services Issue 1 30 May 2012
United Kingdom Overseas Territories Aviation Circular OTAC 175-1 Aeronautical Information Services Issue 1 30 May 2012 GENERAL Effective: on issue Overseas Territories Aviation Circulars are issued to
More informationReservation & Ticketing Policy
Reservation & Ticketing Policy Dated 6 th September 2015 Reservation & Ticketing Policy Contents 1. Introduction... 3 2. Purpose... 3 3. Implementation... 3 4. Application... 4 5. Best Practices... 4 6.
More informationAirline Scheduling Optimization ( Chapter 7 I)
Airline Scheduling Optimization ( Chapter 7 I) Vivek Kumar (Research Associate, CATSR/GMU) February 28 th, 2011 CENTER FOR AIR TRANSPORTATION SYSTEMS RESEARCH 2 Agenda Airline Scheduling Factors affecting
More informationActivity Template. Drexel-SDP GK-12 ACTIVITY. Subject Area(s): Sound Associated Unit: Associated Lesson: None
Activity Template Subject Area(s): Sound Associated Unit: Associated Lesson: None Drexel-SDP GK-12 ACTIVITY Activity Title: What is the quickest way to my destination? Grade Level: 8 (7-9) Activity Dependency:
More informationAirspace Organization and Management
Airspace Organization and Management Asia and Pacific Regional Sub Office 2014 17 November 2014 Page 1 CONTENTS Concept of Flexible Use of Airspace (FUA) Flexible and adaptable airspace structure Conditional
More informationDMAN-SMAN-AMAN Optimisation at Milano Linate Airport
DMAN-SMAN-AMAN Optimisation at Milano Linate Airport Giovanni Pavese, Maurizio Bruglieri, Alberto Rolando, Roberto Careri Politecnico di Milano 7 th SESAR Innovation Days (SIDs) November 28 th 30 th 2017
More informationGUIDELINES FOR THE ADMINISTRATION OF SANCTIONS AGAINST SLOT MISUSE IN IRELAND
GUIDELINES FOR THE ADMINISTRATION OF SANCTIONS AGAINST SLOT MISUSE IN IRELAND October 2017 Version 2 1. BACKGROUND 1.1 Article 14.5 of Council Regulation (EEC) No 95/93, as amended by Regulation (EC) No
More informationAirline Schedule Development Overview Dr. Peter Belobaba
Airline Schedule Development Overview Dr. Peter Belobaba Istanbul Technical University Air Transportation Management M.Sc. Program Network, Fleet and Schedule Strategic Planning Module 18 : 1 April 2016
More informationEconomic Impact for Airlines from Air Traffic Control Tower Modernization at LaGuardia Airport
Economic Impact for Airlines from Air Traffic Control Tower Modernization at LaGuardia Airport Presented at SCEA Marc Rose, MCR LLC 202-548-5584 mrose@mcricom 24 June 2007 MCR, LLC MCR Proprietary - Distribution
More informationMSc Tourism and Sustainable Development LM562 (Under Review)
MSc Tourism and Sustainable Development LM562 (Under Review) 1. Introduction Understanding the relationships between tourism, environment and development has been one of the major objectives of governments,
More informationWhy pilots don t follow procedures
Why pilots don t follow procedures Airline operators and airframe manufacturers express frustration with flight crews who do not follow established procedures. In order to address the question of why crews
More informationSMS HAZARD ANALYSIS AT A UNIVERSITY FLIGHT SCHOOL
SMS HAZARD ANALYSIS AT A UNIVERSITY FLIGHT SCHOOL Don Crews Middle Tennessee State University Murfreesboro, Tennessee Wendy Beckman Middle Tennessee State University Murfreesboro, Tennessee For the last
More informationAirport Privatization:
Airport Privatization: Focus on Concessions Hemant Mistry Director, Global Airport Infrastructure and Fuel Dorian Reece Director, Government and Infrastructure, Deloitte During our AGM in Sydney last year
More informationWORLDWIDE AIR TRANSPORT CONFERENCE: CHALLENGES AND OPPORTUNITIES OF LIBERALIZATION. Montreal, 24 to 29 March 2003
26/2/03 English only WORLDWIDE AIR TRANSPORT CONFERENCE: CHALLENGES AND OPPORTUNITIES OF LIBERALIZATION Montreal, 24 to 29 March 2003 Agenda Item 1: Preview 1.1: Background to and experience of liberalization
More informationNational Coordination Committee
National Coordination Committee Local Guideline Proposal - Lisbon 01.OUT.2014 Local Guideline Proposal - Lisbon Special noise regime during the night and early morning period (00:00-06:00 LT) Night Restrictions
More informationAircraft Arrival Sequencing: Creating order from disorder
Aircraft Arrival Sequencing: Creating order from disorder Sponsor Dr. John Shortle Assistant Professor SEOR Dept, GMU Mentor Dr. Lance Sherry Executive Director CATSR, GMU Group members Vivek Kumar David
More information