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

 
<record>
 <datafield tag="088" ind1="" ind2="">
  <subfield code="a">ARP_TRIS07</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">Bierlaire, Michel</subfield> 
  </datafield>
 <datafield tag="700" ind1="" ind2="">
  <subfield code="a">Salani, Matteo</subfield> 
  </datafield>
<datafield tag="245" ind1="" ind2="">
<subfield code="a">
Airline Disruptions: Aircraft Recovery with Maintenance Constraints</subfield>
</datafield>
<datafield tag="260" ind1="" ind2="">
<subfield code="c">2007</subfield>
</datafield>
<datafield tag="711" ind1="2" ind2="">
<subfield code="a">
TRISTAN VI</subfield>
<subfield code="c">
Phuket (Thailand)</subfield>
<subfield code="d">June 12, 2007</subfield>
</datafield>
<datafield tag="520" ind1="" ind2="">
<subfield code="a">
 In this paper we consider the recovery of an airline schedule after an unforeseen event, commonly called disruption, that makes the planned schedule unfeasible. In particular we consider the aircraft recovery problem for an heterogeneous fleet of aircrafts, made of regular and reserve planes, where the maintenance constraints are explicitly taken into account. We propose a multicommodity network flow model, where each commodity represents a plane, a dynamic programming algorithm to build the underlying network and an heuristic algorithm based on column generation. We provide some computational results on instances obtained from a medium-sized airline. </subfield>
</datafield>
  </record>



  </collection>
