Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and...
Transcript of Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and...
![Page 1: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/1.jpg)
JoenDahlberg,Ta/anaPolishchuk,Valen/nPolishchuk,Chris&aneSchmidt
Stakeholder Cooperation for Improved Predictability and
Lower Cost Remote Services
![Page 2: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/2.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 2
![Page 3: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/3.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 2
• Remotely operated towers enable control of multiple aerodromes from a single Remote Tower Module (RTM) in a Remote Tower Center.
![Page 4: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/4.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 2
• Remotely operated towers enable control of multiple aerodromes from a single Remote Tower Module (RTM) in a Remote Tower Center.
• In Sweden: two remotely controlled airports in operation, five more studied.
![Page 5: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/5.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 2
• Remotely operated towers enable control of multiple aerodromes from a single Remote Tower Module (RTM) in a Remote Tower Center.
• In Sweden: two remotely controlled airports in operation, five more studied.• Splits the cost of Air Traffic Services (ATS) provision and staff management
between several airports
![Page 6: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/6.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 2
• Remotely operated towers enable control of multiple aerodromes from a single Remote Tower Module (RTM) in a Remote Tower Center.
• In Sweden: two remotely controlled airports in operation, five more studied.• Splits the cost of Air Traffic Services (ATS) provision and staff management
between several airports • Labour accounts for up to 85% of ATS cost
![Page 7: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/7.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 2
• Remotely operated towers enable control of multiple aerodromes from a single Remote Tower Module (RTM) in a Remote Tower Center.
• In Sweden: two remotely controlled airports in operation, five more studied.• Splits the cost of Air Traffic Services (ATS) provision and staff management
between several airports • Labour accounts for up to 85% of ATS cost
➡ Significant cost savings for small airports (30-120movements a day)
![Page 8: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/8.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 2
• Remotely operated towers enable control of multiple aerodromes from a single Remote Tower Module (RTM) in a Remote Tower Center.
• In Sweden: two remotely controlled airports in operation, five more studied.• Splits the cost of Air Traffic Services (ATS) provision and staff management
between several airports • Labour accounts for up to 85% of ATS cost
➡ Significant cost savings for small airports (30-120movements a day)• To ensure safety: No simultaneous movements at airports controlled from the same
module
![Page 9: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/9.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 2
• Remotely operated towers enable control of multiple aerodromes from a single Remote Tower Module (RTM) in a Remote Tower Center.
• In Sweden: two remotely controlled airports in operation, five more studied.• Splits the cost of Air Traffic Services (ATS) provision and staff management
between several airports • Labour accounts for up to 85% of ATS cost
➡ Significant cost savings for small airports (30-120movements a day)• To ensure safety: No simultaneous movements at airports controlled from the same
module➡ In extreme case in Sweden: simultaneous movements at all five airports
![Page 10: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/10.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 2
• Remotely operated towers enable control of multiple aerodromes from a single Remote Tower Module (RTM) in a Remote Tower Center.
• In Sweden: two remotely controlled airports in operation, five more studied.• Splits the cost of Air Traffic Services (ATS) provision and staff management
between several airports • Labour accounts for up to 85% of ATS cost
➡ Significant cost savings for small airports (30-120movements a day)• To ensure safety: No simultaneous movements at airports controlled from the same
module➡ In extreme case in Sweden: simultaneous movements at all five airports
➡ Each airport needs separate RTM
![Page 11: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/11.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 2
• Remotely operated towers enable control of multiple aerodromes from a single Remote Tower Module (RTM) in a Remote Tower Center.
• In Sweden: two remotely controlled airports in operation, five more studied.• Splits the cost of Air Traffic Services (ATS) provision and staff management
between several airports • Labour accounts for up to 85% of ATS cost
➡ Significant cost savings for small airports (30-120movements a day)• To ensure safety: No simultaneous movements at airports controlled from the same
module➡ In extreme case in Sweden: simultaneous movements at all five airports
➡ Each airport needs separate RTM➡ Possibilities to perturb flight schedules? (current flight schedules consider only
the single airport, ATCO might have to put a/c on hold anyhow…)
![Page 12: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/12.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 3
Problem Formulation
![Page 13: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/13.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 4
• Input: Aircraft movements at each airport from Demand Data Repository (DDR) hosted by EUROCONTROL
![Page 14: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/14.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 4
• Input: Aircraft movements at each airport from Demand Data Repository (DDR) hosted by EUROCONTROL
• Split the time into 5-min intervals, called slots , and put every flight into its slot
![Page 15: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/15.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 4
• Input: Aircraft movements at each airport from Demand Data Repository (DDR) hosted by EUROCONTROL
• Split the time into 5-min intervals, called slots , and put every flight into its slot➡ Input matrix F:
![Page 16: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/16.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 4
• Input: Aircraft movements at each airport from Demand Data Repository (DDR) hosted by EUROCONTROL
• Split the time into 5-min intervals, called slots , and put every flight into its slot➡ Input matrix F:
❖ Row per airport (a)
![Page 17: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/17.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 4
• Input: Aircraft movements at each airport from Demand Data Repository (DDR) hosted by EUROCONTROL
• Split the time into 5-min intervals, called slots , and put every flight into its slot➡ Input matrix F:
❖ Row per airport (a)❖ Column per each slot (s)
![Page 18: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/18.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 4
• Input: Aircraft movements at each airport from Demand Data Repository (DDR) hosted by EUROCONTROL
• Split the time into 5-min intervals, called slots , and put every flight into its slot➡ Input matrix F:
❖ Row per airport (a)❖ Column per each slot (s)❖ Fas = 1 if a movement happens at airport a at time slot s
![Page 19: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/19.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 4
• Input: Aircraft movements at each airport from Demand Data Repository (DDR) hosted by EUROCONTROL
• Split the time into 5-min intervals, called slots , and put every flight into its slot➡ Input matrix F:
❖ Row per airport (a)❖ Column per each slot (s)❖ Fas = 1 if a movement happens at airport a at time slot s ❖ Fas = 0 otherwise
![Page 20: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/20.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 4
• Input: Aircraft movements at each airport from Demand Data Repository (DDR) hosted by EUROCONTROL
• Split the time into 5-min intervals, called slots , and put every flight into its slot➡ Input matrix F:
❖ Row per airport (a)❖ Column per each slot (s)❖ Fas = 1 if a movement happens at airport a at time slot s ❖ Fas = 0 otherwise
• Conflict: two movements during the same slot in different airports (in F: two 1s in the same column)
![Page 21: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/21.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 4
• Input: Aircraft movements at each airport from Demand Data Repository (DDR) hosted by EUROCONTROL
• Split the time into 5-min intervals, called slots , and put every flight into its slot➡ Input matrix F:
❖ Row per airport (a)❖ Column per each slot (s)❖ Fas = 1 if a movement happens at airport a at time slot s ❖ Fas = 0 otherwise
• Conflict: two movements during the same slot in different airports (in F: two 1s in the same column)
• Conflicting airports should never be assigned to the same RTM
![Page 22: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/22.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 4
• Input: Aircraft movements at each airport from Demand Data Repository (DDR) hosted by EUROCONTROL
• Split the time into 5-min intervals, called slots , and put every flight into its slot➡ Input matrix F:
❖ Row per airport (a)❖ Column per each slot (s)❖ Fas = 1 if a movement happens at airport a at time slot s ❖ Fas = 0 otherwise
• Conflict: two movements during the same slot in different airports (in F: two 1s in the same column)
• Conflicting airports should never be assigned to the same RTM
![Page 23: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/23.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 5
• Output: Shifted flights and Airport-to-RTM assignment
![Page 24: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/24.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 5
• Output: Shifted flights and Airport-to-RTM assignment• Goal: ”small” shifts to the flight schedules → decreased number of required RTMs
![Page 25: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/25.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 5
• Output: Shifted flights and Airport-to-RTM assignment• Goal: ”small” shifts to the flight schedules → decreased number of required RTMs• Measure for shift?
![Page 26: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/26.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 5
• Output: Shifted flights and Airport-to-RTM assignment• Goal: ”small” shifts to the flight schedules → decreased number of required RTMs• Measure for shift?
❖ Maximum slot shift Δ (in minutes; multiple of 5, as we shift only by whole slots)
![Page 27: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/27.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 5
• Output: Shifted flights and Airport-to-RTM assignment• Goal: ”small” shifts to the flight schedules → decreased number of required RTMs• Measure for shift?
❖ Maximum slot shift Δ (in minutes; multiple of 5, as we shift only by whole slots)❖ Number of shifts S
![Page 28: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/28.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 5
• Output: Shifted flights and Airport-to-RTM assignment• Goal: ”small” shifts to the flight schedules → decreased number of required RTMs• Measure for shift?
❖ Maximum slot shift Δ (in minutes; multiple of 5, as we shift only by whole slots)❖ Number of shifts S
• MAP = maximum number of airports per module
![Page 29: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/29.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 6
Formal problem definition:
![Page 30: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/30.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 6
Formal problem definition: Flights Rescheduling and Airport-to-Module Assignment (FRAMA)
![Page 31: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/31.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 6
Formal problem definition: Flights Rescheduling and Airport-to-Module Assignment (FRAMA)Given:
![Page 32: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/32.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 6
Formal problem definition: Flights Rescheduling and Airport-to-Module Assignment (FRAMA)Given:• Flight slots in a set of airports (the matrix F)
![Page 33: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/33.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 6
Formal problem definition: Flights Rescheduling and Airport-to-Module Assignment (FRAMA)Given:• Flight slots in a set of airports (the matrix F)• Maximum allowable shift of a flight
![Page 34: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/34.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 6
Formal problem definition: Flights Rescheduling and Airport-to-Module Assignment (FRAMA)Given:• Flight slots in a set of airports (the matrix F)• Maximum allowable shift of a flight• Maximum total number of allowable shifts, S
![Page 35: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/35.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 6
Formal problem definition: Flights Rescheduling and Airport-to-Module Assignment (FRAMA)Given:• Flight slots in a set of airports (the matrix F)• Maximum allowable shift of a flight• Maximum total number of allowable shifts, S• Maximum number of airports per RTM, MAP
![Page 36: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/36.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 6
Formal problem definition: Flights Rescheduling and Airport-to-Module Assignment (FRAMA)Given:• Flight slots in a set of airports (the matrix F)• Maximum allowable shift of a flight• Maximum total number of allowable shifts, S• Maximum number of airports per RTM, MAP• Total number of modules, M
![Page 37: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/37.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 6
Formal problem definition: Flights Rescheduling and Airport-to-Module Assignment (FRAMA)Given:• Flight slots in a set of airports (the matrix F)• Maximum allowable shift of a flight• Maximum total number of allowable shifts, S• Maximum number of airports per RTM, MAP• Total number of modules, MFind: New slots for the flights and an assignment of airports to RTMs such that
![Page 38: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/38.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 6
Formal problem definition: Flights Rescheduling and Airport-to-Module Assignment (FRAMA)Given:• Flight slots in a set of airports (the matrix F)• Maximum allowable shift of a flight• Maximum total number of allowable shifts, S• Maximum number of airports per RTM, MAP• Total number of modules, MFind: New slots for the flights and an assignment of airports to RTMs such that• At most S flights are moved
![Page 39: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/39.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 6
Formal problem definition: Flights Rescheduling and Airport-to-Module Assignment (FRAMA)Given:• Flight slots in a set of airports (the matrix F)• Maximum allowable shift of a flight• Maximum total number of allowable shifts, S• Maximum number of airports per RTM, MAP• Total number of modules, MFind: New slots for the flights and an assignment of airports to RTMs such that• At most S flights are moved• Each flight is moved by at most Δ
![Page 40: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/40.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 6
Formal problem definition: Flights Rescheduling and Airport-to-Module Assignment (FRAMA)Given:• Flight slots in a set of airports (the matrix F)• Maximum allowable shift of a flight• Maximum total number of allowable shifts, S• Maximum number of airports per RTM, MAP• Total number of modules, MFind: New slots for the flights and an assignment of airports to RTMs such that• At most S flights are moved• Each flight is moved by at most Δ• No conflicting airports are assigned to the same RTM
![Page 41: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/41.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 6
Formal problem definition: Flights Rescheduling and Airport-to-Module Assignment (FRAMA)Given:• Flight slots in a set of airports (the matrix F)• Maximum allowable shift of a flight• Maximum total number of allowable shifts, S• Maximum number of airports per RTM, MAP• Total number of modules, MFind: New slots for the flights and an assignment of airports to RTMs such that• At most S flights are moved• Each flight is moved by at most Δ• No conflicting airports are assigned to the same RTM• At most MAP airports are assigned per module
![Page 42: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/42.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 6
Formal problem definition: Flights Rescheduling and Airport-to-Module Assignment (FRAMA)Given:• Flight slots in a set of airports (the matrix F)• Maximum allowable shift of a flight• Maximum total number of allowable shifts, S• Maximum number of airports per RTM, MAP• Total number of modules, MFind: New slots for the flights and an assignment of airports to RTMs such that• At most S flights are moved• Each flight is moved by at most Δ• No conflicting airports are assigned to the same RTM• At most MAP airports are assigned per module• At most M modules are used
![Page 43: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/43.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 6
Formal problem definition: Flights Rescheduling and Airport-to-Module Assignment (FRAMA)Given:• Flight slots in a set of airports (the matrix F)• Maximum allowable shift of a flight• Maximum total number of allowable shifts, S• Maximum number of airports per RTM, MAP• Total number of modules, MFind: New slots for the flights and an assignment of airports to RTMs such that• At most S flights are moved• Each flight is moved by at most Δ• No conflicting airports are assigned to the same RTM• At most MAP airports are assigned per module• At most M modules are used
Decision problem
![Page 44: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/44.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 6
Formal problem definition: Flights Rescheduling and Airport-to-Module Assignment (FRAMA)Given:• Flight slots in a set of airports (the matrix F)• Maximum allowable shift of a flight• Maximum total number of allowable shifts, S• Maximum number of airports per RTM, MAP• Total number of modules, MFind: New slots for the flights and an assignment of airports to RTMs such that• At most S flights are moved• Each flight is moved by at most Δ• No conflicting airports are assigned to the same RTM• At most MAP airports are assigned per module• At most M modules are used
Decision problem
For optimisation problem: Move one constraint in objective function
![Page 45: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/45.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 6
Formal problem definition: Flights Rescheduling and Airport-to-Module Assignment (FRAMA)Given:• Flight slots in a set of airports (the matrix F)• Maximum allowable shift of a flight• Maximum total number of allowable shifts, S• Maximum number of airports per RTM, MAP• Total number of modules, MFind: New slots for the flights and an assignment of airports to RTMs such that• At most S flights are moved• Each flight is moved by at most Δ• No conflicting airports are assigned to the same RTM• At most MAP airports are assigned per module• At most M modules are used
Decision problem
For optimisation problem: Move one constraint in objective functionFor us: Minimize number M of used RTMs, while respecting the bounds Δ, S, MAP
![Page 46: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/46.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 7
Problem Complexity
![Page 47: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/47.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 8
![Page 48: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/48.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 8
Theorem: FRAMA is NP-complete, even if Δ= 0 and MAP=3.
![Page 49: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/49.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 8
Theorem: FRAMA is NP-complete, even if Δ= 0 and MAP=3.Proof: Reduction from Partition into Triangles (PIT)
![Page 50: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/50.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 8
Theorem: FRAMA is NP-complete, even if Δ= 0 and MAP=3.Proof: Reduction from Partition into Triangles (PIT)
• Graph G = (V,E) (of maximum degree four)
![Page 51: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/51.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 8
Theorem: FRAMA is NP-complete, even if Δ= 0 and MAP=3.Proof: Reduction from Partition into Triangles (PIT)
• Graph G = (V,E) (of maximum degree four)• Can V be partitioned into triples V1,V2,…,,V|V|/3, such that each Vi forms a triangle in G
(for each triple of vertices Vi each vertex in Vi is connected to both other vertices in Vi)?
![Page 52: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/52.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 8
Theorem: FRAMA is NP-complete, even if Δ= 0 and MAP=3.Proof: Reduction from Partition into Triangles (PIT)
• Graph G = (V,E) (of maximum degree four)• Can V be partitioned into triples V1,V2,…,,V|V|/3, such that each Vi forms a triangle in G
(for each triple of vertices Vi each vertex in Vi is connected to both other vertices in Vi)?Given an instance of PIT (graph G = (V,E) with max degree four) we construct the matrix F, the input of FRAMA:
![Page 53: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/53.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 8
Theorem: FRAMA is NP-complete, even if Δ= 0 and MAP=3.Proof: Reduction from Partition into Triangles (PIT)
• Graph G = (V,E) (of maximum degree four)• Can V be partitioned into triples V1,V2,…,,V|V|/3, such that each Vi forms a triangle in G
(for each triple of vertices Vi each vertex in Vi is connected to both other vertices in Vi)?Given an instance of PIT (graph G = (V,E) with max degree four) we construct the matrix F, the input of FRAMA:• One airport per vertex → F has |V| rows
![Page 54: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/54.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 8
Theorem: FRAMA is NP-complete, even if Δ= 0 and MAP=3.Proof: Reduction from Partition into Triangles (PIT)
• Graph G = (V,E) (of maximum degree four)• Can V be partitioned into triples V1,V2,…,,V|V|/3, such that each Vi forms a triangle in G
(for each triple of vertices Vi each vertex in Vi is connected to both other vertices in Vi)?Given an instance of PIT (graph G = (V,E) with max degree four) we construct the matrix F, the input of FRAMA:• One airport per vertex → F has |V| rows• Time slot per non-existing edge in G (that is per edge in the G’s complement)
![Page 55: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/55.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 8
Theorem: FRAMA is NP-complete, even if Δ= 0 and MAP=3.Proof: Reduction from Partition into Triangles (PIT)
• Graph G = (V,E) (of maximum degree four)• Can V be partitioned into triples V1,V2,…,,V|V|/3, such that each Vi forms a triangle in G
(for each triple of vertices Vi each vertex in Vi is connected to both other vertices in Vi)?Given an instance of PIT (graph G = (V,E) with max degree four) we construct the matrix F, the input of FRAMA:• One airport per vertex → F has |V| rows• Time slot per non-existing edge in G (that is per edge in the G’s complement) Gc=(V,Ec) complete graph on V
![Page 56: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/56.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 8
Theorem: FRAMA is NP-complete, even if Δ= 0 and MAP=3.Proof: Reduction from Partition into Triangles (PIT)
• Graph G = (V,E) (of maximum degree four)• Can V be partitioned into triples V1,V2,…,,V|V|/3, such that each Vi forms a triangle in G
(for each triple of vertices Vi each vertex in Vi is connected to both other vertices in Vi)?Given an instance of PIT (graph G = (V,E) with max degree four) we construct the matrix F, the input of FRAMA:• One airport per vertex → F has |V| rows• Time slot per non-existing edge in G (that is per edge in the G’s complement) Gc=(V,Ec) complete graph on V → |Ec\E| time slots
![Page 57: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/57.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 8
Theorem: FRAMA is NP-complete, even if Δ= 0 and MAP=3.Proof: Reduction from Partition into Triangles (PIT)
• Graph G = (V,E) (of maximum degree four)• Can V be partitioned into triples V1,V2,…,,V|V|/3, such that each Vi forms a triangle in G
(for each triple of vertices Vi each vertex in Vi is connected to both other vertices in Vi)?Given an instance of PIT (graph G = (V,E) with max degree four) we construct the matrix F, the input of FRAMA:• One airport per vertex → F has |V| rows• Time slot per non-existing edge in G (that is per edge in the G’s complement) Gc=(V,Ec) complete graph on V → |Ec\E| time slots • For time slot corresponding to ec={v,w}∈ Ec\E we add two 1’s to the time slot column: to
the airports of v and w, all other entries in that column are 0’s.
![Page 58: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/58.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 8
Theorem: FRAMA is NP-complete, even if Δ= 0 and MAP=3.Proof: Reduction from Partition into Triangles (PIT)
• Graph G = (V,E) (of maximum degree four)• Can V be partitioned into triples V1,V2,…,,V|V|/3, such that each Vi forms a triangle in G
(for each triple of vertices Vi each vertex in Vi is connected to both other vertices in Vi)?Given an instance of PIT (graph G = (V,E) with max degree four) we construct the matrix F, the input of FRAMA:• One airport per vertex → F has |V| rows• Time slot per non-existing edge in G (that is per edge in the G’s complement) Gc=(V,Ec) complete graph on V → |Ec\E| time slots • For time slot corresponding to ec={v,w}∈ Ec\E we add two 1’s to the time slot column: to
the airports of v and w, all other entries in that column are 0’s. Any solution to FRAMA with Δ=0 and MAP=3 groups the airports (vertices) into triples, such that there are no conflicts between any of the three airports in a triple, that is, such that there is an edge between any of the three vertices in the triple.
![Page 59: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/59.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 8
Theorem: FRAMA is NP-complete, even if Δ= 0 and MAP=3.Proof: Reduction from Partition into Triangles (PIT)
• Graph G = (V,E) (of maximum degree four)• Can V be partitioned into triples V1,V2,…,,V|V|/3, such that each Vi forms a triangle in G
(for each triple of vertices Vi each vertex in Vi is connected to both other vertices in Vi)?Given an instance of PIT (graph G = (V,E) with max degree four) we construct the matrix F, the input of FRAMA:• One airport per vertex → F has |V| rows• Time slot per non-existing edge in G (that is per edge in the G’s complement) Gc=(V,Ec) complete graph on V → |Ec\E| time slots • For time slot corresponding to ec={v,w}∈ Ec\E we add two 1’s to the time slot column: to
the airports of v and w, all other entries in that column are 0’s. Any solution to FRAMA with Δ=0 and MAP=3 groups the airports (vertices) into triples, such that there are no conflicts between any of the three airports in a triple, that is, such that there is an edge between any of the three vertices in the triple.
![Page 60: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/60.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 8
Theorem: FRAMA is NP-complete, even if Δ= 0 and MAP=3.Proof: Reduction from Partition into Triangles (PIT)
• Graph G = (V,E) (of maximum degree four)• Can V be partitioned into triples V1,V2,…,,V|V|/3, such that each Vi forms a triangle in G
(for each triple of vertices Vi each vertex in Vi is connected to both other vertices in Vi)?Given an instance of PIT (graph G = (V,E) with max degree four) we construct the matrix F, the input of FRAMA:• One airport per vertex → F has |V| rows• Time slot per non-existing edge in G (that is per edge in the G’s complement) Gc=(V,Ec) complete graph on V → |Ec\E| time slots • For time slot corresponding to ec={v,w}∈ Ec\E we add two 1’s to the time slot column: to
the airports of v and w, all other entries in that column are 0’s. Any solution to FRAMA with Δ=0 and MAP=3 groups the airports (vertices) into triples, such that there are no conflicts between any of the three airports in a triple, that is, such that there is an edge between any of the three vertices in the triple.
![Page 61: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/61.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 8
Theorem: FRAMA is NP-complete, even if Δ= 0 and MAP=3.Proof: Reduction from Partition into Triangles (PIT)
• Graph G = (V,E) (of maximum degree four)• Can V be partitioned into triples V1,V2,…,,V|V|/3, such that each Vi forms a triangle in G
(for each triple of vertices Vi each vertex in Vi is connected to both other vertices in Vi)?Given an instance of PIT (graph G = (V,E) with max degree four) we construct the matrix F, the input of FRAMA:• One airport per vertex → F has |V| rows• Time slot per non-existing edge in G (that is per edge in the G’s complement) Gc=(V,Ec) complete graph on V → |Ec\E| time slots • For time slot corresponding to ec={v,w}∈ Ec\E we add two 1’s to the time slot column: to
the airports of v and w, all other entries in that column are 0’s. Any solution to FRAMA with Δ=0 and MAP=3 groups the airports (vertices) into triples, such that there are no conflicts between any of the three airports in a triple, that is, such that there is an edge between any of the three vertices in the triple. ➡ We would obtain a solution to PIT
![Page 62: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/62.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 8
Theorem: FRAMA is NP-complete, even if Δ= 0 and MAP=3.Proof: Reduction from Partition into Triangles (PIT)
• Graph G = (V,E) (of maximum degree four)• Can V be partitioned into triples V1,V2,…,,V|V|/3, such that each Vi forms a triangle in G
(for each triple of vertices Vi each vertex in Vi is connected to both other vertices in Vi)?Given an instance of PIT (graph G = (V,E) with max degree four) we construct the matrix F, the input of FRAMA:• One airport per vertex → F has |V| rows• Time slot per non-existing edge in G (that is per edge in the G’s complement) Gc=(V,Ec) complete graph on V → |Ec\E| time slots • For time slot corresponding to ec={v,w}∈ Ec\E we add two 1’s to the time slot column: to
the airports of v and w, all other entries in that column are 0’s. Any solution to FRAMA with Δ=0 and MAP=3 groups the airports (vertices) into triples, such that there are no conflicts between any of the three airports in a triple, that is, such that there is an edge between any of the three vertices in the triple. ➡ We would obtain a solution to PIT
Solution to FRAMA with Δ=0 (and, thus, S= 0) and MAP= 3 can be verified in polytime.
![Page 63: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/63.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 9
Theorem: For Δ= 0 and MAP=2 Minimizing the number of modules is equivalent to finding a maximum matching in the airport conflict graph (vertex for every airport and an edge between two airports if they can be put into the same module).
![Page 64: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/64.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 9
Theorem: For Δ= 0 and MAP=2 Minimizing the number of modules is equivalent to finding a maximum matching in the airport conflict graph (vertex for every airport and an edge between two airports if they can be put into the same module).
Maximum matching can be found in polynomial time.
![Page 65: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/65.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 9
Theorem: For Δ= 0 and MAP=2 Minimizing the number of modules is equivalent to finding a maximum matching in the airport conflict graph (vertex for every airport and an edge between two airports if they can be put into the same module).
Maximum matching can be found in polynomial time.
![Page 66: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/66.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 9
Theorem: For Δ= 0 and MAP=2 Minimizing the number of modules is equivalent to finding a maximum matching in the airport conflict graph (vertex for every airport and an edge between two airports if they can be put into the same module).
Maximum matching can be found in polynomial time.
No edge, as AP1 and AP2 are in conflict
![Page 67: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/67.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 9
Theorem: For Δ= 0 and MAP=2 Minimizing the number of modules is equivalent to finding a maximum matching in the airport conflict graph (vertex for every airport and an edge between two airports if they can be put into the same module).
Maximum matching can be found in polynomial time.
No edge, as AP1 and AP2 are in conflict
![Page 68: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/68.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 9
Theorem: For Δ= 0 and MAP=2 Minimizing the number of modules is equivalent to finding a maximum matching in the airport conflict graph (vertex for every airport and an edge between two airports if they can be put into the same module).
Maximum matching can be found in polynomial time.
No edge, as AP1 and AP2 are in conflict
module 1
![Page 69: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/69.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 9
Theorem: For Δ= 0 and MAP=2 Minimizing the number of modules is equivalent to finding a maximum matching in the airport conflict graph (vertex for every airport and an edge between two airports if they can be put into the same module).
Maximum matching can be found in polynomial time.
No edge, as AP1 and AP2 are in conflict
module 1
module 2
![Page 70: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/70.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 9
Theorem: For Δ= 0 and MAP=2 Minimizing the number of modules is equivalent to finding a maximum matching in the airport conflict graph (vertex for every airport and an edge between two airports if they can be put into the same module).
Maximum matching can be found in polynomial time.
No edge, as AP1 and AP2 are in conflict
module 1
module 2
module 3
![Page 71: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/71.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 10
![Page 72: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/72.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 10
Complexity for Δ> 0 and MAP=2 unknown.
![Page 73: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/73.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 10
Complexity for Δ> 0 and MAP=2 unknown.Possible heuristic:
![Page 74: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/74.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 10
Complexity for Δ> 0 and MAP=2 unknown.Possible heuristic:• First remove all conflicts
![Page 75: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/75.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 10
Complexity for Δ> 0 and MAP=2 unknown.Possible heuristic:• First remove all conflicts • Then assign airports to RTMs
![Page 76: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/76.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 10
Complexity for Δ> 0 and MAP=2 unknown.Possible heuristic:• First remove all conflicts • Then assign airports to RTMs➡ Solve rescheduling and assignment problem separately
Assignment problem is trivial in the absence of conflicts (the airports are arbitrarily packed into the RTMs, with MAP airports per module)
![Page 77: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/77.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 10
Complexity for Δ> 0 and MAP=2 unknown.Possible heuristic:• First remove all conflicts • Then assign airports to RTMs➡ Solve rescheduling and assignment problem separately
Assignment problem is trivial in the absence of conflicts (the airports are arbitrarily packed into the RTMs, with MAP airports per module)➡ How to deconflict flight schedule?
![Page 78: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/78.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 10
Complexity for Δ> 0 and MAP=2 unknown.Possible heuristic:• First remove all conflicts • Then assign airports to RTMs➡ Solve rescheduling and assignment problem separately
Assignment problem is trivial in the absence of conflicts (the airports are arbitrarily packed into the RTMs, with MAP airports per module)➡ How to deconflict flight schedule?We can reduce deconfliction problem to matching:
![Page 79: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/79.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 10
Complexity for Δ> 0 and MAP=2 unknown.Possible heuristic:• First remove all conflicts • Then assign airports to RTMs➡ Solve rescheduling and assignment problem separately
Assignment problem is trivial in the absence of conflicts (the airports are arbitrarily packed into the RTMs, with MAP airports per module)➡ How to deconflict flight schedule?We can reduce deconfliction problem to matching:• Bipartite graph: all flights in one part and all slots in the other part
![Page 80: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/80.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 10
Complexity for Δ> 0 and MAP=2 unknown.Possible heuristic:• First remove all conflicts • Then assign airports to RTMs➡ Solve rescheduling and assignment problem separately
Assignment problem is trivial in the absence of conflicts (the airports are arbitrarily packed into the RTMs, with MAP airports per module)➡ How to deconflict flight schedule?We can reduce deconfliction problem to matching:• Bipartite graph: all flights in one part and all slots in the other part • Flight f is connected to all slots within distance Δ/5 from its original slot
![Page 81: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/81.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 10
Complexity for Δ> 0 and MAP=2 unknown.Possible heuristic:• First remove all conflicts • Then assign airports to RTMs➡ Solve rescheduling and assignment problem separately
Assignment problem is trivial in the absence of conflicts (the airports are arbitrarily packed into the RTMs, with MAP airports per module)➡ How to deconflict flight schedule?We can reduce deconfliction problem to matching:• Bipartite graph: all flights in one part and all slots in the other part • Flight f is connected to all slots within distance Δ/5 from its original slot• Edge weight:
![Page 82: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/82.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 10
Complexity for Δ> 0 and MAP=2 unknown.Possible heuristic:• First remove all conflicts • Then assign airports to RTMs➡ Solve rescheduling and assignment problem separately
Assignment problem is trivial in the absence of conflicts (the airports are arbitrarily packed into the RTMs, with MAP airports per module)➡ How to deconflict flight schedule?We can reduce deconfliction problem to matching:• Bipartite graph: all flights in one part and all slots in the other part • Flight f is connected to all slots within distance Δ/5 from its original slot• Edge weight:
- 0, for edge between flight f and its original slot (black edges)
![Page 83: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/83.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 10
Complexity for Δ> 0 and MAP=2 unknown.Possible heuristic:• First remove all conflicts • Then assign airports to RTMs➡ Solve rescheduling and assignment problem separately
Assignment problem is trivial in the absence of conflicts (the airports are arbitrarily packed into the RTMs, with MAP airports per module)➡ How to deconflict flight schedule?We can reduce deconfliction problem to matching:• Bipartite graph: all flights in one part and all slots in the other part • Flight f is connected to all slots within distance Δ/5 from its original slot• Edge weight:
- 0, for edge between flight f and its original slot (black edges)- 1, otherwise (gray edges)
![Page 84: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/84.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 10
Complexity for Δ> 0 and MAP=2 unknown.Possible heuristic:• First remove all conflicts • Then assign airports to RTMs➡ Solve rescheduling and assignment problem separately
Assignment problem is trivial in the absence of conflicts (the airports are arbitrarily packed into the RTMs, with MAP airports per module)➡ How to deconflict flight schedule?We can reduce deconfliction problem to matching:• Bipartite graph: all flights in one part and all slots in the other part • Flight f is connected to all slots within distance Δ/5 from its original slot• Edge weight:
- 0, for edge between flight f and its original slot (black edges)- 1, otherwise (gray edges)
• Find the minimum-weight matching in the graph that matches all flights
![Page 85: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/85.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 10
Complexity for Δ> 0 and MAP=2 unknown.Possible heuristic:• First remove all conflicts • Then assign airports to RTMs➡ Solve rescheduling and assignment problem separately
Assignment problem is trivial in the absence of conflicts (the airports are arbitrarily packed into the RTMs, with MAP airports per module)➡ How to deconflict flight schedule?We can reduce deconfliction problem to matching:• Bipartite graph: all flights in one part and all slots in the other part • Flight f is connected to all slots within distance Δ/5 from its original slot• Edge weight:
- 0, for edge between flight f and its original slot (black edges)- 1, otherwise (gray edges)
• Find the minimum-weight matching in the graph that matches all flights • If no such matching exists, Δ must be increased
![Page 86: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/86.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 10
Complexity for Δ> 0 and MAP=2 unknown.Possible heuristic:• First remove all conflicts • Then assign airports to RTMs➡ Solve rescheduling and assignment problem separately
Assignment problem is trivial in the absence of conflicts (the airports are arbitrarily packed into the RTMs, with MAP airports per module)➡ How to deconflict flight schedule?We can reduce deconfliction problem to matching:• Bipartite graph: all flights in one part and all slots in the other part • Flight f is connected to all slots within distance Δ/5 from its original slot• Edge weight:
- 0, for edge between flight f and its original slot (black edges)- 1, otherwise (gray edges)
• Find the minimum-weight matching in the graph that matches all flights • If no such matching exists, Δ must be increased • We can also minimize the total amount of shifted minutes: set the weight
of each edge equal to the length of the shift
![Page 87: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/87.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 10
Complexity for Δ> 0 and MAP=2 unknown.Possible heuristic:• First remove all conflicts • Then assign airports to RTMs➡ Solve rescheduling and assignment problem separately
Assignment problem is trivial in the absence of conflicts (the airports are arbitrarily packed into the RTMs, with MAP airports per module)➡ How to deconflict flight schedule?We can reduce deconfliction problem to matching:• Bipartite graph: all flights in one part and all slots in the other part • Flight f is connected to all slots within distance Δ/5 from its original slot• Edge weight:
- 0, for edge between flight f and its original slot (black edges)- 1, otherwise (gray edges)
• Find the minimum-weight matching in the graph that matches all flights • If no such matching exists, Δ must be increased • We can also minimize the total amount of shifted minutes: set the weight
of each edge equal to the length of the shiftRuns in polynomial time, but may find suboptimal solutions to FRAMA (not necessary to remove all the conflicts)
![Page 88: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/88.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 10
Complexity for Δ> 0 and MAP=2 unknown.Possible heuristic:• First remove all conflicts • Then assign airports to RTMs➡ Solve rescheduling and assignment problem separately
Assignment problem is trivial in the absence of conflicts (the airports are arbitrarily packed into the RTMs, with MAP airports per module)➡ How to deconflict flight schedule?We can reduce deconfliction problem to matching:• Bipartite graph: all flights in one part and all slots in the other part • Flight f is connected to all slots within distance Δ/5 from its original slot• Edge weight:
- 0, for edge between flight f and its original slot (black edges)- 1, otherwise (gray edges)
• Find the minimum-weight matching in the graph that matches all flights • If no such matching exists, Δ must be increased • We can also minimize the total amount of shifted minutes: set the weight
of each edge equal to the length of the shiftRuns in polynomial time, but may find suboptimal solutions to FRAMA (not necessary to remove all the conflicts)For a small number of airports: enumerate all pairs of airports
![Page 89: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/89.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 10
Complexity for Δ> 0 and MAP=2 unknown.Possible heuristic:• First remove all conflicts • Then assign airports to RTMs➡ Solve rescheduling and assignment problem separately
Assignment problem is trivial in the absence of conflicts (the airports are arbitrarily packed into the RTMs, with MAP airports per module)➡ How to deconflict flight schedule?We can reduce deconfliction problem to matching:• Bipartite graph: all flights in one part and all slots in the other part • Flight f is connected to all slots within distance Δ/5 from its original slot• Edge weight:
- 0, for edge between flight f and its original slot (black edges)- 1, otherwise (gray edges)
• Find the minimum-weight matching in the graph that matches all flights • If no such matching exists, Δ must be increased • We can also minimize the total amount of shifted minutes: set the weight
of each edge equal to the length of the shiftRuns in polynomial time, but may find suboptimal solutions to FRAMA (not necessary to remove all the conflicts)For a small number of airports: enumerate all pairs of airportscompletely eliminate all conflicts for the given pairs (matching) with a given Δ > 0
![Page 90: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/90.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 10
Complexity for Δ> 0 and MAP=2 unknown.Possible heuristic:• First remove all conflicts • Then assign airports to RTMs➡ Solve rescheduling and assignment problem separately
Assignment problem is trivial in the absence of conflicts (the airports are arbitrarily packed into the RTMs, with MAP airports per module)➡ How to deconflict flight schedule?We can reduce deconfliction problem to matching:• Bipartite graph: all flights in one part and all slots in the other part • Flight f is connected to all slots within distance Δ/5 from its original slot• Edge weight:
- 0, for edge between flight f and its original slot (black edges)- 1, otherwise (gray edges)
• Find the minimum-weight matching in the graph that matches all flights • If no such matching exists, Δ must be increased • We can also minimize the total amount of shifted minutes: set the weight
of each edge equal to the length of the shiftRuns in polynomial time, but may find suboptimal solutions to FRAMA (not necessary to remove all the conflicts)For a small number of airports: enumerate all pairs of airportscompletely eliminate all conflicts for the given pairs (matching) with a given Δ > 0chose combination with minimum possible number of modules
![Page 91: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/91.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 11
IP for FRAMA
![Page 92: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/92.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 12
Decision variables xam: airport a assigned to module m zm: module m is used yatf: flight f arrives/departs at/from airport a in time slot t wab: conflict between airport a and airport b (some t)
A = set of airports M = set of modules T = set of time slots Va= flights at airport a patf = cost to move flight f at airport a to time slot t saf = scheduled time for flight f at airport a i 𝛿 maximum shift distance for scheduled aircraft in terms of time slots: 𝛿 = Δ/ 5.
![Page 93: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/93.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 12
Decision variables xam: airport a assigned to module m zm: module m is used yatf: flight f arrives/departs at/from airport a in time slot t wab: conflict between airport a and airport b (some t)
A = set of airports M = set of modules T = set of time slots Va= flights at airport a patf = cost to move flight f at airport a to time slot t saf = scheduled time for flight f at airport a i 𝛿 maximum shift distance for scheduled aircraft in terms of time slots: 𝛿 = Δ/ 5.
min # shifts: patf=1 if t≠saf; patf=0 if t=saf min total amount of shifts: patf=|t-saf|
![Page 94: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/94.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 12
min c1
X
m2M
zm + c
2
X
a2A
X
t2T
X
f2Va
patfyatf (1)
s.t. xam 6 zm 8(a,m) 2 A⇥M (2)X
m2M
xam = 1 8a 2 A (3)
X
f2Va
yatf 6 1 8(a, t) 2 A⇥ T (4)
min(|T |,saf+�)X
t=max(1,saf��)
yatf = 1 8(a, f) 2 A⇥ Va (5)
X
f2Va
yatf +X
f2Vb
ybtf6 1 + wab8(a, b, t) 2 A⇥A⇥ T, a < b (6)
xam + xbm 6 2� wab8(a, b,m) 2 A⇥A⇥M,a < b (7)X
a2A
xam 6 MAP 8m 2 M (8)
x, y, w, z binary (9)
Decision variables xam: airport a assigned to module m zm: module m is used yatf: flight f arrives/departs at/from airport a in time slot t wab: conflict between airport a and airport b (some t)
A = set of airports M = set of modules T = set of time slots Va= flights at airport a patf = cost to move flight f at airport a to time slot t saf = scheduled time for flight f at airport a i 𝛿 maximum shift distance for scheduled aircraft in terms of time slots: 𝛿 = Δ/ 5.
min # shifts: patf=1 if t≠saf; patf=0 if t=saf min total amount of shifts: patf=|t-saf|
![Page 95: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/95.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 12
min c1
X
m2M
zm + c
2
X
a2A
X
t2T
X
f2Va
patfyatf (1)
s.t. xam 6 zm 8(a,m) 2 A⇥M (2)X
m2M
xam = 1 8a 2 A (3)
X
f2Va
yatf 6 1 8(a, t) 2 A⇥ T (4)
min(|T |,saf+�)X
t=max(1,saf��)
yatf = 1 8(a, f) 2 A⇥ Va (5)
X
f2Va
yatf +X
f2Vb
ybtf6 1 + wab8(a, b, t) 2 A⇥A⇥ T, a < b (6)
xam + xbm 6 2� wab8(a, b,m) 2 A⇥A⇥M,a < b (7)X
a2A
xam 6 MAP 8m 2 M (8)
x, y, w, z binary (9)
Decision variables xam: airport a assigned to module m zm: module m is used yatf: flight f arrives/departs at/from airport a in time slot t wab: conflict between airport a and airport b (some t)
A = set of airports M = set of modules T = set of time slots Va= flights at airport a patf = cost to move flight f at airport a to time slot t saf = scheduled time for flight f at airport a i 𝛿 maximum shift distance for scheduled aircraft in terms of time slots: 𝛿 = Δ/ 5.
c1*#modules + c2* sum of shifts
min # shifts: patf=1 if t≠saf; patf=0 if t=saf min total amount of shifts: patf=|t-saf|
![Page 96: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/96.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 12
min c1
X
m2M
zm + c
2
X
a2A
X
t2T
X
f2Va
patfyatf (1)
s.t. xam 6 zm 8(a,m) 2 A⇥M (2)X
m2M
xam = 1 8a 2 A (3)
X
f2Va
yatf 6 1 8(a, t) 2 A⇥ T (4)
min(|T |,saf+�)X
t=max(1,saf��)
yatf = 1 8(a, f) 2 A⇥ Va (5)
X
f2Va
yatf +X
f2Vb
ybtf6 1 + wab8(a, b, t) 2 A⇥A⇥ T, a < b (6)
xam + xbm 6 2� wab8(a, b,m) 2 A⇥A⇥M,a < b (7)X
a2A
xam 6 MAP 8m 2 M (8)
x, y, w, z binary (9)
Decision variables xam: airport a assigned to module m zm: module m is used yatf: flight f arrives/departs at/from airport a in time slot t wab: conflict between airport a and airport b (some t)
A = set of airports M = set of modules T = set of time slots Va= flights at airport a patf = cost to move flight f at airport a to time slot t saf = scheduled time for flight f at airport a i 𝛿 maximum shift distance for scheduled aircraft in terms of time slots: 𝛿 = Δ/ 5.
c1*#modules + c2* sum of shifts
Some airport assigned to module m
min # shifts: patf=1 if t≠saf; patf=0 if t=saf min total amount of shifts: patf=|t-saf|
![Page 97: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/97.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 12
min c1
X
m2M
zm + c
2
X
a2A
X
t2T
X
f2Va
patfyatf (1)
s.t. xam 6 zm 8(a,m) 2 A⇥M (2)X
m2M
xam = 1 8a 2 A (3)
X
f2Va
yatf 6 1 8(a, t) 2 A⇥ T (4)
min(|T |,saf+�)X
t=max(1,saf��)
yatf = 1 8(a, f) 2 A⇥ Va (5)
X
f2Va
yatf +X
f2Vb
ybtf6 1 + wab8(a, b, t) 2 A⇥A⇥ T, a < b (6)
xam + xbm 6 2� wab8(a, b,m) 2 A⇥A⇥M,a < b (7)X
a2A
xam 6 MAP 8m 2 M (8)
x, y, w, z binary (9)
Decision variables xam: airport a assigned to module m zm: module m is used yatf: flight f arrives/departs at/from airport a in time slot t wab: conflict between airport a and airport b (some t)
A = set of airports M = set of modules T = set of time slots Va= flights at airport a patf = cost to move flight f at airport a to time slot t saf = scheduled time for flight f at airport a i 𝛿 maximum shift distance for scheduled aircraft in terms of time slots: 𝛿 = Δ/ 5.
c1*#modules + c2* sum of shifts
Some airport assigned to module m→module m used
min # shifts: patf=1 if t≠saf; patf=0 if t=saf min total amount of shifts: patf=|t-saf|
![Page 98: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/98.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 12
min c1
X
m2M
zm + c
2
X
a2A
X
t2T
X
f2Va
patfyatf (1)
s.t. xam 6 zm 8(a,m) 2 A⇥M (2)X
m2M
xam = 1 8a 2 A (3)
X
f2Va
yatf 6 1 8(a, t) 2 A⇥ T (4)
min(|T |,saf+�)X
t=max(1,saf��)
yatf = 1 8(a, f) 2 A⇥ Va (5)
X
f2Va
yatf +X
f2Vb
ybtf6 1 + wab8(a, b, t) 2 A⇥A⇥ T, a < b (6)
xam + xbm 6 2� wab8(a, b,m) 2 A⇥A⇥M,a < b (7)X
a2A
xam 6 MAP 8m 2 M (8)
x, y, w, z binary (9)
Decision variables xam: airport a assigned to module m zm: module m is used yatf: flight f arrives/departs at/from airport a in time slot t wab: conflict between airport a and airport b (some t)
A = set of airports M = set of modules T = set of time slots Va= flights at airport a patf = cost to move flight f at airport a to time slot t saf = scheduled time for flight f at airport a i 𝛿 maximum shift distance for scheduled aircraft in terms of time slots: 𝛿 = Δ/ 5.
c1*#modules + c2* sum of shifts
Some airport assigned to module m→module m usedEach airport assigned to 1 module
min # shifts: patf=1 if t≠saf; patf=0 if t=saf min total amount of shifts: patf=|t-saf|
![Page 99: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/99.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 12
min c1
X
m2M
zm + c
2
X
a2A
X
t2T
X
f2Va
patfyatf (1)
s.t. xam 6 zm 8(a,m) 2 A⇥M (2)X
m2M
xam = 1 8a 2 A (3)
X
f2Va
yatf 6 1 8(a, t) 2 A⇥ T (4)
min(|T |,saf+�)X
t=max(1,saf��)
yatf = 1 8(a, f) 2 A⇥ Va (5)
X
f2Va
yatf +X
f2Vb
ybtf6 1 + wab8(a, b, t) 2 A⇥A⇥ T, a < b (6)
xam + xbm 6 2� wab8(a, b,m) 2 A⇥A⇥M,a < b (7)X
a2A
xam 6 MAP 8m 2 M (8)
x, y, w, z binary (9)
Decision variables xam: airport a assigned to module m zm: module m is used yatf: flight f arrives/departs at/from airport a in time slot t wab: conflict between airport a and airport b (some t)
A = set of airports M = set of modules T = set of time slots Va= flights at airport a patf = cost to move flight f at airport a to time slot t saf = scheduled time for flight f at airport a i 𝛿 maximum shift distance for scheduled aircraft in terms of time slots: 𝛿 = Δ/ 5.
c1*#modules + c2* sum of shifts
Some airport assigned to module m→module m usedEach airport assigned to 1 moduleAt most 1 flight arrives/departs at airport time slot t
min # shifts: patf=1 if t≠saf; patf=0 if t=saf min total amount of shifts: patf=|t-saf|
![Page 100: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/100.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 12
min c1
X
m2M
zm + c
2
X
a2A
X
t2T
X
f2Va
patfyatf (1)
s.t. xam 6 zm 8(a,m) 2 A⇥M (2)X
m2M
xam = 1 8a 2 A (3)
X
f2Va
yatf 6 1 8(a, t) 2 A⇥ T (4)
min(|T |,saf+�)X
t=max(1,saf��)
yatf = 1 8(a, f) 2 A⇥ Va (5)
X
f2Va
yatf +X
f2Vb
ybtf6 1 + wab8(a, b, t) 2 A⇥A⇥ T, a < b (6)
xam + xbm 6 2� wab8(a, b,m) 2 A⇥A⇥M,a < b (7)X
a2A
xam 6 MAP 8m 2 M (8)
x, y, w, z binary (9)
Decision variables xam: airport a assigned to module m zm: module m is used yatf: flight f arrives/departs at/from airport a in time slot t wab: conflict between airport a and airport b (some t)
A = set of airports M = set of modules T = set of time slots Va= flights at airport a patf = cost to move flight f at airport a to time slot t saf = scheduled time for flight f at airport a i 𝛿 maximum shift distance for scheduled aircraft in terms of time slots: 𝛿 = Δ/ 5.
c1*#modules + c2* sum of shifts
Some airport assigned to module m→module m usedEach airport assigned to 1 moduleAt most 1 flight arrives/departs at airport time slot t
Each flight ±𝛿 from scheduled time
min # shifts: patf=1 if t≠saf; patf=0 if t=saf min total amount of shifts: patf=|t-saf|
![Page 101: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/101.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 12
min c1
X
m2M
zm + c
2
X
a2A
X
t2T
X
f2Va
patfyatf (1)
s.t. xam 6 zm 8(a,m) 2 A⇥M (2)X
m2M
xam = 1 8a 2 A (3)
X
f2Va
yatf 6 1 8(a, t) 2 A⇥ T (4)
min(|T |,saf+�)X
t=max(1,saf��)
yatf = 1 8(a, f) 2 A⇥ Va (5)
X
f2Va
yatf +X
f2Vb
ybtf6 1 + wab8(a, b, t) 2 A⇥A⇥ T, a < b (6)
xam + xbm 6 2� wab8(a, b,m) 2 A⇥A⇥M,a < b (7)X
a2A
xam 6 MAP 8m 2 M (8)
x, y, w, z binary (9)
Decision variables xam: airport a assigned to module m zm: module m is used yatf: flight f arrives/departs at/from airport a in time slot t wab: conflict between airport a and airport b (some t)
A = set of airports M = set of modules T = set of time slots Va= flights at airport a patf = cost to move flight f at airport a to time slot t saf = scheduled time for flight f at airport a i 𝛿 maximum shift distance for scheduled aircraft in terms of time slots: 𝛿 = Δ/ 5.
c1*#modules + c2* sum of shifts
Some airport assigned to module m→module m usedEach airport assigned to 1 moduleAt most 1 flight arrives/departs at airport time slot t
Each flight ±𝛿 from scheduled time
Two a/c at same slot at airports a and b
min # shifts: patf=1 if t≠saf; patf=0 if t=saf min total amount of shifts: patf=|t-saf|
![Page 102: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/102.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 12
min c1
X
m2M
zm + c
2
X
a2A
X
t2T
X
f2Va
patfyatf (1)
s.t. xam 6 zm 8(a,m) 2 A⇥M (2)X
m2M
xam = 1 8a 2 A (3)
X
f2Va
yatf 6 1 8(a, t) 2 A⇥ T (4)
min(|T |,saf+�)X
t=max(1,saf��)
yatf = 1 8(a, f) 2 A⇥ Va (5)
X
f2Va
yatf +X
f2Vb
ybtf6 1 + wab8(a, b, t) 2 A⇥A⇥ T, a < b (6)
xam + xbm 6 2� wab8(a, b,m) 2 A⇥A⇥M,a < b (7)X
a2A
xam 6 MAP 8m 2 M (8)
x, y, w, z binary (9)
Decision variables xam: airport a assigned to module m zm: module m is used yatf: flight f arrives/departs at/from airport a in time slot t wab: conflict between airport a and airport b (some t)
A = set of airports M = set of modules T = set of time slots Va= flights at airport a patf = cost to move flight f at airport a to time slot t saf = scheduled time for flight f at airport a i 𝛿 maximum shift distance for scheduled aircraft in terms of time slots: 𝛿 = Δ/ 5.
c1*#modules + c2* sum of shifts
Some airport assigned to module m→module m usedEach airport assigned to 1 moduleAt most 1 flight arrives/departs at airport time slot t
Each flight ±𝛿 from scheduled time
Two a/c at same slot at airports a and b→ two airports in conflict
min # shifts: patf=1 if t≠saf; patf=0 if t=saf min total amount of shifts: patf=|t-saf|
![Page 103: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/103.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 12
min c1
X
m2M
zm + c
2
X
a2A
X
t2T
X
f2Va
patfyatf (1)
s.t. xam 6 zm 8(a,m) 2 A⇥M (2)X
m2M
xam = 1 8a 2 A (3)
X
f2Va
yatf 6 1 8(a, t) 2 A⇥ T (4)
min(|T |,saf+�)X
t=max(1,saf��)
yatf = 1 8(a, f) 2 A⇥ Va (5)
X
f2Va
yatf +X
f2Vb
ybtf6 1 + wab8(a, b, t) 2 A⇥A⇥ T, a < b (6)
xam + xbm 6 2� wab8(a, b,m) 2 A⇥A⇥M,a < b (7)X
a2A
xam 6 MAP 8m 2 M (8)
x, y, w, z binary (9)
Decision variables xam: airport a assigned to module m zm: module m is used yatf: flight f arrives/departs at/from airport a in time slot t wab: conflict between airport a and airport b (some t)
A = set of airports M = set of modules T = set of time slots Va= flights at airport a patf = cost to move flight f at airport a to time slot t saf = scheduled time for flight f at airport a i 𝛿 maximum shift distance for scheduled aircraft in terms of time slots: 𝛿 = Δ/ 5.
c1*#modules + c2* sum of shifts
Some airport assigned to module m→module m usedEach airport assigned to 1 moduleAt most 1 flight arrives/departs at airport time slot t
Each flight ±𝛿 from scheduled time
Two a/c at same slot at airports a and b→ two airports in conflictIf ∃ conflict → airports not same module
min # shifts: patf=1 if t≠saf; patf=0 if t=saf min total amount of shifts: patf=|t-saf|
![Page 104: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/104.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 12
min c1
X
m2M
zm + c
2
X
a2A
X
t2T
X
f2Va
patfyatf (1)
s.t. xam 6 zm 8(a,m) 2 A⇥M (2)X
m2M
xam = 1 8a 2 A (3)
X
f2Va
yatf 6 1 8(a, t) 2 A⇥ T (4)
min(|T |,saf+�)X
t=max(1,saf��)
yatf = 1 8(a, f) 2 A⇥ Va (5)
X
f2Va
yatf +X
f2Vb
ybtf6 1 + wab8(a, b, t) 2 A⇥A⇥ T, a < b (6)
xam + xbm 6 2� wab8(a, b,m) 2 A⇥A⇥M,a < b (7)X
a2A
xam 6 MAP 8m 2 M (8)
x, y, w, z binary (9)
Decision variables xam: airport a assigned to module m zm: module m is used yatf: flight f arrives/departs at/from airport a in time slot t wab: conflict between airport a and airport b (some t)
A = set of airports M = set of modules T = set of time slots Va= flights at airport a patf = cost to move flight f at airport a to time slot t saf = scheduled time for flight f at airport a i 𝛿 maximum shift distance for scheduled aircraft in terms of time slots: 𝛿 = Δ/ 5.
c1*#modules + c2* sum of shifts
Some airport assigned to module m→module m usedEach airport assigned to 1 moduleAt most 1 flight arrives/departs at airport time slot t
Each flight ±𝛿 from scheduled time
Two a/c at same slot at airports a and b→ two airports in conflictIf ∃ conflict → airports not same moduleMax MAP airports to each module
min # shifts: patf=1 if t≠saf; patf=0 if t=saf min total amount of shifts: patf=|t-saf|
![Page 105: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/105.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 13
min c1
X
m2M
zm + c
2
X
a2A
X
t2T
X
f2Va
patfyatf (1)
s.t. xam 6 zm 8(a,m) 2 A⇥M (2)X
m2M
xam = 1 8a 2 A (3)
X
f2Va
yatf 6 1 8(a, t) 2 A⇥ T (4)
min(|T |,saf+�)X
t=max(1,saf��)
yatf = 1 8(a, f) 2 A⇥ Va (5)
X
f2Va
yatf +X
f2Vb
ybtf6 1 + wab8(a, b, t) 2 A⇥A⇥ T, a < b (6)
xam + xbm 6 2� wab8(a, b,m) 2 A⇥A⇥M,a < b (7)X
a2A
xam 6 MAP 8m 2 M (8)
x, y, w, z binary (9)
![Page 106: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/106.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 13
min c1
X
m2M
zm + c
2
X
a2A
X
t2T
X
f2Va
patfyatf (1)
s.t. xam 6 zm 8(a,m) 2 A⇥M (2)X
m2M
xam = 1 8a 2 A (3)
X
f2Va
yatf 6 1 8(a, t) 2 A⇥ T (4)
min(|T |,saf+�)X
t=max(1,saf��)
yatf = 1 8(a, f) 2 A⇥ Va (5)
X
f2Va
yatf +X
f2Vb
ybtf6 1 + wab8(a, b, t) 2 A⇥A⇥ T, a < b (6)
xam + xbm 6 2� wab8(a, b,m) 2 A⇥A⇥M,a < b (7)X
a2A
xam 6 MAP 8m 2 M (8)
x, y, w, z binary (9)
IP formulation of FRAMA optimises c1*M + c2*S (could move one in constraint)
![Page 107: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/107.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 13
min c1
X
m2M
zm + c
2
X
a2A
X
t2T
X
f2Va
patfyatf (1)
s.t. xam 6 zm 8(a,m) 2 A⇥M (2)X
m2M
xam = 1 8a 2 A (3)
X
f2Va
yatf 6 1 8(a, t) 2 A⇥ T (4)
min(|T |,saf+�)X
t=max(1,saf��)
yatf = 1 8(a, f) 2 A⇥ Va (5)
X
f2Va
yatf +X
f2Vb
ybtf6 1 + wab8(a, b, t) 2 A⇥A⇥ T, a < b (6)
xam + xbm 6 2� wab8(a, b,m) 2 A⇥A⇥M,a < b (7)X
a2A
xam 6 MAP 8m 2 M (8)
x, y, w, z binary (9)
IP formulation of FRAMA optimises c1*M + c2*S (could move one in constraint) We choose c1 and c2 such that minimizing the modules is the primary objective: c1>>c2
![Page 108: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/108.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 13
min c1
X
m2M
zm + c
2
X
a2A
X
t2T
X
f2Va
patfyatf (1)
s.t. xam 6 zm 8(a,m) 2 A⇥M (2)X
m2M
xam = 1 8a 2 A (3)
X
f2Va
yatf 6 1 8(a, t) 2 A⇥ T (4)
min(|T |,saf+�)X
t=max(1,saf��)
yatf = 1 8(a, f) 2 A⇥ Va (5)
X
f2Va
yatf +X
f2Vb
ybtf6 1 + wab8(a, b, t) 2 A⇥A⇥ T, a < b (6)
xam + xbm 6 2� wab8(a, b,m) 2 A⇥A⇥M,a < b (7)X
a2A
xam 6 MAP 8m 2 M (8)
x, y, w, z binary (9)
IP formulation of FRAMA optimises c1*M + c2*S (could move one in constraint) We choose c1 and c2 such that minimizing the modules is the primary objective: c1>>c2 IP computes new slots for flights and assigns airports to RTMs, such that:
![Page 109: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/109.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 13
min c1
X
m2M
zm + c
2
X
a2A
X
t2T
X
f2Va
patfyatf (1)
s.t. xam 6 zm 8(a,m) 2 A⇥M (2)X
m2M
xam = 1 8a 2 A (3)
X
f2Va
yatf 6 1 8(a, t) 2 A⇥ T (4)
min(|T |,saf+�)X
t=max(1,saf��)
yatf = 1 8(a, f) 2 A⇥ Va (5)
X
f2Va
yatf +X
f2Vb
ybtf6 1 + wab8(a, b, t) 2 A⇥A⇥ T, a < b (6)
xam + xbm 6 2� wab8(a, b,m) 2 A⇥A⇥M,a < b (7)X
a2A
xam 6 MAP 8m 2 M (8)
x, y, w, z binary (9)
IP formulation of FRAMA optimises c1*M + c2*S (could move one in constraint) We choose c1 and c2 such that minimizing the modules is the primary objective: c1>>c2 IP computes new slots for flights and assigns airports to RTMs, such that:• Each flight is moved by at most Δ
![Page 110: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/110.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 13
min c1
X
m2M
zm + c
2
X
a2A
X
t2T
X
f2Va
patfyatf (1)
s.t. xam 6 zm 8(a,m) 2 A⇥M (2)X
m2M
xam = 1 8a 2 A (3)
X
f2Va
yatf 6 1 8(a, t) 2 A⇥ T (4)
min(|T |,saf+�)X
t=max(1,saf��)
yatf = 1 8(a, f) 2 A⇥ Va (5)
X
f2Va
yatf +X
f2Vb
ybtf6 1 + wab8(a, b, t) 2 A⇥A⇥ T, a < b (6)
xam + xbm 6 2� wab8(a, b,m) 2 A⇥A⇥M,a < b (7)X
a2A
xam 6 MAP 8m 2 M (8)
x, y, w, z binary (9)
IP formulation of FRAMA optimises c1*M + c2*S (could move one in constraint) We choose c1 and c2 such that minimizing the modules is the primary objective: c1>>c2 IP computes new slots for flights and assigns airports to RTMs, such that:• Each flight is moved by at most Δ• No conflicting airports are assigned to the same RTM
![Page 111: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/111.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 13
min c1
X
m2M
zm + c
2
X
a2A
X
t2T
X
f2Va
patfyatf (1)
s.t. xam 6 zm 8(a,m) 2 A⇥M (2)X
m2M
xam = 1 8a 2 A (3)
X
f2Va
yatf 6 1 8(a, t) 2 A⇥ T (4)
min(|T |,saf+�)X
t=max(1,saf��)
yatf = 1 8(a, f) 2 A⇥ Va (5)
X
f2Va
yatf +X
f2Vb
ybtf6 1 + wab8(a, b, t) 2 A⇥A⇥ T, a < b (6)
xam + xbm 6 2� wab8(a, b,m) 2 A⇥A⇥M,a < b (7)X
a2A
xam 6 MAP 8m 2 M (8)
x, y, w, z binary (9)
IP formulation of FRAMA optimises c1*M + c2*S (could move one in constraint) We choose c1 and c2 such that minimizing the modules is the primary objective: c1>>c2 IP computes new slots for flights and assigns airports to RTMs, such that:• Each flight is moved by at most Δ• No conflicting airports are assigned to the same RTM• At most MAP airports are assigned per module
![Page 112: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/112.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 13
min c1
X
m2M
zm + c
2
X
a2A
X
t2T
X
f2Va
patfyatf (1)
s.t. xam 6 zm 8(a,m) 2 A⇥M (2)X
m2M
xam = 1 8a 2 A (3)
X
f2Va
yatf 6 1 8(a, t) 2 A⇥ T (4)
min(|T |,saf+�)X
t=max(1,saf��)
yatf = 1 8(a, f) 2 A⇥ Va (5)
X
f2Va
yatf +X
f2Vb
ybtf6 1 + wab8(a, b, t) 2 A⇥A⇥ T, a < b (6)
xam + xbm 6 2� wab8(a, b,m) 2 A⇥A⇥M,a < b (7)X
a2A
xam 6 MAP 8m 2 M (8)
x, y, w, z binary (9)
IP formulation of FRAMA optimises c1*M + c2*S (could move one in constraint) We choose c1 and c2 such that minimizing the modules is the primary objective: c1>>c2 IP computes new slots for flights and assigns airports to RTMs, such that:• Each flight is moved by at most Δ• No conflicting airports are assigned to the same RTM• At most MAP airports are assigned per module ➡ IP formulation solves FRAMA!
![Page 113: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/113.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 14
Experimental Study
![Page 114: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/114.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 15
![Page 115: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/115.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 15
Additional airports considered for remote operation in Sweden:
![Page 116: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/116.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 15
Additional airports considered for remote operation in Sweden:• Airport 1 (AP1): Small airport with low traffic, few scheduled flights per hour, non-
regular helicopter traffic, sometimes special testing activities.• Airport 2 (AP2): Low to medium-sized airport, multiple scheduled flights per hour,
regular special traffic flights (usually open 24/7, with exceptions). • Airport 3 (AP3): Small regional airport with regular scheduled flights (usually open
24/7, with exceptions)• Airport 4 (AP4): Small airport with significant seasonal variations.• Airport 5 (AP5): Small airport with low scheduled traffic, non-regular helicopter
flights.
![Page 117: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/117.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 15
Additional airports considered for remote operation in Sweden:• Airport 1 (AP1): Small airport with low traffic, few scheduled flights per hour, non-
regular helicopter traffic, sometimes special testing activities.• Airport 2 (AP2): Low to medium-sized airport, multiple scheduled flights per hour,
regular special traffic flights (usually open 24/7, with exceptions). • Airport 3 (AP3): Small regional airport with regular scheduled flights (usually open
24/7, with exceptions)• Airport 4 (AP4): Small airport with significant seasonal variations.• Airport 5 (AP5): Small airport with low scheduled traffic, non-regular helicopter
flights.
We use traffic data from October 19, 2016—the day with highest traffic in 2016
![Page 118: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/118.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 15
Additional airports considered for remote operation in Sweden:• Airport 1 (AP1): Small airport with low traffic, few scheduled flights per hour, non-
regular helicopter traffic, sometimes special testing activities.• Airport 2 (AP2): Low to medium-sized airport, multiple scheduled flights per hour,
regular special traffic flights (usually open 24/7, with exceptions). • Airport 3 (AP3): Small regional airport with regular scheduled flights (usually open
24/7, with exceptions)• Airport 4 (AP4): Small airport with significant seasonal variations.• Airport 5 (AP5): Small airport with low scheduled traffic, non-regular helicopter
flights.
We use traffic data from October 19, 2016—the day with highest traffic in 2016 286 flight movements were scheduled on this day for the five airports
![Page 119: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/119.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 15
Additional airports considered for remote operation in Sweden:• Airport 1 (AP1): Small airport with low traffic, few scheduled flights per hour, non-
regular helicopter traffic, sometimes special testing activities.• Airport 2 (AP2): Low to medium-sized airport, multiple scheduled flights per hour,
regular special traffic flights (usually open 24/7, with exceptions). • Airport 3 (AP3): Small regional airport with regular scheduled flights (usually open
24/7, with exceptions)• Airport 4 (AP4): Small airport with significant seasonal variations.• Airport 5 (AP5): Small airport with low scheduled traffic, non-regular helicopter
flights.
We use traffic data from October 19, 2016—the day with highest traffic in 2016 286 flight movements were scheduled on this day for the five airportsFor first set of experiments: without self-conflicts → 233 movements
![Page 120: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/120.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 15
Additional airports considered for remote operation in Sweden:• Airport 1 (AP1): Small airport with low traffic, few scheduled flights per hour, non-
regular helicopter traffic, sometimes special testing activities.• Airport 2 (AP2): Low to medium-sized airport, multiple scheduled flights per hour,
regular special traffic flights (usually open 24/7, with exceptions). • Airport 3 (AP3): Small regional airport with regular scheduled flights (usually open
24/7, with exceptions)• Airport 4 (AP4): Small airport with significant seasonal variations.• Airport 5 (AP5): Small airport with low scheduled traffic, non-regular helicopter
flights.
We use traffic data from October 19, 2016—the day with highest traffic in 2016 286 flight movements were scheduled on this day for the five airportsFor first set of experiments: without self-conflicts → 233 movementsOne optimization problem for each pair (Δ, MAP)
![Page 121: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/121.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Original Traffic
16
MAP=5
We have 12 x 24 = 288 slots for flight movements ➡ with sufficiently large shifts 233 flight movements in single module
![Page 122: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/122.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Original Traffic
16
MAP=5
No rescheduling allowed: need 5 RTMs
We have 12 x 24 = 288 slots for flight movements ➡ with sufficiently large shifts 233 flight movements in single module
![Page 123: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/123.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Original Traffic
16
MAP=5
No rescheduling allowed: need 5 RTMsReschedule at most ±5 minutes: 2 RTMs
We have 12 x 24 = 288 slots for flight movements ➡ with sufficiently large shifts 233 flight movements in single module
![Page 124: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/124.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Original Traffic
16
MAP=5
No rescheduling allowed: need 5 RTMsReschedule at most ±5 minutes: 2 RTMs
For 1 RTM: we need to reschedule by ±35 mins
We have 12 x 24 = 288 slots for flight movements ➡ with sufficiently large shifts 233 flight movements in single module
![Page 125: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/125.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Original Traffic
17
#shifts
max shift (in minutes)
![Page 126: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/126.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Original Traffic
17
#shifts
max shift (in minutes)
Shows tradeoffs: more shifts — larger shifts (more minutes) — more APs/module
![Page 127: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/127.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Original Traffic
18
MAP=4 MAP=3 MAP=2
![Page 128: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/128.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
All 286 movements
19
In case of a self-induced conflict: model shifts either of them
![Page 129: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/129.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
All 286 movements
19
In case of a self-induced conflict: model shifts either of them➡ we start with possible more than one flight movement per time slot and airport
![Page 130: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/130.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
All 286 movements
19
In case of a self-induced conflict: model shifts either of them➡ we start with possible more than one flight movement per time slot and airport➡ 𝛿=0 infeasible by definition
![Page 131: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/131.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
All 286 movements
19
MAP=5
In case of a self-induced conflict: model shifts either of them➡ we start with possible more than one flight movement per time slot and airport➡ 𝛿=0 infeasible by definition
![Page 132: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/132.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
All 286 movements
19
MAP=5
For 233 movs 2 RTMs were enough for 𝛿=1, now 𝛿=2
In case of a self-induced conflict: model shifts either of them➡ we start with possible more than one flight movement per time slot and airport➡ 𝛿=0 infeasible by definition
![Page 133: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/133.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
All 286 movements
19
MAP=5
For 233 movs 2 RTMs were enough for 𝛿=1, now 𝛿=2
For 233 movs 1RTM was enough for 𝛿=7, now 𝛿=37
In case of a self-induced conflict: model shifts either of them➡ we start with possible more than one flight movement per time slot and airport➡ 𝛿=0 infeasible by definition
![Page 134: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/134.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
All 286 movements
19
MAP=5
For 233 movs 2 RTMs were enough for 𝛿=1, now 𝛿=2
For 233 movs 1RTM was enough for 𝛿=7, now 𝛿=37
In case of a self-induced conflict: model shifts either of them➡ we start with possible more than one flight movement per time slot and airport➡ 𝛿=0 infeasible by definition
MAP=4
![Page 135: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/135.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
All 286 movements
19
MAP=5
For 233 movs 2 RTMs were enough for 𝛿=1, now 𝛿=2
For 233 movs 1RTM was enough for 𝛿=7, now 𝛿=37
In case of a self-induced conflict: model shifts either of them➡ we start with possible more than one flight movement per time slot and airport➡ 𝛿=0 infeasible by definition
MAP=4 MAP=3
![Page 136: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/136.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
All 286 movements
19
MAP=5
For 233 movs 2 RTMs were enough for 𝛿=1, now 𝛿=2
For 233 movs 1RTM was enough for 𝛿=7, now 𝛿=37
In case of a self-induced conflict: model shifts either of them➡ we start with possible more than one flight movement per time slot and airport➡ 𝛿=0 infeasible by definition
MAP=4 MAP=3 MAP=2
![Page 137: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/137.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Computation times: Solve in two steps
20
![Page 138: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/138.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Computation times: Solve in two steps
20
We solve two optimisation with c2 = 0 and c1 = 0 respectively and fix the ∑zk to the optimal number of modules used when solving the second optimization problem.
![Page 139: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/139.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Computation times: Solve in two steps
20
We solve two optimisation with c2 = 0 and c1 = 0 respectively and fix the ∑zk to the optimal number of modules used when solving the second optimization problem.
MAP=5
![Page 140: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/140.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Computation times: Solve in two steps
20
We solve two optimisation with c2 = 0 and c1 = 0 respectively and fix the ∑zk to the optimal number of modules used when solving the second optimization problem.
MAP=4MAP=5
![Page 141: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/141.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Computation times: Solve in two steps
20
We solve two optimisation with c2 = 0 and c1 = 0 respectively and fix the ∑zk to the optimal number of modules used when solving the second optimization problem.
MAP=4
MAP=3
MAP=5
![Page 142: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/142.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Computation times: Solve in two steps
20
We solve two optimisation with c2 = 0 and c1 = 0 respectively and fix the ∑zk to the optimal number of modules used when solving the second optimization problem.
MAP=4
MAP=3
MAP=5
MAP=2
![Page 143: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/143.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Increased Traffic Volume
21
![Page 144: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/144.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Increased Traffic Volume
21
Duplicate each of the original flight movements
![Page 145: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/145.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Increased Traffic Volume
21
Duplicate each of the original flight movementsShift randomly by plus/minus one hour
![Page 146: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/146.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Increased Traffic Volume
21
Duplicate each of the original flight movementsShift randomly by plus/minus one hourShift again, randomly, by plus/minus 15 minutes
![Page 147: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/147.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Increased Traffic Volume
21
Duplicate each of the original flight movementsShift randomly by plus/minus one hourShift again, randomly, by plus/minus 15 minutesIf two flight movements end up in the same slot, one of the movements is deleted
![Page 148: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/148.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Increased Traffic Volume
21
Duplicate each of the original flight movementsShift randomly by plus/minus one hourShift again, randomly, by plus/minus 15 minutesIf two flight movements end up in the same slot, one of the movements is deleted“2x” data created from all data of the year 2016
![Page 149: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/149.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Increased Traffic Volume
21
Duplicate each of the original flight movementsShift randomly by plus/minus one hourShift again, randomly, by plus/minus 15 minutesIf two flight movements end up in the same slot, one of the movements is deleted“2x” data created from all data of the year 2016➡ shifted duplicates of flights from October 18, 2016 and October 20, 2016 may now
happen on October 19, 2016
![Page 150: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/150.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Increased Traffic Volume
21
Duplicate each of the original flight movementsShift randomly by plus/minus one hourShift again, randomly, by plus/minus 15 minutesIf two flight movements end up in the same slot, one of the movements is deleted“2x” data created from all data of the year 2016➡ shifted duplicates of flights from October 18, 2016 and October 20, 2016 may now
happen on October 19, 2016➡ Not exactly twice the number of movements
![Page 151: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/151.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Increased Traffic Volume
21
Duplicate each of the original flight movementsShift randomly by plus/minus one hourShift again, randomly, by plus/minus 15 minutesIf two flight movements end up in the same slot, one of the movements is deleted“2x” data created from all data of the year 2016➡ shifted duplicates of flights from October 18, 2016 and October 20, 2016 may now
happen on October 19, 2016➡ Not exactly twice the number of movements
• October 19: data set has 416 flight movements (after deleting double movements in time slots) out of 575 flight movements (all of the movements from 2016 that the duplication and shifting process produces)
![Page 152: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/152.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Increased Traffic Volume
22
![Page 153: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/153.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Increased Traffic Volume
22
For MAP=2 we get the optimum of 3RTMs for 𝛿=1 33 shifts ⬌ 7 shifts for original traffic
![Page 154: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/154.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services
Increased Traffic Volume
22
For MAP=2 we get the optimum of 3RTMs for 𝛿=1 33 shifts ⬌ 7 shifts for original traffic
Same tradeoffs: more shifts — larger shifts (more minutes) — more APs/module
![Page 155: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/155.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 23
Conclusion/Future Work
![Page 156: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/156.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 24
Conclusion
Future Work
![Page 157: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/157.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 24
• Optimization problem for remote towers (FRAMA):Conclusion
Future Work
![Page 158: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/158.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 24
• Optimization problem for remote towers (FRAMA):• Shifts flights to other, nearby, slots
Conclusion
Future Work
![Page 159: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/159.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 24
• Optimization problem for remote towers (FRAMA):• Shifts flights to other, nearby, slots • To minimize the total number of modules in the RTC
Conclusion
Future Work
![Page 160: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/160.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 24
• Optimization problem for remote towers (FRAMA):• Shifts flights to other, nearby, slots • To minimize the total number of modules in the RTC
• Discussed computational complexity
Conclusion
Future Work
![Page 161: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/161.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 24
• Optimization problem for remote towers (FRAMA):• Shifts flights to other, nearby, slots • To minimize the total number of modules in the RTC
• Discussed computational complexity• Presented different solution approaches
Conclusion
Future Work
![Page 162: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/162.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 24
• Optimization problem for remote towers (FRAMA):• Shifts flights to other, nearby, slots • To minimize the total number of modules in the RTC
• Discussed computational complexity• Presented different solution approaches• Experiments for IP for five Swedish airports
Conclusion
Future Work
![Page 163: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/163.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 24
• Optimization problem for remote towers (FRAMA):• Shifts flights to other, nearby, slots • To minimize the total number of modules in the RTC
• Discussed computational complexity• Presented different solution approaches• Experiments for IP for five Swedish airports➡ Show applicability of our approach
Conclusion
Future Work
![Page 164: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/164.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 24
• Optimization problem for remote towers (FRAMA):• Shifts flights to other, nearby, slots • To minimize the total number of modules in the RTC
• Discussed computational complexity• Presented different solution approaches• Experiments for IP for five Swedish airports➡ Show applicability of our approach➡ Tradeoffs: more shifts — larger shifts (more minutes) — more APs/module
Conclusion
Future Work
![Page 165: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/165.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 24
• Optimization problem for remote towers (FRAMA):• Shifts flights to other, nearby, slots • To minimize the total number of modules in the RTC
• Discussed computational complexity• Presented different solution approaches• Experiments for IP for five Swedish airports➡ Show applicability of our approach➡ Tradeoffs: more shifts — larger shifts (more minutes) — more APs/module➡ Minor shifts (few minutes) can significantly reduce necessary number of modules
Conclusion
Future Work
![Page 166: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/166.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 24
• Optimization problem for remote towers (FRAMA):• Shifts flights to other, nearby, slots • To minimize the total number of modules in the RTC
• Discussed computational complexity• Presented different solution approaches• Experiments for IP for five Swedish airports➡ Show applicability of our approach➡ Tradeoffs: more shifts — larger shifts (more minutes) — more APs/module➡ Minor shifts (few minutes) can significantly reduce necessary number of modules➡ Cooperation between airlines, airport owners and ANSPs may help in reduction of RTC
operation costs
Conclusion
Future Work
![Page 167: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/167.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 24
• Optimization problem for remote towers (FRAMA):• Shifts flights to other, nearby, slots • To minimize the total number of modules in the RTC
• Discussed computational complexity• Presented different solution approaches• Experiments for IP for five Swedish airports➡ Show applicability of our approach➡ Tradeoffs: more shifts — larger shifts (more minutes) — more APs/module➡ Minor shifts (few minutes) can significantly reduce necessary number of modules➡ Cooperation between airlines, airport owners and ANSPs may help in reduction of RTC
operation costs
• Our conflict definition may be too conservative/precautionary
Conclusion
Future Work
![Page 168: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/168.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 24
• Optimization problem for remote towers (FRAMA):• Shifts flights to other, nearby, slots • To minimize the total number of modules in the RTC
• Discussed computational complexity• Presented different solution approaches• Experiments for IP for five Swedish airports➡ Show applicability of our approach➡ Tradeoffs: more shifts — larger shifts (more minutes) — more APs/module➡ Minor shifts (few minutes) can significantly reduce necessary number of modules➡ Cooperation between airlines, airport owners and ANSPs may help in reduction of RTC
operation costs
• Our conflict definition may be too conservative/precautionary• They cannot be discarded, and will influence staff planning
Conclusion
Future Work
![Page 169: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/169.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 24
• Optimization problem for remote towers (FRAMA):• Shifts flights to other, nearby, slots • To minimize the total number of modules in the RTC
• Discussed computational complexity• Presented different solution approaches• Experiments for IP for five Swedish airports➡ Show applicability of our approach➡ Tradeoffs: more shifts — larger shifts (more minutes) — more APs/module➡ Minor shifts (few minutes) can significantly reduce necessary number of modules➡ Cooperation between airlines, airport owners and ANSPs may help in reduction of RTC
operation costs
• Our conflict definition may be too conservative/precautionary• They cannot be discarded, and will influence staff planning➡ Continues discussion with operations
Conclusion
Future Work
![Page 170: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/170.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 24
• Optimization problem for remote towers (FRAMA):• Shifts flights to other, nearby, slots • To minimize the total number of modules in the RTC
• Discussed computational complexity• Presented different solution approaches• Experiments for IP for five Swedish airports➡ Show applicability of our approach➡ Tradeoffs: more shifts — larger shifts (more minutes) — more APs/module➡ Minor shifts (few minutes) can significantly reduce necessary number of modules➡ Cooperation between airlines, airport owners and ANSPs may help in reduction of RTC
operation costs
• Our conflict definition may be too conservative/precautionary• They cannot be discarded, and will influence staff planning➡ Continues discussion with operations➡ Possibly: distinguish arrival/departures
Conclusion
Future Work
![Page 171: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/171.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 24
• Optimization problem for remote towers (FRAMA):• Shifts flights to other, nearby, slots • To minimize the total number of modules in the RTC
• Discussed computational complexity• Presented different solution approaches• Experiments for IP for five Swedish airports➡ Show applicability of our approach➡ Tradeoffs: more shifts — larger shifts (more minutes) — more APs/module➡ Minor shifts (few minutes) can significantly reduce necessary number of modules➡ Cooperation between airlines, airport owners and ANSPs may help in reduction of RTC
operation costs
• Our conflict definition may be too conservative/precautionary• They cannot be discarded, and will influence staff planning➡ Continues discussion with operations➡ Possibly: distinguish arrival/departures➡ Possibly: consider uncertainty
Conclusion
Future Work
![Page 172: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/172.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 24
• Optimization problem for remote towers (FRAMA):• Shifts flights to other, nearby, slots • To minimize the total number of modules in the RTC
• Discussed computational complexity• Presented different solution approaches• Experiments for IP for five Swedish airports➡ Show applicability of our approach➡ Tradeoffs: more shifts — larger shifts (more minutes) — more APs/module➡ Minor shifts (few minutes) can significantly reduce necessary number of modules➡ Cooperation between airlines, airport owners and ANSPs may help in reduction of RTC
operation costs
• Our conflict definition may be too conservative/precautionary• They cannot be discarded, and will influence staff planning➡ Continues discussion with operations➡ Possibly: distinguish arrival/departures➡ Possibly: consider uncertainty • Computational complexity of FRAMA with Δ > 0 and even MAP=2 is open
Conclusion
Future Work
![Page 173: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/173.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 24
• Optimization problem for remote towers (FRAMA):• Shifts flights to other, nearby, slots • To minimize the total number of modules in the RTC
• Discussed computational complexity• Presented different solution approaches• Experiments for IP for five Swedish airports➡ Show applicability of our approach➡ Tradeoffs: more shifts — larger shifts (more minutes) — more APs/module➡ Minor shifts (few minutes) can significantly reduce necessary number of modules➡ Cooperation between airlines, airport owners and ANSPs may help in reduction of RTC
operation costs
• Our conflict definition may be too conservative/precautionary• They cannot be discarded, and will influence staff planning➡ Continues discussion with operations➡ Possibly: distinguish arrival/departures➡ Possibly: consider uncertainty • Computational complexity of FRAMA with Δ > 0 and even MAP=2 is open• Currently we do not care which airlines affected by shift (possibly all to a single airline)
Conclusion
Future Work
![Page 174: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/174.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 24
• Optimization problem for remote towers (FRAMA):• Shifts flights to other, nearby, slots • To minimize the total number of modules in the RTC
• Discussed computational complexity• Presented different solution approaches• Experiments for IP for five Swedish airports➡ Show applicability of our approach➡ Tradeoffs: more shifts — larger shifts (more minutes) — more APs/module➡ Minor shifts (few minutes) can significantly reduce necessary number of modules➡ Cooperation between airlines, airport owners and ANSPs may help in reduction of RTC
operation costs
• Our conflict definition may be too conservative/precautionary• They cannot be discarded, and will influence staff planning➡ Continues discussion with operations➡ Possibly: distinguish arrival/departures➡ Possibly: consider uncertainty • Computational complexity of FRAMA with Δ > 0 and even MAP=2 is open• Currently we do not care which airlines affected by shift (possibly all to a single airline)➡ Take equity into account (2 airlines, airline A operating 150 flights, airline B operating 75;
reassign slot for 60 flights→ aim for 40 new slots for airline A, 20 new slots for airline B)
Conclusion
Future Work
![Page 175: Stakeholder Cooperation for Improved Predictability and ... · •Output: Shifted flights and Airport-to-RTM assignment 30.11.2017 SID 2017 - Stakeholder Cooperation for Improved](https://reader033.fdocuments.us/reader033/viewer/2022052019/60324f1652ae6b6e0f360e49/html5/thumbnails/175.jpg)
30.11.2017 SID 2017 - Stakeholder Cooperation for Improved Predictability and Lower Cost Remote Services 24
• Optimization problem for remote towers (FRAMA):• Shifts flights to other, nearby, slots • To minimize the total number of modules in the RTC
• Discussed computational complexity• Presented different solution approaches• Experiments for IP for five Swedish airports➡ Show applicability of our approach➡ Tradeoffs: more shifts — larger shifts (more minutes) — more APs/module➡ Minor shifts (few minutes) can significantly reduce necessary number of modules➡ Cooperation between airlines, airport owners and ANSPs may help in reduction of RTC
operation costs
• Our conflict definition may be too conservative/precautionary• They cannot be discarded, and will influence staff planning➡ Continues discussion with operations➡ Possibly: distinguish arrival/departures➡ Possibly: consider uncertainty • Computational complexity of FRAMA with Δ > 0 and even MAP=2 is open• Currently we do not care which airlines affected by shift (possibly all to a single airline)➡ Take equity into account (2 airlines, airline A operating 150 flights, airline B operating 75;
reassign slot for 60 flights→ aim for 40 new slots for airline A, 20 new slots for airline B)
Conclusion
Future WorkThank you.