lec5_passenger_mix_2003

lec5_passenger_mix_2003 - 1.206J/16.77J/ESD.215J...

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon
1 .206J/16.77J/ESD.215J    Airline Schedule Planning Cynthia Barnhart Spring 2003  
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
1.206J/16.77J/ESD.215J      The Passenger Mix Problem Outline – Definitions – Formulations – Column and Row Generation – Solution Approach – Results – Applications and Extensions
Background image of page 2
Some Basic Definitions • Market – An origin-destination airport pair, between which  passengers wish to fly one-way • BOS-ORD and ORD-BOS are different • Itinerary – A specific sequence of flight legs on which a passenger  travels from their ultimate origin to their ultimate  destination • Fare Classes – Different prices for the same travel service, usually  distinguished from one another by the set of restrictions  imposed by the airlines
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Some More Definitions • Spill – Passengers that are denied booking due to  capacity restrictions • Recapture – Passengers that are recaptured back to the  airline after being spilled from another flight  leg
Background image of page 4
Problem Description • Given – An airline’s flight schedule – The unconstrained demand for all itineraries  over the airline’s flight schedule • Objective – Maximize revenues by intelligently spilling  passengers that are either low fare or will most  likely fly another itinerary (recapture) • Equivalent to minimize the total spill costs
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Example A A B B I,100 J,200 K,100 • One market, 3 itineraries • Unconstrained demand per itinerary – Total demand for an itinerary when the number  of seats is unlimited
Background image of page 6
Example with Capacity  Constraints A A B B I,100,150 J,200,175 K,100,130 • One market, 3 itineraries – Capacity on itinerary I = 150 – Capacity on itinerary J = 175 – Capacity on itinerary K = 130 • Optimal solution: – Spill _____ from I – Spill _____ from J – Spill _____ from K
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Revenue Management:  A Quick  Look • One flight leg – Flight 105, LGA-ORD, 287 seats available • Two fare classes: – Y: High fare, no restrictions – M: Low fare, many restrictions • Demand for Flight 105 – Y class: 95 with an average fare of $400 – M class:  225 with an average fare of $100 – Optimal Spill Solution (     Y and      M passengers) • Spill:  $
Background image of page 8
Network Revenue Management • Two Flights – Flight 105, LGA-ORD, 287 seats – Flight 201, ORD-SFO, 287 seats • Demand (one fare class) – LGA-ORD, 225 passengers $100 – ORD-SFO, 150 passengers $150 – LGA-SFO, 150 passengers, $225 • Optimal Solution:  $ – LGA-ORD,          passengers  – ORD-SFO,         passengers – LGA-SFO,         passengers
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 10
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/08/2011 for the course AERO 16.72 taught by Professor Hansman during the Fall '06 term at MIT.

Page1 / 31

lec5_passenger_mix_2003 - 1.206J/16.77J/ESD.215J...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online