Complex World 2015 Workshop

Slides:



Advertisements
Similar presentations
Airline Schedule Optimization (Fleet Assignment I)
Advertisements

Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.
Fundamentals of Python: From First Programs Through Data Structures
1 A Second Stage Network Recourse Problem in Stochastic Airline Crew Scheduling Joyce W. Yen University of Michigan John R. Birge Northwestern University.
Web Server Software Architectures Author: Daniel A. Menascé Presenter: Noshaba Bakht.
Airspace Resource Allocation -Operations Impact Prof. R. John Hansman, Director MIT International Center for Air Transportation
Airline Schedule Optimization (Fleet Assignment II) Saba Neyshabouri.
Luis Cadarso(1), Vikrant Vaze(2), Cynthia Barnhart(3), Ángel Marín(1)
Location Models For Airline Hubs Behaving as M/D/C Queues By: Shuxing Cheng Yi-Chieh Han Emile White.
Queuing Networks. Input source Queue Service mechanism arriving customers exiting customers Structure of Single Queuing Systems Note: 1.Customers need.
1 O&D Forecasting Issues, Challenges, and Forecasting Results John D. Salch PROS Revenue Management, Inc.
1 Performance Evaluation of Computer Networks: Part II Objectives r Simulation Modeling r Classification of Simulation Modeling r Discrete-Event Simulation.
OPTIMAL SERVER PROVISIONING AND FREQUENCY ADJUSTMENT IN SERVER CLUSTERS Presented by: Xinying Zheng 09/13/ XINYING ZHENG, YU CAI MICHIGAN TECHNOLOGICAL.
MIT ICAT ICATMIT M I T I n t e r n a t i o n a l C e n t e r f o r A i r T r a n s p o r t a t i o n Virtual Hubs: A Case Study Michelle Karow
Introduction to Network Planning Concepts and Practice Course Outline Dynaston Inc.
LMINET2: An Enhanced LMINET Dou Long, Shahab Hasan December 10, 2008.
Presented to: NAS-Wide Simulation & NextGen workshop By: Kimberly Noonan, Joseph Post Date: December 10th, 2008 Federal Aviation Administration The Modernized.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
Interconnect simulation. Different levels for Evaluating an architecture Numerical models – Mathematic formulations to obtain performance characteristics.
Interconnect simulation. Different levels for Evaluating an architecture Numerical models – Mathematic formulations to obtain performance characteristics.
ECE 466/658: Performance Evaluation and Simulation Introduction Instructor: Christos Panayiotou.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Monte-Carlo based Expertise A powerful Tool for System Evaluation & Optimization  Introduction  Features  System Performance.
14/01/20161 Air Traffic Management Panel Madrid May 2002 AVIATION OPERATIONAL MEASURES FOR FUEL AND EMISSIONS REDUCTION WORKSHOP HOW TO SAVE FUEL.
Chapter 1 What is Simulation?. Fall 2001 IMSE643 Industrial Simulation What’s Simulation? Simulation – A broad collection of methods and applications.
Modeling the Optimization of a Toll Booth Plaza By Liam Connell, Erin Hoover and Zach Schutzman Figure 1. Plot of k values and outputs from Erlang’s Formula.
 DM-Group Meeting Liangzhe Chen, Oct Papers to be present  RSC: Mining and Modeling Temporal Activity in Social Media  KDD’15  A. F. Costa,
Traffic Simulation L2 – Introduction to simulation Ing. Ondřej Přibyl, Ph.D.
The simultaneous evolution of author and paper networks
Location Models For Airline Hubs Behaving as M/D/C Queues
OPERATING SYSTEMS CS 3502 Fall 2017
Lecture 14 – Queuing Networks
A Multi-Airport Dynamic Network Flow Model with Capacity Uncertainty
HOW TO SAVE FUEL BY LOSING TIME? Air Traffic Management Panel
QoS & Queuing Theory CS352.
T-Share: A Large-Scale Dynamic Taxi Ridesharing Service
Capacity and delays at Newark Airport, theoretical and experimental approaches Thomas Morisset.
Lec # 22 Data Communication Muhammad Waseem Iqbal.
Prepared by Lloyd R. Jaisingh
Saint- Petersburg State University of Aerospace Instrumentation
Modeling and Simulation (An Introduction)
Accessibility Patterns, Transport Infrastructure
Process-to-Process Delivery, TCP and UDP protocols
What Stops Social Epidemics?
Dynamic Graph Partitioning Algorithm
Chapter 6: Temporal Difference Learning
ADVANTAGES OF SIMULATION
Simulation Examples STOCHASTIC PROCESSES.
Mean Value Analysis of a Database Grid Application
A Modeling Framework for Flight Schedule Planning
Simulation Department of Industrial Engineering Anadolu University
Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.
1.206J/16.77J/ESD.215J Airline Schedule Planning
The Flight Network.
Announcements Homework 3 due today (grace period through Friday)
Izaro Etxebarria, ISDEFE, Spain 7th April, Brussels, EUROCONTROL
Introduction to the workshop
Simulation An Application of Queue ADT
COMP60611 Fundamentals of Parallel and Distributed Systems
IT351: Mobile & Wireless Computing
COMP60611 Fundamentals of Parallel and Distributed Systems
Vehicular Ad-hoc Networks
Chapter 6: Temporal Difference Learning
COMP60621 Designing for Parallelism
Javad Ghaderi, Tianxiong Ji and R. Srikant
Collaborative Decision Making “Developing A Collaborative Framework”
Chapter-5 Traffic Engineering.
Lecturer Dr. Veronika Alhanaqtah
Modeling and Simulation: Exploring Dynamic System Behaviour
Approximate Mean Value Analysis of a Database Grid Application
Presentation transcript:

Complex World 2015 Workshop Analysis of air transportation using complex networks Pablo Fleurquin José J. Ramasco Victor M Eguíluz @ifisc_mallorca www.facebook.com/ifisc

Does the ABM model have predictive power? What are the internal key drivers behind delay propagation/reactionary delay? What are the internal key drivers behind delay propagation/reactionary delay? Does the ABM model have predictive power? Does the ABM model have predictive power? What can we say about the system robustness to external perturbations? What can we say about the system robustness to external perturbations?

Model Generalities Why ABM? What type of ABM? Which are the processes to simulate? Which are the model agents? Programming Language & computational features? Processes known. Type of understanding. Data availability. Scale model: reduction in the level of detail or complexity of the system. K.I.S.S modeling principle. Among several processes we select the ones that we thought most significant to our problem. Fundamental modeling agent: aircraft/flight Other model objects: air-carrier, airports. C++: object oriented, low-level memory manipulation & computational efficient. 1 day simulation takes on average 20 mins. Run in parallel mode.

Data specifics Database: Airline On-Time Performance Data (www.bts.gov) Schedule & actual departure (arrival) times Origin & destination airports Airline id Tail number In numbers: 6,450,129 flights (74 %) 18 carriers 305 airports Network: Nodes: airports Edges: direct flights between airports Node attributes: average delay per flight

Modeling details Flight rotation (same tail number) Airport Congestion Ts Schedule (arrival/departure) Flight connectivity (different tail number) ΔT α Modeling details Airport Congestion Schedule Airport Arrival Rate (SAAR) First Arrived First served β Initial Conditions From the data… Known  when, where and the departure delay for the first flight of the sequence. Random initial conditions… Fixed initial delay (min) % of initially delayed planes In order to analyze how this dynamic is generated and evolves, we developed an agent-based model (in which agents are the 4 thousand aircrafts that are part of the system every day) and also the model is data-driven because it takes into account the actual schedule and the aircraft itinerary for each day. The model has three internal mechanisms to propagate the delays: the rotation (or path) of the aircraft itself, the connectivity between flights and airport congestion. The first mechanism is the rotation of the aircraft. It is clear that if a plane that goes from Palma to Madrid through Barcelona and is delayed in Palma, probably the next flight leg from Barcelona-Madrid is going to be delayed. Provided that the ground time in Barcelona is not sufficient to absorb the delay. This mechanism includes the schedule and a minimum service time accounting for the operations at the airport. The second mechanism considers the connection between flights of the same airline. Through this subprocess a flight may be delayed because it has to wait for passengers or crew from another flight. As we have no information of which flight is connection of which other we randomly select the connections. Allowing for a 3-hour time window prior to the schedule departure of a particular flight we consider as possible connections the schedule arrivals of the same company within that time window. To modulate the effect of the flight connectivity we consider the connectivity parameter. As we will see afterwards only by adjusting this parameter the model is able to reproduce what we observed in reality. Finally by the internal mechanism of airport congestion we take into account nodes with finite capacity. The capacity is measured according to the Scheduled airport arrival rate. As you can see in the figure this rate varies over time and is different for each airport so this introduces more heterogeneity in the system. According to this mechanism if the Real Rate of arrivals exceeds the Schedule rate the next plane will become part of the airport queue waiting to be served. The protocol is First Arrived - First served. The initial conditions can be of two types. Same initial conditions as found in the data, ie for the first flight of an itinerary we know when, where and with what intensity happened. Or taking random initial conditions according to a fixed value of delay and a percentage of initially delayed flights.

Results Predictive power: 70% accuracy Key drivers: Crew & Passenger connectivity, reinforcement flights Influence of schedule on system robustness & external perturbations Explore Trees of Reactionary Delays Let us now compare the model results with what has actually happened. This figure shows the results for the March 12 and April 19 (the best day in terms of delay). Importantly, we performed the comparison for every day of the year and we found that the model reproduces very well the data. For every day the connectivity parameter is fitted and we use the nominal capacity of each airport (ie beta equal to 1). Figures show the evolution of the size of the largest cluster throughout the day. As we can see the selected days have a very different behavior. Another question we want to answer with the model is which internal mechanism is more efficient for propagating the delays. To do so we can turn on or off the different mechanisms. In the right figure flight connectivity and airport congestion mechanisms are turned off. In this case by only taking into account the rotation of the plane is not possible to generate a wide congestion as observed in the real data. The same applies only with airport congestion and aircraft rotation.  So, only considering flight connectivity (ie assuming infinite capacity nodes) the answer is positive, concluding that this process is the most important one.