<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1665-6423</journal-id>
<journal-title><![CDATA[Journal of applied research and technology]]></journal-title>
<abbrev-journal-title><![CDATA[J. appl. res. technol]]></abbrev-journal-title>
<issn>1665-6423</issn>
<publisher>
<publisher-name><![CDATA[Universidad Nacional Autónoma de México, Instituto de Ciencias Aplicadas y Tecnología]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1665-64232012000400006</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Considering Competition to Solve a Flight Schedule and Aircraft Routing Problem for Small Airlines]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Díaz-Ramírez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Garzón]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<xref ref-type="aff" rid="A02"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Huertas]]></surname>
<given-names><![CDATA[J. l.]]></given-names>
</name>
<xref ref-type="aff" rid="A02"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,Tecnológico de Monterrey Campus Santa Fe  ]]></institution>
<addr-line><![CDATA[Distrito Federal ]]></addr-line>
<country>México</country>
</aff>
<aff id="A02">
<institution><![CDATA[,Tecnológico de Monterrey Campus Toluca  ]]></institution>
<addr-line><![CDATA[Toluca Estado de México]]></addr-line>
<country>México</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>08</month>
<year>2012</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>08</month>
<year>2012</year>
</pub-date>
<volume>10</volume>
<numero>4</numero>
<fpage>557</fpage>
<lpage>566</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1665-64232012000400006&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1665-64232012000400006&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1665-64232012000400006&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[For the case of low-cost airlines, which are characterized by having a single fleet with a small number of airplanes, in a previous work, a heuristic algorithm (AFS-MRA) was developed to simultaneously find the flight schedule and the aircraft routes subject to maintenance constraints. This work advances this algorithm by incorporating competition in the planning process (MAFS-MRA). Within a time frame with a given demand data, competition is seen as a game with two players (one airline and all its competitors), where the strategies are all the potential origin-destinations that could be included in the flight schedule, and the payment matrix contains the objective function coefficients that depend on the market share and the routes previously selected. Numerical experimentation was undertaken using real data for the case of two airlines that operate at Toluca International Airport in Mexico. It was found that, by considering competition, the occupation improves to 3% and that the number of flights required to satisfy the demand was reduced to 21%. Besides, the updating process reduces the profit computation error in almost 80%, as compared to the real market behavior for the period under study.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[Para el caso de aerolíneas de bajo costo, caracterizadas por tener una flota de aviones, en un trabajo previo los autores desarrollaron un algoritmo heurístico (AFS-MRA) para encontrar el programa de vuelos y las rutas de aviones con restricciones de mantenimiento simultáneamente. Este trabajo mejora este algoritmo incorporando los efectos de la competencia en el proceso de planeación (MAFS-MRA). En un horizonte de tiempo con información de demanda tomada de datos históricos, la competencia se maneja como un juego con dos jugadores (mi aerolínea y todos las demás aerolíneas competidoras), donde las estrategias son todos los potenciales vuelos (orígenes-destinos) que podrían incluirse en el programa de vuelos, y la matriz de pagos contiene los coeficientes de la función objetivo del problema de optimización, los cuales dependen de la participación en el mercado de la aerolínea y de las rutas previamente seleccionadas. Se desarrolló una experimentación numérica usando datos reales de dos aerolíneas que operan en el Aeropuerto lnternacional de Toluca en México. Se encontró que, considerando la competencia, la ocupación mejora en 3%, el número de vuelos necesarios para satisfacer demanda disminuye en 21%. El proceso de actualización reduce los errores en casi 80% cuando se comparan con el comportamiento real del mercado en el período bajo estudio.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Aircraft maintenance routing]]></kwd>
<kwd lng="en"><![CDATA[flight schedule design]]></kwd>
<kwd lng="en"><![CDATA[competition]]></kwd>
<kwd lng="en"><![CDATA[game]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[ <p align="center"><font face="verdana" size="4"><b>Considering Competition to Solve a Flight Schedule and Aircraft Routing Problem for Small Airlines</b></font></p>              <p align="center"><font face="verdana" size="2">&nbsp;</font></p>              <p align="center"><font face="verdana" size="2"><b>J. D&iacute;az&#45;Ram&iacute;rez*<sup>1</sup>, Y. Garz&oacute;n<sup>2</sup>, J. l. Huertas<sup>3</sup></b></font></p>              <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>              <p align="justify"><font face="verdana" size="2"><i><sup>1</sup> Tecnol&oacute;gico de Monterrey Campus Santa Fe, Distrito Federal, M&eacute;xico,</i> *<a href="mailto:jenny.diaz@itesm.mx">jenny.diaz@itesm.mx</a>.</font></p>              <p align="justify"><font face="verdana" size="2"><i><sup>2, 3</sup> Tecnol&oacute;gico de Monterrey Campus Toluca, Toluca, Estado de M&eacute;xico, M&eacute;xico.</i></font></p>              <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>              <p align="justify"><font face="verdana" size="2"><b>ABSTRACT</b></font></p>              <p align="justify"><font face="verdana" size="2">For the case of low&#45;cost airlines, which are characterized by having a single fleet with a small number of airplanes, in a previous work, a heuristic algorithm (AFS&#45;MRA) was developed to simultaneously find the flight schedule and the aircraft routes subject to maintenance constraints. This work advances this algorithm by incorporating competition in the planning process (MAFS&#45;MRA).</font></p>              <p align="justify"><font face="verdana" size="2">Within a time frame with a given demand data, competition is seen as a game with two players (one airline and all its competitors), where the strategies are all the potential origin&#45;destinations that could be included in the flight schedule, and the payment matrix contains the objective function coefficients that depend on the market share and the routes previously selected.</font></p>              ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2">Numerical experimentation was undertaken using real data for the case of two airlines that operate at Toluca International Airport in Mexico. It was found that, by considering competition, the occupation improves to 3% and that the number of flights required to satisfy the demand was reduced to 21%. Besides, the updating process reduces the profit computation error in almost 80%, as compared to the real market behavior for the period under study.</font></p>              <p align="justify"><font face="verdana" size="2"><b>Keywords:</b> Aircraft maintenance routing, flight schedule design, competition, game.</font></p>              <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>             <p align="justify"><font face="verdana" size="2"><b>RESUMEN</b></font></p>             <p align="justify"><font face="verdana" size="2">Para el caso de aerol&iacute;neas de bajo costo, caracterizadas por tener una flota de aviones, en un trabajo previo los autores desarrollaron un algoritmo heur&iacute;stico (AFS&#45;MRA) para encontrar el programa de vuelos y las rutas de aviones con restricciones de mantenimiento simult&aacute;neamente. Este trabajo mejora este algoritmo incorporando los efectos de la competencia en el proceso de planeaci&oacute;n (MAFS&#45;MRA).</font></p>              <p align="justify"><font face="verdana" size="2">En un horizonte de tiempo con informaci&oacute;n de demanda tomada de datos hist&oacute;ricos, la competencia se maneja como un juego con dos jugadores (mi aerol&iacute;nea y todos las dem&aacute;s aerol&iacute;neas competidoras), donde las estrategias son todos los potenciales vuelos (or&iacute;genes&#45;destinos) que podr&iacute;an incluirse en el programa de vuelos, y la matriz de pagos contiene los coeficientes de la funci&oacute;n objetivo del problema de optimizaci&oacute;n, los cuales dependen de la participaci&oacute;n en el mercado de la aerol&iacute;nea y de las rutas previamente seleccionadas.</font></p>              <p align="justify"><font face="verdana" size="2">Se desarroll&oacute; una experimentaci&oacute;n num&eacute;rica usando datos reales de dos aerol&iacute;neas que operan en el Aeropuerto lnternacional de Toluca en M&eacute;xico. Se encontr&oacute; que, considerando la competencia, la ocupaci&oacute;n mejora en 3%, el n&uacute;mero de vuelos necesarios para satisfacer demanda disminuye en 21%. El proceso de actualizaci&oacute;n reduce los errores en casi 80% cuando se comparan con el comportamiento real del mercado en el per&iacute;odo bajo estudio.</font></p>              <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>              <p align="justify"><font face="verdana" size="2"><a href="/pdf/jart/v10n4/v10n4a6.pdf" target="_blank">DESCARGAR ART&Iacute;CULO EN FORMATO PDF</a></font></p>              <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>              ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2"><b><i>References</i></b></font></p>              <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;1&#93; International Air Transport Association. IATA Economic Briefing: The impact of recession on air traffic volumes. 2008.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4862695&pid=S1665-6423201200040000600001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>              <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;2&#93; D. Klabjan. "Large Scale Models in the Airline Industry". In G. Desaulniers et al. (eds), Column Generation. Springer US, 2005, pp 163&#45;195.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4862697&pid=S1665-6423201200040000600002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>              <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;3&#93; D. Klabjan, et al. "Solving Large Airline Crew Scheduling problem: Random Pairing Generation and Strong Branching". Computatiional Optimization and Algorithms, vol. 20, pp. 73&#45;91, 2001</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4862699&pid=S1665-6423201200040000600003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">&#91;4&#93; C. Barnhart, and A. Cohn. "Airline Scheduling Problems: Accomplishments and opportunities", Manufacturing &amp; Service Operations Management, vol. 6, no.1, 2004</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4862700&pid=S1665-6423201200040000600004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">&#91;5&#93; C. Barnhart et al. "Flight Strings Models for Aircraft Fleeting and Routing", Transportation Science, vol. 32, no. 3, 1998.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4862701&pid=S1665-6423201200040000600005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>              <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;6&#93; J. D&iacute;az. "An Integrated approach for the single&#45;fleet aircraft and crew scheduling problems". Toluca : Ph.D. Thesis, Tecnologico de Monterrey Campus Toluca, Toluca, 2007.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4862703&pid=S1665-6423201200040000600006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>              <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;7&#93; flylowcostairlines. flylowcostairlines. &#91;Online&#93; 2011. &#91;retrieved: February 8, 2011.&#93; <a href="http://www.flylowcostairlines.org" target="_blank">www.flylowcostairlines.org</a>.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4862705&pid=S1665-6423201200040000600007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>              <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;8&#93; S. Monsalve. "John Nash and Game Theory". Original Language: Spanish, Bogota : Universidad Nacional de Colombia, Lecturas Matem&aacute;ticas, vol. 24,  pp. 137&#45;149, 2003.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4862707&pid=S1665-6423201200040000600008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>              <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;9&#93; H. Kuhn. "Lectures on the Theory of Games", Princeton University Press IX. 2003</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4862709&pid=S1665-6423201200040000600009&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">&#91;10&#93; F. Vega&#45;Redondo. "Economics and the Theory of Games". Cambridge: Cambridge University Press, 2003.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4862710&pid=S1665-6423201200040000600010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>              <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;11&#93; Secretaria de Comunicaciones y Transporte. &#91;Online&#93; Statistics. <a href="http://www.sct.gob.mx" target="_blank">www.sct.gob.mx</a>. Original Language: Spanish.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4862712&pid=S1665-6423201200040000600011&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>              ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;12&#93; C. Sugar and G. M. James. "Finding the Number of Clusters in a Dataset: An Information&#45;Theoritec Approach". Journal of the American Statistical Association, no. 463, pp. 750&#45;763, 2003, DOI: 10.1198/016214503000000666.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4862714&pid=S1665-6423201200040000600012&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>              <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;13&#93; D. Tasoulis and M. Vrahatis. "Generalizing the k&#45;Windows Clustering Algorithm in Metric Spaces", Mathematical and Computer Modellling, 2007.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4862716&pid=S1665-6423201200040000600013&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>              <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;14&#93; X&#45;T. Zhang et al. "A model&#45;based clustering for time series with irregular interval". Proceedings of the Third International Conference on Machine Learning and Cybernetics, vol. 5, pp. 2883 &#45; 2888. 2004. DOI:  10.1109/ICMLC.2004.1378524.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4862718&pid=S1665-6423201200040000600014&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>              <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;15&#93; T. Calinski and J. Harabasz. "A dendrite method for cluster analysis". Communications in Statistics, vol. 3, no.  1, pp. 1&#45;27, 1974.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4862720&pid=S1665-6423201200040000600015&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>              <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;16&#93; Direcci&oacute;n Nacional de Aeron&aacute;utica. "Monthly Statistical Report by Origin&#45;Destination 2008". Original Language: Spanish: <a href="http://dgac.sct.gob.mx/" target="_blank">http://dgac.sct.gob.mx/</a> Retrieved on March 19th, 2008.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4862722&pid=S1665-6423201200040000600016&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>              ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;17&#93; International Air Transport Association. "IATA Annual Report". 2008.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4862724&pid=S1665-6423201200040000600017&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>              <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;18&#93; International Air Transport Association IATA. "IATA Economic Briefing Airline Profitability 2006, 2007.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4862726&pid=S1665-6423201200040000600018&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>              <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;19&#93; Secretar&iacute;a de Desarrollo Econ&oacute;mico. Gobierno del Estado de M&eacute;xico. &#91;Online&#93; GDP Indicators in the State of Mexico,=Mexico.=,=2007. <a href="http://www1.edomexico.gob.mx/sedeco/" target="_blank">http://www1.edomexico.gob.mx/sedeco/</a>. Original Language: Spanish.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4862728&pid=S1665-6423201200040000600019&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>       ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="">
<collab>International Air Transport Association</collab>
<source><![CDATA[IATA Economic Briefing: The impact of recession on air traffic volumes]]></source>
<year>2008</year>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Klabjan]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Large Scale Models in the Airline Industry]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Desaulniers]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Column Generation]]></source>
<year>2005</year>
<page-range>163-195</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Klabjan]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Solving Large Airline Crew Scheduling problem: Random Pairing Generation and Strong Branching]]></article-title>
<source><![CDATA[Computatiional Optimization and Algorithms]]></source>
<year>2001</year>
<volume>20</volume>
<page-range>73-91</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Barnhart]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Cohn]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Airline Scheduling Problems: Accomplishments and opportunities]]></article-title>
<source><![CDATA[Manufacturing & Service Operations Management]]></source>
<year>2004</year>
<volume>6</volume>
<numero>1</numero>
<issue>1</issue>
</nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Barnhart]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Flight Strings Models for Aircraft Fleeting and Routing]]></article-title>
<source><![CDATA[Transportation Science]]></source>
<year>1998</year>
<volume>32</volume>
<numero>3</numero>
<issue>3</issue>
</nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Díaz]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[An Integrated approach for the single-fleet aircraft and crew scheduling problems]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="">
<collab>flylowcostairlines</collab>
<source><![CDATA[flylowcostairlines]]></source>
<year>2011</year>
</nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Monsalve]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[John Nash and Game Theory]]></source>
<year>2003</year>
<volume>24</volume>
<page-range>137-149</page-range><publisher-loc><![CDATA[Bogota ]]></publisher-loc>
<publisher-name><![CDATA[Universidad Nacional de Colombia]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kuhn]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Lectures on the Theory of Games]]></source>
<year>2003</year>
<publisher-name><![CDATA[Princeton University Press IX]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vega-Redondo]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Economics and the Theory of Games]]></source>
<year>2003</year>
<publisher-loc><![CDATA[Cambridge ]]></publisher-loc>
<publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="">
<collab>Secretaria de Comunicaciones y Transporte</collab>
<source><![CDATA[Statistics]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sugar]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[James]]></surname>
<given-names><![CDATA[G. M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Finding the Number of Clusters in a Dataset: An Information-Theoritec Approach]]></article-title>
<source><![CDATA[Journal of the American Statistical Association]]></source>
<year>2003</year>
<numero>463</numero>
<issue>463</issue>
<page-range>750-763</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tasoulis]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Vrahatis]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Generalizing the k-Windows Clustering Algorithm in Metric Spaces]]></article-title>
<source><![CDATA[Mathematical and Computer Modellling]]></source>
<year>2007</year>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[X-T.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A model-based clustering for time series with irregular interval]]></article-title>
<source><![CDATA[Proceedings of the Third International Conference on Machine Learning and Cybernetics]]></source>
<year>2004</year>
<volume>5</volume>
<page-range>2883 - 2888</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Calinski]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Harabasz]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A dendrite method for cluster analysis]]></article-title>
<source><![CDATA[Communications in Statistics]]></source>
<year>1974</year>
<volume>3</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-27</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="">
<collab>Dirección Nacional de Aeronáutica</collab>
<source><![CDATA[Monthly Statistical Report by Origin-Destination 2008]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="">
<collab>International Air Transport Association</collab>
<source><![CDATA[IATA Annual Report]]></source>
<year>2008</year>
</nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="">
<collab>International Air Transport Association</collab>
<source><![CDATA[IATA Economic Briefing Airline Profitability 2006]]></source>
<year>2007</year>
</nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="">
<collab>Gobierno del Estado de México^dSecretaría de Desarrollo Económico</collab>
<source><![CDATA[GDP Indicators in the State of Mexico,=Mexico.=]]></source>
<year>2007</year>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
