<?phpxml version="1.0" encoding="ISO-8859-1"?>
 <collection>
  

 
<record>
 <datafield tag="088" ind1="" ind2="">
  <subfield code="a">EGG_MIT</subfield> 
  </datafield>
<datafield tag="909" ind1="C" ind2="0">
<subfield code="p">TRANSP-OR</subfield>
</datafield>
<datafield tag="980" ind1="" ind2="">
<subfield code="a">TALK</subfield>
</datafield>
 <datafield tag="700" ind1="" ind2="">
  <subfield code="a">Eggenberg, Niklaus</subfield> 
  </datafield>
 <datafield tag="700" ind1="" ind2="">
  <subfield code="a">Salani, Matteo</subfield> 
  </datafield>
<datafield tag="245" ind1="" ind2="">
<subfield code="a">
Uncertainty Feature Optimization for the Airline Scheduling Problem</subfield>
</datafield>
<datafield tag="260" ind1="" ind2="">
<subfield code="c">2009</subfield>
</datafield>
<datafield tag="711" ind1="2" ind2="">
<subfield code="a">
NSF Seminars</subfield>
<subfield code="c">
Massachusetts Institute of Technology, Boston, MA</subfield>
<subfield code="d">February 04, 2009</subfield>
</datafield>
<datafield tag="520" ind1="" ind2="">
<subfield code="a">
Uncertainty Feature Optimization is a framework to cope with optimization problems due to noisy data, using an implicit characterazation of the noise. The Aircraft Scheduling Problem (ASP) is a particular case of such problems, where disruptions randomly perturbate the original flight schedule. 
This study uses the UFO framework to generate more robust and recoverable schedules, in the sense that more delays are absorbed and when re-optimization is required, the corresponding recovery costs are reduced. 
We provide computational results for the public data of an European airline provided for the ROADEF Challenge 2009 footnote{\texttt{http://challenge.roadef.or /2009/index.en.htm}}; new schedules are computed with different models, and we compare the a posteriori results obtained by the application of a recovery algorithm.</subfield>
</datafield>
  </record>



  </collection>
