Scribd
Upload
54 views8 pages

Case 3: The ABC Airline Problem: Shikhi - 231143 SNEHASHISH - 231174

The document discusses scheduling flights between Hyderabad and Delhi for an airline. It provides the flight times and calculates the minimum layover times between flights to determine the optimal flight schedule using the Hungarian method.

Uploaded by

Vivek Chavan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
54 views8 pages

Case 3: The ABC Airline Problem: Shikhi - 231143 SNEHASHISH - 231174

The document discusses scheduling flights between Hyderabad and Delhi for an airline. It provides the flight times and calculates the minimum layover times between flights to determine the optimal flight schedule using the Hungarian method.

Uploaded by

Vivek Chavan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Case 3: The ABC Airline

Problem
- SHI KHI 231143
- SNEHASHI SH - 231174
Flight Time Table
Hyderabad - Delhi Delhi - Hyderabad
Flight No. Departure Arrival Flight No.

Departure Arrival
A1 6 AM 8 AM B1 8 AM 10 AM
A2 8 AM 10 AM B2 9 AM 11 AM
A3 2 PM 4 PM B3 2 PM 4 PM
A4 8 PM 10 PM B4 7 PM 9 PM
MINIMUM LAYOVER TIME BETWEEN FLIGHTS MUST BE 5 HOURS
For Hyderabad Crew
Difference between arrival time for New Delhi & departure time for New
Delhi = Layover time
B1 B2 B3 B4
A1
24 hr (8 AM 8
AM)
25 hr (8 AM - 9
AM)
6 hr (8 AM 2
PM)
11 hr (8 AM 7
PM)
A2
22 hr (10 AM 8
AM)
23 hr (10 AM 9
AM)
28 hr (10 AM 2
PM)
9 hr (10 AM 7
PM)
A3
16 hr (4 PM 8
AM)
17 hr (4 PM 9
AM)
22 hr (4 PM 2
PM)
27 hr (4 PM 7
PM)
A4
12 hr (10 PM 8
AM)
13 hr (10 PM 9
AM)
16 hr (10 PM 2
PM)
21 hr (10 PM 7
PM)
For New Delhi Crew
Difference between arrival time for Hyderabad & departure time for
Hyderabad = Layover time
B1 B2 B3 B4
A1
20 hr (10 AM 6
AM)
19 hr (11 AM - 6
AM)
14 hr (4 PM 6
AM)
9 hr (9 PM 6
AM)
A2
22 hr (10 AM 8
AM)
21 hr (11 AM 8
AM)
16 hr (4 PM 8
AM)
11 hr (9 PM 8
AM)
A3
28 hr (10 AM 2
PM)
27 hr (11 AM 2
PM)
22 hr (4 PM 2
PM)
17 hr (9 PM 2
PM)
A4
10 hr (10 AM 8
PM)
9 hr (11 AM 8
PM)
28 hr (4 PM 8
PM)
23 hr (9 PM 8
PM)
The composite layover matrix is made by selecting the
smaller element from the two above tables. Red
represents New Delhi, else Hyderabad.
B1 B2 B3 B4
A1
20 19 6 9
A2
22 21 16 9
A3
16 17 22 17
A4
10 9 16 21
Now solving by Hungarian method as this is a
minimization problem for layover time. Performing row
reduction.
B1 B2 B3 B4
A1
14 13 0 3
A2
13 12 7 0
A3
0 1 6 1
A4
1 0 6 11
The obtained solution is as follows:
A1 B3 6 hr - Hyderabad
A2 B4 9 hr - Hyderabad
A3 B1 16 hr - Hyderabad
A4 B2 9 hr - New Delhi

The layover comes out to be 6+9+16+9 = 40 hours.

You might also like