Case- Airlines

Case Discussion

We have given a time table of an airline company, which provides service between Jaipur and Delhi The crew must have a layover time of 5 hours The Time Table is shown on the next slide

Time Table of the Airline

The cost of service to the Airline company depends on the Traveling as well as the Waiting time spent by the crew. We have to connect the airlines in such a way that it minimizes the waiting time. This is a typical case of a Standard Assignment problem which will be solved by the Hungarian Algorithm.

For its application it is assumed that: 1) All of the Cs of the starting cost matrix are non negative integers. 2) The assignment problem is of minimization case. Minimization of layover time is what we have to focus on. Also we station the crew first at one airport, and then to other to get our initial table.

Layover Time At Jaipur 201 0 23 17.5 12.5 202 .5 23.5 18 13 203 4 3 22 17 204 9.5 8.5 3 22

101 102 103 104

Layover Time At Delhi 201 101 102 103 104 21.75 22.75 4.25 9.25 202 21.25 22.25 3.75 8.75 203 17.75 18.75 .25 5.25 204 12.25 13.25 18.75 25.75

Combining both the tables and taking the values more than 5 (waiting time constraint) 201 101 102 103 104 21.75 22.75 17.5 9.25 202 21.25 22.25 18 8.75 203 17.75 18.75 21.5 5.25 204 9.5 8.5 18.75 22

Taking out the minimum value of each row and subtracting it from the respective rows 201 12.25 14.25 0 4 202 11.75 13.75 .5 3.5 203 8.25 10.25 4 0 204 0 0 1.25 16.75

101 102 103 104

Similarly, Taking out the minimum value of each column and subtracting it from the respective columns 201 101 102 103 104 12.25 14.25 0 4 202 11.25 13.25 0 3 203 8.25 204 0

10.25 0 4 0 1.25 16.75

101 102 103 104

201 12.25 14.25 0 4

202 11.25 13.25 0 3

203 8.25 10.25 4 0

204 0 0 1.25 16.75

101 102 103 104

201 4 6 0 4

202 3 5 0 3

203 0 2 4 0

204 0 0 9.5 25

Case 1

201 101 102 103 104 1 3 0 1

202 0 2 0 0

203 0 2 7 0

204 0 0 12.5 25

Case 2 201 101 102 103 104 1 3 0 1 202 0 2 0 0 203 0 2 7 0 204 0 0 12.5 25

Flight 101 is connected with flight 202, and stopover time is 21 hours 15 minutes at Delhi Flight 102 is connected with flight 204, and stopover time is 8 hours 30 minutes is at Jaipur Flight 103 is connected with flight 201, and stopover time is 17 hours 30 minutes at Jaipur Flight 104 is connected with flight 203, and stopover time is 5 hours 15 minutes at Delhi TOTAL HALT TIME PERTAINING TO MINIMUM COSTCOMES OUT TO BE = 17.75 + 8.5 + 17.5 + 5.25 = 52.5 HRS