Airline Logistic Fleet and Crew Management

7/23/2019 Airline Logistic Fleet and Crew Management

1/113

Airline Logistics:

Fleet and Crew Management


2/113

Textbook

Abdelghany & Abdelghany

Modeling applications in the airline industry

2009 2010


3/113

Sister courses @MIT.OC

http://ocw.mit.edu/courses/aeronautics-and-astronautics/16-75-airline-management-spring-!""6/inde#.htm

(NB: 20+ lectures just for management)

http://ocw.mit.edu/courses/ci$il-and-en$ironmental-engineering/1-!"6-airline-schedule-planning-spring-!""%/inde#.htm

(NB: 20+ lectures just for schedule planning)
http://ocw.mit.edu/courses/aeronautics-and-astronautics/16-75j-airline-management-spring-2006/index.htmhttp://ocw.mit.edu/courses/aeronautics-and-astronautics/16-75j-airline-management-spring-2006/index.htmhttp://ocw.mit.edu/courses/civil-and-environmental-engineering/1-206j-airline-schedule-planning-spring-2003/index.htmhttp://ocw.mit.edu/courses/civil-and-environmental-engineering/1-206j-airline-schedule-planning-spring-2003/index.htmhttp://ocw.mit.edu/courses/aeronautics-and-astronautics/16-75j-airline-management-spring-2006/index.htmhttp://ocw.mit.edu/courses/civil-and-environmental-engineering/1-206j-airline-schedule-planning-spring-2003/index.htmhttp://ocw.mit.edu/courses/civil-and-environmental-engineering/1-206j-airline-schedule-planning-spring-2003/index.htmhttp://ocw.mit.edu/courses/aeronautics-and-astronautics/16-75j-airline-management-spring-2006/index.htm


4/113

O!er!iew

US

!0000 flights"da#

1$000 %&'s(1 %&''s)

20 %irports


5/113

*urope

0000 flights"da#

20000 %&'s

(0 %&''s) 00 %irports

http:"",,,-slideshare-net"S*S%.*uropeanUnion"sesar/genpresfinal022011
http://www.slideshare.net/SESAREuropeanUnion/sesar-genpresfinal022011http://www.slideshare.net/SESAREuropeanUnion/sesar-genpresfinal022011


6/113

&rac data courtes#


7/113

Annual de"artures and #lig$t $ours%millions&

Boeing Statistical Summar# of 'ommercial et %irplane %ccidents orld,ide 3perations 19)9 / 2010 http:"",,,-4oeing-com"ne,s"techissues"pdf"statsum-pdf
http://www.boeing.com/news/techissues/pdf/statsum.pdfhttp://www.boeing.com/news/techissues/pdf/statsum.pdf


8/113

IF' Flig$ts ( )ear in *+'OCO,T'OLStatistical 'e#erence Area %million&

*U.3'3N&.35 200$ long/term forecasts


9/113

http:"",,,-eurocontrol-int"statfor"galler#"content"pu4lic"forecasts"forecast6leaflet-pdf


10/113

'a"id growt$ attributed to:

7 rising disposa4le income and 8ualit# of life

7 eregulation of aiation la,s; Bilateral and open/s# agreements 4et,een


11/113

Airline -- a maor "la/er

777

7777

900 commercial airlines ,orld,ide>leet: 22000 aircraft1!?0 airports

>e,


12/113

Airline business

3ne of most compleAetails later in this course and program

%irline management:0*')complicated pro4lem

$at to do1


13/113

To"-down a""roac$

7 Split 4ig(er) pro4lemsinto

Small(er) (su4) pro4lems

7 Split decisions into phases

7 Ddentif# (independent) 4usiness processes


14/113

La/ers or 2$ases o# decision

Strategic

Elanning

3perations


15/113

Common too man/ ot$er settings

&his course

7 set up 4# a strategic decision7 5ectures plan is planning

7 3perations phase // each lecture


16/113

Ot$er de#initionsare "ossible

assoud Ba=arganC %irline 3perations and Scheduling


17/113


18/113

Fleet and Crew Management'ore of the planning phase

Strategic

Elanning

3perations


19/113

Airline resources;management "roblems

7 %ircraft;;;;

fleet assignmentaircraft routingflight planningfuel management

>leet management

>light implementation

7 're,; cre, scheduling

7 %irport resources; gate assignment; 4aggage handling

F aircraft routing

S,eden: part of airport%irports course

G sorting facilit# management

G transfer


20/113

%irline Schedule Elanning

Schedule esign

>leet %ssignment

%ircraft .outing

're, Scheduling

Select optimal set oflight legsDn a schedule

%ssign aircraft t#pes to flight legs

&o maAimi=e profit

.oute indiidual aircraftHonoring maintenance

restrictions

%ssign cre, (pilots and"or flight%ttendants) to flight legs

Barnhart 1.206J/16.77J/ESD.215J


21/113

Fleet management

Dnput

7 Schedule

>or each flight:; 3C

; departure time; I of pass

7 >leet

; Num4er of different/t#pe aircraftG e-g-: 2 %10C 1 %$0C B?$?

3utput7 %ssignment of planes to flights


22/113

Fleet assignment

Dnput

7 Schedule


; departure time; I of pass

7 >leet


3utput7 %ssignment of planestypesto flights


23/113

Aircra#t routing

Dnput

7 Schedule


; eparture time; >leet t#pe

3utput7 %ssignment of concrete planes to flights


24/113

Fleet management2roblem decom"osition

Fleet management 3Fleet assignment 4 aircra#t routing

Dnput: schedule (3CCdep timeC paA)C fleet

7 >leet assignment; output: each flight la4eled ,ith aircraft t#pe

7 %ircraft routing:; input: schedule ,ith flights la4eled 4# t#pe

G J output of fleet management; goal: partition (com4ine) lins into routes

3utput: assignment of planes to flight legs


25/113

Fleet assignment


26/113

Fleet assignment

Dnput

7 Schedule

>or each flight:; 3C ; eparture time; I of pass

7 >leet


3utput7 assignment of planestypesto flights


27/113

Ero4lem efinitionlight Schedule7 *ach flight coered eAactl# once 4# one fleet

t#pe7 Num4er of %ircraft 4# *8uipment pe

7 'anKt assign more aircraft than are aaila4leCfor each t#pe7

7

7

&urn &imes 4# >leet pe at each Station3ther .estrictions: aintenanceC lightsC4# >leet pe



28/113

Ero4lem 34jectie>ind:

7

7

7

'ost minimi=ingNB: sometimes a maA pro4lem (profitmaAimi=ing)

assignment of aircraft fleets toscheduled flights such thatmaintenance re8uirements aresatisfiedC conseration of flo,

(4alance) of aircraft is achieedC andthe num4er of aircraft used does noteAceed the num4er aaila4le (in eachfleet t#pe)



29/113

Fleet %3color& assignment

Dnput

7 Schedule

>or each flight:; 3C ; departure time; I of pass

7 >leet

; num4er of different/t#pe aircraftG e-g-:5 A67897 A6896 ;


30/113

Flygtrafik och flygtransporter

>leet %ssignment: *Aample

A

B

C

&o4ias %ndersson


31/113



A

B

C

&o4ias %ndersson


32/113

Sim"le case:Airline wit$ Single Fleet T/"e

%3single color&


33/113

Su"er sim"le case:Airline wit$ a single aircra#t

Fleet %3color& assignment Ero4lem oidL

Dnput

7 Schedule


; departure time

S All #lig$ts ser!ed b/ t$e


34/113

Solutio

n:

All #lig$ts ser!ed b/ t$esame %one and onl/&

aircra#t %t/"e&

; I of pass

7 >leet; num4er of different/t#pe aircraft

G e-g-:5 A67897 A6897 ;


35/113

Still man/ interesting =uestions>

>easi4ilit#7 Ds the gien schedule reali=a4leL

J light

num4er

eparture

time

%rrial

time

eparture

airport

%rrial

airport

1 00 0?0 B '

2 090 112 ' %

1$00 1!00 % B

$ 1?00 191 B %

2100 200 % B

&urn/around time J 0min


36/113

&urn/around time J 0min

Time-ex"anded network&ime/staged net,orC time/line net,or

%rc per flight

>light

num4er

eparture

time

%rrial

time

eparture

airport

%rrial

airport

1 00 0?0 B '

2 090 112 ' %

1$00 1!00 % B

$ 1?00 191 B %

2100 200 % B



37/113



A

B

C

&o4ias %ndersson


38/113


39/113

&ime/5ine Net,or

7


40/113


41/113

x/t


42/113

Line "er air"ort

&ime line

7 time/line net,or

&his course:

7 Mertical line7 &ime goes do,n


43/113

?irected arc %arrow& "er #lig$t

3&ail (start):; departure node

; origin airport; time J departure

Head (end):7 arrial node

7 destination airport7 time J read# time J

%rrial

&urn

.ead#

arrial time +turn around7 read# node

.ead#/time

net,or


44/113

'O, arcs round arcs

Not in this course

(inimal non/triial model)

an# eAtrasDnterconnection nodes

*tc-

No

-offligh

t

s

+a

m


45/113

&ime/5ine Net,or

7Oail#P pro4lem

7 rap/around (or oernight) arcs'ime

(ashington) *.+.

,altimore

ew or

,oston



46/113

&ime/5ine Net,or

7


47/113


48/113


49/113

Interconnectionnodes #orconser!ation

Ti d d % li t d& t k


50/113

Time-ex"anded %-line9 -staged& network'ead/-time network

%ssumption: 3ne operation per time

Df read# J departureC read# is earlier&o implementC slightl# shorten turn time

0min /Q 29min 9sec

Sc$edule


51/113

Sc$eduleturn/around time J 0min

*arliest departure>irst

% B '

>light

num4er

eparture

time

%rrial

time

eparture

airport

%rrial

airport

1 00 0?0 B '

2 090 112 ' %

1$00 1!00 % B

$ 1?00 191 B %

2100 200 % B

*nough to#sR


52/113

*nough to#sRMat$ematical "rogram

Not needed forsingle aircraft (current topic)

7can sole from schedule7can sole ,ith net,or

Not needed formultiple aircraft of single t#pe

7can sole ,ith net,or (neAt topic)

Necessar# for multiple t#pes (our ultimate interest)

7 the onl# ,a# to attac the pro4lem


53/113

2rogramming #ramework

Erogram:

7 Maria4les7 'onstraints7 34jectie

>unction(ost often)


54/113

oal 7 %alwa/s&

Sola4le instance Erogram is feasi4le*Aists at least 1 solution

ars can 4e assigned alues

&hat satisfies all constraints

77

Maria4les'onstraints

Erogram is infeasi4leNo solution %n# alues assigned to ars

Miolate at least 1 constraint

% # &


55/113

oal 5 %most o#ten&

Solution cost 34jectie functionMalue J cost

777

aria4lesconstraintso4jectiefunction

3ptimal solution3ptimal solution


56/113

0ariable "er arc %link&

3 &ail (start):; eparture nodeC d; 3rigin airport

l J 3dr

l J 3(l) (l) d(l) r(l)

AlJ 1C if l is flo,n

AlJ 0C other,ise

d ; &ime J departure

l

Head (end):7 .ead# nodeC r

7 estination airport7 &ime J read# time

r


57/113

0ariable "er 'O, arc

s

AsJ num4er of aircraftoernight atairport (station) s

As0

As


58/113

Constraint "er air"ort

(l)Js s

1

l J 3drl J 3(l) (l) d(l) r(l)

departed + .3N

J

.3N + arried

l:3(l)JsAl

1

1

1

1

3

d


AlJ 0C other,ise

l

J

l:(l)JsAl1

3(l)Js

r


59/113

At what times t


60/113

At what times t

More constraints

1

%t an# time t:

s

1

*o these changes0

7 departed 4# t7 read# 4# t

eparted 4# t

%t most

.ead# 4# t

1

1

1


61/113

Constraint "er de"arture node

%t an# departure&ime d:

s l J 3drl J 3(l) (l) d(l) r(l)

eparted 4# d

%t most d 3


AlJ 0C other,ise

.ead# 4# dd

l:3(l)JsCd(l)TdAl

T

l:(l)JsCr(l)TdAl+As

l

r

Siing %counting& constraints:


62/113

Siing %counting& constraints:'O, arcs

&otal num4er3f planesDs at most 1

AsT 11

1

1

1

1 1


63/113

Fleet Assignment: All Constraints

Eer airport s (flo, conseration)

l:3(l)JsAl J l:(l)JsAl

Eer departure node d (non/negatiit#)

l:3(l)JsCd(l)TdAl T l:(l)JsCr(l)TdAl+As

Si=ing (sum oer .3N arcs)

AsT 1

As0 C

Al=0 or 1


64/113

'ould use


65/113

'ould use

,aming con!entionsa

(3r an# other s#m4ol)

5in

%rc

l J 3drl J 3(l) (l) d(l) r(l)

Dn place of

s

s

Not edge

>light 3


AlJ 0C other,ise As

d

l

r


66/113


67/113


>easi4ilit# SoledR7 Ds the gien schedule reali=a4leL

J easi4ilit#

3ptimi=ation7 aAimi=e the num4er of flights flo,n

; %ssuming not all flights must 4e flo,n

%dd o4jectie function:

maA Al


68/113

Sim"le case:

Airline wit$ Single Fleet T/"e%3single color&

;ut se!eral "lanes

Fleet %3color& assignment Ero4lem oid

Dnput

7 Schedule> h fli ht

Solution:


69/113

>or each flight:; 3C ; departure time

All #lig$ts ser!ed b/ t$eSame %one and onl/&

Aircra#t t/"e; I of pass

7 >leet; Num4er of different/t#pe aircraft

G e-g-:5 A67897 A6896 ;


70/113


>easi4ilit#7

7

7

7

Ds the gien schedule reali=a4leC

,ith the gien num4er of aircraftLJ


71/113

Fleet Assignment: Constraints

Eer airport s (flo, conseration)

l:3(l)JsAlJ l:(l)JsAl

Eer departure node d (non/negatiit#)

l:3(l)JsCd(l)TdAlT l:(l)JsCr(l)TdAl+As

Si=ing (sum oer .3N arcs)

AsT 1N

As

V 0


72/113


>easi4ilit# SoledR7

7

Ds the gien schedule reali=a4leLith the gien num4er of aircraftLJ


73/113

O"timiation "roblems

inimi=e the num4er of planes used; assuming all flights must 4e flo,n

aAimi=e the num4er of flights flo,n; assuming not all flights must 4e flo,n


74/113

Minimie t$e number o# "lanes used

%pproach 1: search for min N until feasi4le

7 Dncremental7 Binar#



AsT NAs0


75/113

Minimie t$e number o# "lanes used

%pproach 2: constraint /Q o4jectie function

minimi=e As



AsT N CAs0


76/113

Maximie t$e number o# #lig$ts #lown

maAimi=e Al



AsT N CAs0

Sim"le case:


77/113

Airline wit$ Single Fleet T/"e%3single color&

>easi4ilit#7Ds the gien schedule reali=a4leC

,ith the gien num4er of aircraftL

9one R

7

7

7

J


78/113

Multi"le Aircra#t T/"es


79/113

Fleet %3color& assignment

Dnput

7 Schedule

>or each flight:

; 3C ; departure time; I of pass

7 >leet

; num4er of different/t#pe aircraftG e-g-:5 A67897 A6896 ;


80/113

,etwork "er color

Schedule


81/113

,etworks are not t$e same

1 schedule entr#

ifferent read#

times


82/113

,etworks are not t$e same

3perational considerations:(non) eAistence of arcs(of certain color)

7 seat capacit#eApected paA7 W3W T flight range7 3C operationall# feasi4le

;;;;

;

run,a# lengthsgatesnoisecurfe,s

maintenance facilitiesC cre, 4ases


83/113

0ariable "er #lig$t and t/"e %color&

onochromatic:


AlJ 0C other,ise

l

AlaJ 1C if l isflo,n 4#a

AlaJ 0C o-,-

la

Al4J 1C if l isflo,n 4#4

Al4J 0C o-,-

l4

AlcJ 1C if l isflo,n 4#c

AlcJ 0C o-,-

lc


84/113

0ariable "er 'O, arc "er color

AsJ .3Nat s

As

0

s

AsaJ .3Nat s of t#pea

Asa0

sa

As4J .3Nat s of t#pe4

As40

s4

AscJ .3Nat s of t#pec

Asc0

sc


85/113

Constraints


86/113

Flow constraints "er color


l:3(l)JsCd(l)TdAlT l:(l)JsCr(l)TdAl+ As

AsT N

la:3(la)JsAlaJ la:(la)JsAla

la:3(la)JsCd(la)TdAlaT l:(la)JsCr(la)TdAla+ Asa

AsaT Na


87/113




AsT N

l4:3(l4)JsAl4J l4:(l4)JsAl4

l4:3(l4)JsCd(l4)TdAl4T l:(l4)JsCr(l4)TdAl4+ As4

As4T N4


88/113




AsT N

lc:3(lc)JsAlcJ lc:(lc)JsAlc

lc:3(lc)JsCd(lc)TdAlcT l:(lc)JsCr(lc)TdAlc+ Asc

AscT Nc


89/113

T$e gluing constraint

Ala+ Al4+ AlcJ 1

AlaJ 1C if l isflo,n 4#a

AlaJ 0C o-,-

la

Al4J 1C if l isflo,n 4#4

Al4J 0C o-,-

l4

AlcJ 1C if l isflo,n 4#c

AlcJ 0C o-,-

lc


90/113

Fleet Assignment: Obecti!e #unction

7 // 'ost; fuel; landing fee; aircraft depreciation

7 + .eenue

clf: Eer leg 4asisC for each fleet t#pe f

min cost: minimi=e clfAlfor maAimi=e profit

O!erall "rogram


91/113

O!erall "rogram

minimi=e clfAlfsu4ject to:

lf:3(lf)JsAlfJ lf:(lf)JsAlffor each airport s and fleet t#pe f

lf:3(lf)JsCd(lf)TdAlfT lf:(lf)JsCr(lf)TdAlf+ Asffor eachdeparture time d and fleet t#pe f

sAsfT Nf

fAlfJ 1AlfJ 0 or 1

AsfV 0

for each fleet t#pe f

for each lin l

>: fleet t#pes S: airportslf: lin l in the net,or for t#pe f from >

sf: .3N arc for airport s from S in the net,or for f

Constraints >: set of fleet t#peslf: flights in the net,or for fsf: .3Ns in the net,or for f


92/113

sf: .3Ns in the net,or for f

3perational: (non) eAistence of arcs (of certaint#pe)

lf:3(lf)JsAlfJ lf:(lf)JsAlf

lf:3(lf)JsCd(lf)TdAlfT lf:(lf)JsCr(lf)TdAlf+ Asf

>lo,:

for f in >C

sAsfT Nf Asf 0 AlfJ 0 or 1 per t#pe

f in >AlfJ 1inter/t#peC gluing

H2Ero4lem


93/113

Model s$ortcomings


94/113

Obecti!e #unction additi!it/

Not taen into account:

'ustomer

7 Spill (and recapture)

7 .eenue per itinerar#C not per leg7 &hrough flight re8uirements7 etc-

3perational

7 %irport fuel management7 &hrough flight re8uirements7 etc-


95/113

Constraints: ,ot taken into account

777

77

aA I of aircraft that can sta# oernight&hrough flight re8uirements%ircraft routing (separate pro4lemR)'re, schedule (separate pro4lemR)etc-


96/113

Model !ariations


97/113

,etwork

777

77

&ime/staged net,or&ime/eApanded net,or&ime/line net,or%rrial/time net,or s-.ead#/time net,or

; our approachC more accurate

7 &ime: hori=ontal or ertical

7 &eAt4oo: interconnection nodesC etc-

T$is course9 im"ortant di##erence 7>


98/113

arc(#lig$t network is ,OT in"ut to

#leet assignment7#lig$t9 turn times de"end on t/"e>

1 schedule entr#

%s man# arcs as

there are t#pes

read# time J

arrial time +turn time

%l,a#s implicit

*Aplicit in this course

T$is course9 im"ortant di##erence 5>


99/113

,o ground arcs

7conser!ation !ia arri!al - de"arture count

7did $a!e 'O, arcs;one "er t/"e

%l,a#s eAplicit

&eAt4oo: Dnterconnection nodes


100/113


101/113

Interconnection

nodes #orconser!ation

&ime/5ine Net,or


102/113

7


103/113

Net,or .epresentation


104/113

Net,or .epresentation

7&opologicall# sorted time/line net,or7 Nodes:

7 >light arrials" departures (time andspace)

7 %rcs:7>light arcs: one arc for each scheduled

flight7


105/113

'onstraints

7'oer 'onstraints7 *ach flight must 4e assigned to eAactl# one

fleet7Balance 'onstraints

7 Num4er of aircraft of a fleet t#pe arriing at astation must e8ual the num4er of aircraft of thatfleet t#pe departing

7%ircraft 'ount 'onstraints7 Num4er of aircraft of a fleet t#pe used cannot

eAceed the num4er aaila4le


34jectie >unction


106/113

>or each fleet / flight com4ination: 'ost X3perating cost73perating cost associated ,ith assigning afleet t#peto a flight legis relatiel#straightfor,ard to compute

7 'an capture range restrictionsC noise restrictionsC,ater restrictionsC etc- 4# assigning OinfiniteP costs


>% Notations i i M i 4l


107/113

7ecision Maria4les7

7

)ie8uals 1 if fleet t#peis assigned to flight legiC and 0

other,isey)o)tis the num4er of aircraft of fleet t#peC on theground at stationoC and timet

7Earameters7

7

7

+)iis the cost of assigning fleet to flight legi

is the num4er of aaila4le aircraft of fleet t#pe

tnis the Ocount timeP

7Sets7

7

7

7

is the set of all flight legsi

2is the set of all fleet t#pes3is the set of all stationso+4is the set of all flight arcs for fleet t#pecrossingthe count time



108/113

Fleet management


109/113

"roblem decom"osition

Fleet management 3#leet assignment 4 aircra#t routing

Dnput: schedule (3CCdep timeC paA)C fleet

7 >leet assignment; output: each flight la4eled ,ith aircraft t#pe

7%ircraft routing:; input: schedule ,ith flights la4eled 4# t#pe

G J output of fleet management; goal: partition (com4ine) lins into routes

3utput: assignment of planes to flight legs

Ai li


110/113

Airline resources

7 %ircraft;;;

;

fleet assignmentaircraft routingflight planning

fuel management

one

5arge topic

7 're,;cre, scheduling

7 %irport resources; gate assignment; 4aggage handling

F aircraft routing

S,eden: part of airport

%irports course

Gsorting facilit# managementG transfer

All
https://docs.google.com/presentation/d/1WQ5utFwFiTCA6k_1v62nwcfM3knxd2P0I8VBYn6TU3U/present#slide=id.gfe845fd_2_0https://docs.google.com/presentation/d/1UsaBtWZaWmZt0X2AQqf63liVDu_CeECoja3XbXKfcis/present#slide=id.gfef8eb3_2_0https://docs.google.com/presentation/d/1WQ5utFwFiTCA6k_1v62nwcfM3knxd2P0I8VBYn6TU3U/present#slide=id.gfe845fd_2_0https://docs.google.com/presentation/d/1UsaBtWZaWmZt0X2AQqf63liVDu_CeECoja3XbXKfcis/present#slide=id.gfef8eb3_2_0


111/113

All "rocesses

%lso in planning andoperations phase

inside .

>ig- 1-$ from teAt

All


112/113

All "rocesses

7

7

Dncludes somedemand forecasting

(part of strategic phase)%ppears also inoperations phase

>ig- 1-$ from teAt


113/113

'e!enue management

?emand modeling
https://docs.google.com/presentation/d/1bEWKsl2h6oi54SbW4gEo26BEn3Zan1WGrOMvyO2VAfI/present#slide=id.gf89a999_3_96https://docs.google.com/presentation/d/1bEWKsl2h6oi54SbW4gEo26BEn3Zan1WGrOMvyO2VAfI/present#slide=id.gf89a999_3_96https://docs.google.com/presentation/d/1bEWKsl2h6oi54SbW4gEo26BEn3Zan1WGrOMvyO2VAfI/present#slide=id.gf89a999_3_96https://docs.google.com/presentation/d/1bEWKsl2h6oi54SbW4gEo26BEn3Zan1WGrOMvyO2VAfI/present#slide=id.gf89a999_3_96

Airline Logistic Fleet and Crew Management

Documents

Transcript of Airline Logistic Fleet and Crew Management