1,061 research outputs found

    Data-driven modeling of systemic delay propagation under severe meteorological conditions

    Get PDF
    The upsetting consequences of weather conditions are well known to any person involved in air transportation. Still the quantification of how these disturbances affect delay propagation and the effectiveness of managers and pilots interventions to prevent possible large-scale system failures needs further attention. In this work, we employ an agent-based data-driven model developed using real flight performance registers for the entire US airport network and focus on the events occurring on October 27 2010 in the United States. A major storm complex that was later called the 2010 Superstorm took place that day. Our model correctly reproduces the evolution of the delay-spreading dynamics. By considering different intervention measures, we can even improve the model predictions getting closer to the real delay data. Our model can thus be of help to managers as a tool to assess different intervention measures in order to diminish the impact of disruptive conditions in the air transport system.Comment: 9 pages, 5 figures. Tenth USA/Europe Air Traffic Management Research and Development Seminar (ATM2013

    A Rolling Horizon Based Algorithm for Solving Integrated Airline Schedule Recovery Problem

    Get PDF
    Airline disruption incurred huge cost for airlines and serious inconvenience for travelers. In this paper, we study the integrated airline schedule recovery problem, which considers flight recovery, aircraft recovery and crew recovery simultaneously. First we built an integer programming model which is based on traditional set partitioning model but including flight copy decision variables. Then a rolling horizon based algorithm is proposed to efficiently solve the model. Our algorithm decomposes the whole problem into smaller sub-problems by restricting swapping opportunities within each rolling period. All the flights are considered in each sub-problem to circumvent โ€˜myopicโ€™ of traditional rolling horizon algorithm. Experimental results show that our method can provide competitive recovery solution in both solution quality and computation time.published_or_final_versio

    Sustainable Disruption Management

    Get PDF

    Allocating Air Traffic Flow Management Slots

    Get PDF
    In Europe, when an imbalance between demand and capacity is detected for air traffic network resources, Air Traffic Flow Management slots are allocated to flights on the basis of a First Planned First Served principle. We propose a market mechanism to allocate such slots in the case of a single constrained en-route sector or airport. We show that our mechanism provides a slot allocation which is economically preferable to the current one as it enables airlines to pay for delay reduction or receive compensations for delay increases. We also discuss the implementation of our mechanism through two alternative distributed approaches that spare airlines the disclosure of private information. Both these approaches have the additional advantage that they directly involve airlines in the decision making process. Two computational examples relying on real data illustrate our findings.Air Transportation, Market Mechanism Design, Air Traffic Flow Management slots, Collaborative Decision Making, SESAR.

    Data-driven modeling of systemic delay propagation under severe meteorological conditions

    Get PDF
    Trabajo presentado en el 10th USA/Europe Air Traffic Management Research and Development Seminar (2013), celebrado en Chicago del 10 al 13 de junio de 2013.The upsetting consequences of weather conditions are well known to any person involved in air transportation. Still the quantification of how these disturbances affect delay propagation and the effectiveness of managers and pilots interventions to prevent possible large- scale system failures needs further attention. In this work, we employ an agent-based data-driven model developed using real flight performance registers for the entire US airport network and focus on the events occurring on October 27 2010 in the United States. A major storm complex that was later called the 2010 Superstorm took place that day. Our model correctly reproduces the evolution of the delay-spreading dynamics. By considering different intervention measures, we can even improve the model predictions getting closer to the real delay data. Our model can thus be of help to managers as a tool to assess different intervention measures in order to diminish the impact of disruptive conditions in the air transport system.PF receives support from the network Complex World within the WPE of SESAR (Eurocontrol and EU Commission). JJR acknowledges funding from the Ramรณn y Cajal program of the Spanish Ministry of Economy (MINECO). Partial support from MINECO and FEDER was received through projects MODASS (FIS2011-24785), FISICOS (FIS2007-60327) and INTENSE@COSYP (FIS2012-30634). Funding was also received from the EU Commission through projects EUNOIA FP7-DG.Connect-318367) and LASAGNE (FP7-ICT-318132).Peer reviewe

    ๋‹ค์ค‘๊ณตํ•ญ์—์„œ ์ง€์ƒ ์ง€์—ฐ ํ”„๋กœ๊ทธ๋žจ ๋ฐœ์ƒ์‹œ ์ง€์—ฐ์ „ํŒŒ๋ฅผ ๊ณ ๋ คํ•œ ํ•ญ๊ณต์‚ฌ์˜ ์šดํ•ญ ์ผ์ • ๋ณ€๊ฒฝ

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ(์„์‚ฌ) -- ์„œ์šธ๋Œ€ํ•™๊ต๋Œ€ํ•™์› : ๊ณต๊ณผ๋Œ€ํ•™ ์‚ฐ์—…๊ณตํ•™๊ณผ, 2022. 8. ๋ฌธ์ผ๊ฒฝ.๋ณธ ์—ฐ๊ตฌ์˜ ๋ชฉ์ ์€ ํ•ญ๊ณต ๊ตํ†ต์„ ์ œ์–ดํ•˜๋Š” ์ค‘์š”ํ•œ ์ˆ˜๋‹จ ์ค‘ ํ•˜๋‚˜์ธ ์ง€์ƒ ์ง€์—ฐ ํ”„๋กœ๊ทธ๋žจ(GDP)์ด ๋ฐœ์ƒํ•  ๊ฒฝ์šฐ ๊ณตํ•ญ์˜ ๋ณ€๊ฒฝ๋œ ์ˆ˜์šฉ๋ ฅ์— ๋Œ€์‘ํ•˜๋„๋ก ํ•ญ๊ณต์‚ฌ์˜ ๊ด€์ ์—์„œ ํ•ญ๊ณตํŽธ์„ ์žฌ์กฐ์ •ํ•˜๋Š”๋ฐ ๋„์›€์„ ์ฃผ๋Š” ๊ฒƒ์ด๋‹ค. ๋‹จ์ผ ๊ณตํ•ญ์ด ์•„๋‹Œ ๋‹ค์ค‘ ๊ณตํ•ญ์œผ๋กœ ํ™•์žฅํ•˜์—ฌ ๋™์ผํ•œ ๊ณตํ•ญ๋ฟ ์•„๋‹ˆ๋ผ ๋‹ค๋ฅธ ๊ณตํ•ญ์œผ๋กœ๋ถ€ํ„ฐ์˜ ์ง€์—ฐ ์ „ํŒŒ๋ฅผ ๊ณ ๋ คํ–ˆ์œผ๋ฉฐ, ํ•ญ๊ณต๊ธฐ ๋ฐ ์Šน๋ฌด์›์˜ ๊ณ„ํš๋œ ์ผ์ •์—์„œ ๋ฐœ์ƒํ•˜๋Š” ํ˜„์‹ค์ ์ธ ๋น„์šฉ์„ ํฌํ•จํ–ˆ๋‹ค. GDP๊ฐ€ ๋ฐœํ–‰๋˜๋ฉด ํ•ญ๊ณต์‚ฌ๋“ค์€ ๋ณ€๊ฒฝ๋œ ์‹œ๊ฐ„๋Œ€์— ๋งž์ถฐ ํ•ญ๊ณตํŽธ์„ ์žฌ์กฐ์ •ํ•  ์ˆ˜ ์žˆ๋Š” ์งง์€ ์‹œ๊ฐ„์ด ์ฃผ์–ด์ง„๋‹ค. ๊ฐ ๊ณตํ•ญ์—๋Š” ์ˆ˜์šฉ๋ ฅ์ด ์žˆ์œผ๋ฉฐ, ํŠนํžˆ ๋“ค์–ด์˜ค๋Š” ํ•ญ๊ณต๊ธฐ๋ฅผ ์ˆ˜์šฉํ•  ์ˆ˜ ์žˆ๋Š” ์šฉ๋Ÿ‰์ธ ๊ณตํ•ญ ์ˆ˜์šฉ๋ฅ (AAR)์ด ์žˆ๋‹ค. ์ด ์—ฐ๊ตฌ์—์„œ ๋น„ํ–‰ ์Šค์ผ€์ค„์„ ์žฌ์กฐ์ •ํ•˜๊ธฐ ์œ„ํ•ด ํ˜ผํ•ฉ ์ •์ˆ˜ ์„ ํ˜• ํ”„๋กœ๊ทธ๋ž˜๋ฐ ๋ชจ๋ธ์„ ์„ธ์› ๋‹ค. ๋˜ํ•œ, ๋ฏธ๋ž˜์˜ ๋ถˆํ™•์‹ค์„ฑ์„ ๋‹ค๋ฃจ๊ธฐ ์œ„ํ•ด, MILP์˜ ๋‘ ๊ฐ€์ง€ ๋ฒ„์ „์„ ์‚ฌ์šฉํ•˜์˜€๋‹ค. AAR์ด ์–ด๋Š ์‹œ์ ์— ๋‹ค์‹œ ๋ฐ”๋€Œ๋Š” ์‹œ๋‚˜๋ฆฌ์˜ค๋ฅผ ๋งŒ๋“  ํ›„, ๊ฐ ์‹œ๋‚˜๋ฆฌ์˜ค ๋ณ„๋กœ ์ด ๊ด€๋ จ ๋น„์šฉ์„ ์ตœ์†Œํ™”ํ•˜๋Š” ์†”๋ฃจ์…˜์„ ๋„์ถœํ•˜๋Š” ์ตœ์  ๋ชจ๋ธ๊ณผ ๋ชจ๋“  ์‹œ๋‚˜๋ฆฌ์˜ค ์†”๋ฃจ์…˜์˜ ์ด ๊ด€๋ จ ๋น„์šฉ์˜ ๊ธฐ๋Œ“๊ฐ’์„ ์ตœ์†Œํ™”ํ•˜๋Š” ์†”๋ฃจ์…˜์„ ๋„์ถœํ•˜๋Š” ์ถ”๊ณ„ ๋ชจ๋ธ์„ ์ œ์‹œํ•˜๊ณ  ์„œ๋กœ ๋น„๊ตํ•˜์˜€๋‹คThe purpose of this thesis is to reschedule flights from the airline companyโ€™s perspective to correspond to the airportโ€™s changed capacity in the event of a ground delay program (GDP), one of the important means of controlling air traffic. We considered delay propagation not only within the same airport but within other airports by extending the setup to include several airports rather than a single airport. We also included realistic costs from planned schedules of the aircraft and crew. When a GDP is issued, airlines are given a short time to reschedule flights in time for the changed slot. Each airport has its own capacity, especially the airport acceptance rate (AAR), which is a capacity that can accommodate incoming aircraft. We formulated a mixed-integer linear programming (MILP) model to reschedule flights. To handle the uncertainty of future scheduling, two versions of the MILP model may be applied. With scenarios in which the AAR changes again, an optimal model that obtains a minimizing total relevant cost in each scenario solution and a stochastic model solution that obtains a minimizing expectation of the total relevant cost of all scenarios are presented and compared.Chapter 1 Introduction 1 Chapter 2 Literature review 3 Chapter 3 Mathematical model 5 3.0 Model description 5 3.1 Multi-airport Scenario-based Optimal Rescheduling Problem 10 3.2 Multi-airport Scenario-based Stochastic Rescheduling Problem 13 Chapter 4 Computational experiments 14 4.0 Settings 14 4.1 Experiment 1 16 4.2 Experiment 2 18 4.3 Experiment 3 19 4.4 Experiment 4 20 Chapter 5 Conclusions 25 Appendix 27 Appendix A. 27 Appendix B. 28 Bibliography 31 ๊ตญ๋ฌธ์ดˆ๋ก 35์„
    • โ€ฆ
    corecore