1 / 14

Flight Rescheduling

This research paper discusses the problem of flight rescheduling and proposes models and algorithms to minimize passenger delay and revenue loss in emergency situations. The study compares different algorithms and presents extensions to the models.

gascon
Download Presentation

Flight Rescheduling

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. IEOR 4405 ProductionScheduling (Spring 2016) Flight Rescheduling Jo-Anne Loh (jl3963) Anna Ming (axm2000) Dhruv Purushottam (dp2631)

  2. Outline • Background • Situation 1 • Model I • Model II • Comparison • Situation 2 • Model III • Extensions

  3. Background • Airlines and their delays affect the economy • In 2007, passengers experienced a total delay of ~30,000 years with a cost of $16.1B in the US • How should flights be effectively rescheduled? • Minimize flight delay • Minimize passenger delay • Minimize revenue loss in emergency situations

  4. Situation 1 • Currently airlines reschedule to minimize flight delay. Does this also minimize passenger delay? • Goal: Minimize passenger trip delay using Schedule Minimization foR Generalized Operational Logistics (SRMGOL) algorithm • Assumptions: • 24 hour window • Flights are on a normal distribution • Flights do not depend on previous flights for the aircraft • All passengers have 1 stop over

  5. Situation 1: Data • Create initial flight times between 6 airports • Add average flight times to create final flight time • Create possible itineraries for passengers and generate final arrival time • Use percentage late data of each airport to determine which flights are delayed randomly • Run algorithms on passengers that miss the next leg of their flight

  6. Situation 1: Data Appendix

  7. Model I Algorithm • The intuitive solution: minimize flight time by putting passenger on the next available flight • Prioritizes planes arriving at original schedule

  8. Model II Algorithm Reschedule passenger on the next available flight or hold the connecting flight for a period of time to allow the passenger to make the flight.

  9. Situation 1: Model I vs II • ~20,000 passengers, 300 flights • Total hours of passenger delay:

  10. Situation II • Aircraft Recovery Problem – unforeseen events disrupt a flight schedule • Ex. In a snowstorm many flights are delayed. Which flights should go first with a limited amount of aircrafts? • Goal – reduce losses as much as possible • Assumptions: • There are less aircrafts than flights • Flights are full • Relax cancellation constraint

  11. Model III

  12. Model III Data

  13. Model III Results Sample run using AMPL and Gurobi

  14. Extensions • Situation I • Include trade-off between passenger delay and airline costs • Situation II • Create a dynamic model that can constantly update the unscheduled flights and rerun • Combine the two models into a real world situation where there are aircraft shortages and a need to minimize passenger delays

More Related