1

DMD

Data, Models and Decisions

Professor Christos D. Tarantilis

Director of the Operations Research and Decision Systems Center
https://gr.linkedin.com/in/tarantilis
e-mail: tarantil@aueb.gr

AUEB MBA International Part-Time 2016 -2017

2

CREW SCHEDULING
DMD

•  One of the most economically significant opera5ons

management problems to be found in air cargo industry is the
scheduling of crews of aircra:s. Crew costs account for
approximately 15% of every air cargo company's total expenses.

•  The crew planning process begins with the flight schedule, which
lists all of the trips that must be flown.

•  A trip is one flight segment, i.e., one take-off and one landing.
Trips are linked together to form pairings. A pairing is a
sequence of trips which together make up a round trip,
beginning and ending at a crew base. Many admissible pairings
can be generated from the given set of trips.
AUEB MBA International Part-Time 2016 -2017
3

CREW SCHEDULING
DMD
•  Suppose an air cargo company owns three
aircra:s. Aircra:s and crew bases are
located in Athens.
•  In order to reduce crew costs
–  crew must return to the crew’s base
un5l the end of each day.
–  a round trip is performed strictly by one
aircra:.
–  An aircra: cannot replace its crew
before a round trip is performed.
–  a crew is not also allowed to work in
non-successive trips of the same
aircra:.
AUEB MBA International Part-Time 2016 -2017
4

CREW SCHEDULING
DMD
•  Payments of the crew are determined as follows:
–  From one to five daily working hours , all the crew
members are paid 75% of the base salary (i.e. 1.500
euros in total);
–  More than five to eight daily working hours , crew is
paid the base salary (i.e. 2.000 euros in total);
–  More than eight daily working hours, crew is paid
200% of the base salary (i.e. 4.000 euros in total);

The objec5ve is to determine the number of the round trips covering

all the trips and minimizing the daily total crew costs.
Use a GCS to solve the problem.

AUEB MBA International Part-Time 2016 -2017

5

CREW SCHEDULING
DMD
•  The flight schedule is as follows:
For the second aircra7
For the first aircra7 G ATH-THES 9.30-11.30
Α ATH-RHO 8.30 - 9.30 H THES-ATH 12.00-14.00
Β RHO-ATH 10.00 - 11.00 Ι ATH-THES 14.30-16.30
C ATH-RHO 11.30 - 12.30 J THES-ATH 17.00-19.00
D RHO-ATH 13.00 - 14:00 For the third aircra7
Ε ATH-RHO 14.30 - 15.30 K ATH-THES 9.00-11.00
F RHO-ATH 16.00 - 17.00 L THES-SKOP 11.30-12.30
M SKOP-ATH 12.45-14.00
N ATH-THES 14.30-16.30
Ο THES-SKOP 17.00-18.00
P SKOP-ATH 18.15-19.30
6

CREW SCHEDULING
DMD
•  A GCS contains the following stages:
–  Solution Structure:
A number of round trips (group of trips Sk) covering the 16 trips.
–  Solution Component:
The solution component added to the partial solution is a group Sk
which represents a round trip.
–  Selection Criterion:
The selection criterion is used to select the “best” feasible
candidate component which is added to the “partial” solution of
the problem.
Select the group/round trip which minimizes the criterion
f(Sk)=COST(Sk)/N(Sk), where N(Sk) is the number of the trips of the
round trip Sk that they have not included in the partial solution
yet.
–  Evaluation Criterion:
The total crew cost required to cover the 16 trips.
7

CREW SCHEDULING
DMD
Itera5on 1: Rank the round trips (groups) according to the Selec5on
Criterion:
(Α,Β,C,D), 2000/4=500 (Α,Β), 1500/2=750
(C,D,Ε,F), 2000/4 = 500 (C,D), 1500/2=750
(K,L,M), 1500/3=500 (Ε,F), 1500/2=750
(N,Ο,P), 1500/3=500 (Ι,J), 1500/2=750

(Α,Β,C,D,Ε,F), 4000/6= 667 (G,Η), 1500/2=750

(K,L,M,N,Ο,P), 4000/6=667 (G,Η,Ι,J), 4000/4=1000

Round trips (Α,Β,C,D), (C,D,Ε,F), (K,L,M) and (N,Ο,P) sa5sfy the Selec5on
Criterion in the best way. For this reason, the solu5on component added
to the par5al solu5on (i.e. (Α,Β,C,D)) is selected stochas5cally. Thus, s:
{(Α,Β,C,D)}.
8

CREW SCHEDULING
DMD
Itera5on 2: Based on the selec5on criterion, the new ranking of the round
trips is the following:

(K,L,M) 1500/3=500

(N,Ο,P) 1500/3=500
(K,L,M,N,Ο,P) 4000/6=667

(Ε,F) 1500/2=750
(Ι,J) 1500/2=750
(G,Η) 1500/2=750

(G,Η,Ι,J) 4000/4=1000
(C,D,Ε,F) 2000/2 = 1000

(Α,Β,C,D,Ε,F) 4000/2=2000

Round trips (K,L,M) and (N,Ο,P) sa5sfy the Selec5on Criterion in the best
way, therefore, (K,L,M) is selected stochas5cally. Thus, s: {(Α,Β,C,D), (K,L,M)}.
9

CREW SCHEDULING
DMD
Itera5on 3:
(N,Ο,P) 1500/3=500

(Ε,F) 1500/2=750

(Ι,J) 1500/2=750

(G,Η) 1500/2=750
(G,Η,Ι,J) 4000/4=1000

(C,D,Ε,F) 2000/2 = 1000

(K,L,M,N,Ο,P) 4000/3=1333,3
(Α,Β,C,D,Ε,F) 4000/2=2000
For the same reason, round trip (N,Ο,P) is selected, thus,
s: {(Α,Β,C,D),(K,L,M),(N,O,P)}.
10

CREW SCHEDULING
DMD

Itera5on 4:

(Ι,J) 1500/2=750
(Ε,F) 1500/2=750
(G,Η) 1500/2=750
(G,Η,Ι,J) 4000/4=1000

For the same reason, round trip (I,J) is selected stochas5cally, thus,
s: {(Α,Β,C,D),(K,L,M),(N,O,P),(Ι,J)}.
11

CREW SCHEDULING
DMD

Itera5on 5:

(G,Η) 1500/2=750

(Ε,F) 1500/2=750
(G,Η,Ι,J) 4000/2=2000

The round trip (G,H) is added to the par5al solu5on s. Thus,
s: {(Α,Β,C,D),(K,L,M),(N,O,P),(Ι,J),(G,Η)}, and the cost is:
12

CREW SCHEDULING
DMD

Itera5on 6:

(Ε,F) 1500/2=750


The round trip (E,F) is added to the par5al solu5on s. Thus, the
complete solu5on s is:
s: {(Α,Β,C,D),(K,L,M),(N,O,P),(Ι,J),(G,Η), (E,F)}, and the cost is:
c(s)= 2000+1500+1500+1500+1500+1500=9500
13

DMD

QUESTIONS ?

AUEB MBA International Part-Time 2016 -2017