BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Multi-Objective Airport Gate Assignment for a Large Airline: Sched
 ule Plannig and Day of Operations
DTSTART:20090928T110000
DTSTAMP:20260407T101235Z
UID:cdd1d23baeaea6e988ba1168afeb7afa339935d8c6fcd7ff538ad14b
CATEGORIES:Conferences - Seminars
DESCRIPTION:Dr Prem Kumar Viswanathan\, Indian Instuîtute of Management\,
  Bangalore\nIn this paper\, we consider the gate assignment for a large ai
 rline at its hub airport. The problem is considered in both modes – plan
 ning as well as operations. The first objective in planning mode assigns a
 irport gates dynamically to scheduled flights based on daily origin and de
 stination passenger flow data ensuring that maximum connection revenue is 
 realized. The second objective aims to schedule flights to gates in as few
  manpower zones as possible. This would help reduce the operating costs fo
 r the airline. The third objective ensures that gate rest\, i.e. the gate 
 idle time between an outgoing and the next incoming flight\, is kept to th
 e maximum possible so that extent of re-gating is minimized in the eventua
 lity of successive flight delays.\nOne of the major contributions of this 
 paper is gate assignment in the operations mode to account for real-time d
 elays and disruptions to the planned schedule. This would entail making de
 viations to the existing assignment plan and retiming flights marginally i
 n extreme situations when the existing gate infrastructure cannot handle a
 ll the flights. It is important that our solution technique is fast enough
  to produce this operational solution within a few seconds.\nWe formulate 
 these problems as mixed 0-1 integer program with a linear objective functi
 on and constraints. Due to the complexity in the problem size and formulat
 ion\, we have resorted to relaxation for certain instances when a reasonab
 le solution is not obtained within the time limit. Problem formulation for
  flight retiming in the operations mode has been borrowed from the concept
 s of resource constrained project scheduling. Implementation is done using
  OPL and computational results for actual data sets are presented.
LOCATION:GC B3 424
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR