1 / 20

United Airlines Network (simplified)

United Airlines Network (simplified). Capt Mike Brisker LT Andy Olson. Background. UA is world’s largest airline by amount of passenger traffic Over 5000 flights/day on six continents Serves 234 airports in the US (63 of which are considered in this model)

bessie
Download Presentation

United Airlines Network (simplified)

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. United Airlines Network(simplified) Capt Mike Brisker LT Andy Olson

  2. Background • UA is world’s largest airline by amount of passenger traffic • Over 5000 flights/day on six continents • Serves 234 airports in the US (63 of which are considered in this model) • Operates 14 different types of aircraft (five of which are considered in this model)

  3. Problem Formulation • Only allowing network to run for two hops • Network only includes the 63 busiest US airports • Network starts with all aircraft at a hub • All edges between airports are fair game to an aircraft at that airport; network does not force match a particular type of aircraft for a given edge • UA is incentivized to use certain planes for certain edges based on profit available

  4. Formulation continued… • Any edge can be run multiple times, but multiple runs of the same edge are successively less profitable • Network is time-agnostic • Not requiring aircraft to return to point of origin • The network does not include the largest or smallest planes UA uses • Aircraft are allocated to each hub proportionally to the number of edges coming out of the hub

  5. Airplane Data

  6. Profits The cost of flying a given edge for a plane of type j is The profit available for a plane of type j flying a given edge is

  7. Network Description • Types of nodes • Hubs • Types of aircraft at a hub • Routes available from that hub • Legs of those routes • Cost nodes (created for the purpose of allowing multiple flights on edges at reduced profit)

  8. Network Vital Stats • Total number of nodes: 5,917 • Total number of edges: 40,371 • Output file length (w/o attacks): 1,107 lines • Number of legs flown (w/o attacks): 602

  9. Abbreviated Network ModelModeled as Min-Cost Flow Legs of the Flight Cost Nodes Aircraft at Hubs Itinerary From Hub Hubs S T (0,0,1) (0,0,1) (0,0,∞) (0,0,max number of aircraft) (-profit,0,1)

  10. A Closer Look… Full Profit SFO-LAX SFO B737 SFO-LAX-SFO (0,0,1) Less Profit Still Less Profit LAX-SFO LAX B737 LAX-SFO-LAX

  11. Still Closer… Full Profit (-profit,0,1) Type of aircraft at hub Itinerary From Hub (0,0,1) (-.9*profit,0,1) Less Profit (0,0,1) (-.8*profit,0, ∞) Still Less Profit

  12. Research Questions • How badly does the removal of a hub affect the overall flow of the network?

  13. Network Reaction to Attack to One Hub

  14. Network Reaction to Attacks to Two Hubs

  15. Network Reaction to Attack on a Specific Type of Aircraft

  16. Research Questions • How many planes should we allocate at each hub? • Do we need more or less?

  17. Redesign the Network Model Legs of the Flight Itinerary From Hub Cost Nodes Aircraft Type Hubs S T (0,0,1) (0,0,total number of aircraft) (0,0,∞) (0,0,1) (-profit,0,1)

  18. Planes Used

  19. Ways Forward • Things we wish we could have done… • The model is running correctly, but we have a choke point in it limiting the number of flights • Time-layering • Assigning certain types of planes to certain types of flights • Run a week/month schedule (it is available, but…)

More Related