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

 
<record>
 <datafield tag="088" ind1="" ind2="">
  <subfield code="a">Pacheco_ORBEL_2018</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">Pacheco, Meritxell</subfield> 
  </datafield>
 <datafield tag="700" ind1="" ind2="">
  <subfield code="a">Sharif Azadeh, Shadi</subfield> 
  </datafield>
 <datafield tag="700" ind1="" ind2="">
  <subfield code="a">Bierlaire, Michel</subfield> 
  </datafield>
 <datafield tag="700" ind1="" ind2="">
  <subfield code="a">Gendron, Bernard</subfield> 
  </datafield>
<datafield tag="245" ind1="" ind2="">
<subfield code="a">
Integrating advanced discrete choice models in mixed integer linear optimization</subfield>
</datafield>
<datafield tag="260" ind1="" ind2="">
<subfield code="c">2018</subfield>
</datafield>
<datafield tag="711" ind1="2" ind2="">
<subfield code="a">
ORBEL 32 Conference </subfield>
<subfield code="c">
HEC Liège, Liège, Belgium</subfield>
<subfield code="d">February 02, 2018</subfield>
</datafield>
<datafield tag="520" ind1="" ind2="">
<subfield code="a">
The integration of choice models in mixed integer linear programming (MILP) is appealing to operators because it provides a better understanding of the preferences of customers while planning for their systems. However, the complexity of choice models leads to mathematical formulations that are highly nonlinear and non convex in the variables of interest, and therefore difficult to be included in MILP. In this research, we present a general framework that overcomes these limitations by relying on simulation to integrate advanced discrete choice models in MILP formulations.</subfield>
</datafield>
  </record>



  </collection>
