lec6_fleet_assignment_2003

# lec6_fleet_assignment_2003 - 1.206J/16.77J/ESD.215J Airline...

This preview shows pages 1–11. Sign up to view the full content.

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

View Full Document

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

View Full Document

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

View Full Document

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

View Full Document

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1 .206J/16.77J/ESD.215J Airline Schedule Planning Cynthia Barnhart Spring 2003 1.206J/16.77J/ESD.215J The Fleet Assignment Problem • Outline – Problem Definition and Objective – Fleet Assignment Network Representation – Fleet Assignment Model – Fleet Assignment Solution • Branch-and-bound – Results Route individual aircraft honoring maintenance restrictions Assign aircraft types to flight legs such that contribution is maximized Contribution = Revenue - Costs Airline Schedule Planning Schedule Design Fleet Assignment Aircraft Routing Crew Scheduling Select optimal set of flight legs in a schedule Assign crew (pilots and/or flight attendants) to flight legs Problem Definition Given: – Flight Schedule • Each flight covered exactly once by one fleet type – Number of Aircraft by Equipment Type • Can’t assign more aircraft than are available, for each type – Turn Times by Fleet Type at each Station – Other Restrictions: Maintenance, Gate, Noise, Runway, etc. – Operating Costs, Spill and Recapture Costs, Total Potential Revenue of Flights, by Fleet Type Problem Objective Find: – Cost minimizing (or profit maximizing) assignment of aircraft fleets to scheduled flights such that maintenance requirements are satisfied, conservation of flow (balance) of aircraft is achieved, and the number of aircraft used does not exceed the number available (in each fleet type) Definitions (again) • 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 • For each fleet - flight combination: Cost ≡ Operating cost + Spill cost Fleet Assignment References • Abara (1989), Daskin and Panayotopoulos (1989), Hane, Barnhart, Johnson, Marsten, Neumhauser, and Sigismondi (1995) • Hane, et al. “The Fleet Assignment Problem, Solving a Large Integer Program,” Mathematical Programming , Vol. 70, 2, pp. 211-232, 1995 Network Representation • Topologically sorted time-line network – Nodes: • Flight arrivals/ departures (time and space) – Arcs: • Flight arcs: one arc for each scheduled flight • Ground arcs: allow aircraft to sit on the ground between flights Time-Line Network 8:00 12:00 16:00 20:00 8:00 12:00 16:00 20:00 City A City B City C City D • Ground arcs Time-Line Network • “Daily” problem – Wrap-around (or overnight) arcs Washington, D.C. Washington, D.C....
View Full Document

{[ snackBarMessage ]}

### Page1 / 74

lec6_fleet_assignment_2003 - 1.206J/16.77J/ESD.215J Airline...

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

View Full Document
Ask a homework question - tutors are online