<?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>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462016000400623</article-id>
<article-id pub-id-type="doi">10.13053/cys-20-4-2504</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Performance Comparison of Evolutionary Algorithms for University Course Timetabling Problem]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rodríguez Maya]]></surname>
<given-names><![CDATA[Noel]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Flores]]></surname>
<given-names><![CDATA[Juan J.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rodríguez Rangel]]></surname>
<given-names><![CDATA[Héctor]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Instituto Tecnológico de Zitácuaro Departamento de Sistemas y Computación ]]></institution>
<addr-line><![CDATA[ Michoacán]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Michoacana de San Nicolás de Hidalgo Facultad de Ingeniería Eléctrica ]]></institution>
<addr-line><![CDATA[Morelia Michoacán]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Instituto Tecnológico de Culiacán Departamento de Estudios de Posgrado e Investigación ]]></institution>
<addr-line><![CDATA[ Sinaloa]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2016</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2016</year>
</pub-date>
<volume>20</volume>
<numero>4</numero>
<fpage>623</fpage>
<lpage>634</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462016000400623&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462016000400623&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462016000400623&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract In literature, University Course Timetabling Problem (UCTP) is a well known combinational problem. The main reasons to study this problem are the intrinsic importance at the interior of universities, the exponential number of solutions, and the distinct types of approaches to solve this problem. Due to the exponential number of solutions (combinations), this problem is categorized as NP-hard. Generally, Evolutionary Algorithms (EA) are efficient tools to solve this problem. Differential Evolution (DE) has been widely used to solve complex optimization problems on the continuous domain, Genetic Algorithms (GA) has been adopted to solve different types of problems and even as point of comparison between algorithms performance. This paper examines and compares the performance depicted by two approaches based on EA to solve the UCTP: the DE and the GA approaches. The experiments use a set of 3 real life UCTP instances, each instance contains different characteristics and are based on Mexican universities. In the experiments, we used the optimal input parameters for the solvers, and we performed a qualitative-quantitative comparison between the final solutions. The results showed the best performance for the solution based on the DE algorithm. This work can be easily extended to use other algorithms and UCTP instances.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[University course timetabling problem]]></kwd>
<kwd lng="en"><![CDATA[evolutionary algorithms]]></kwd>
<kwd lng="en"><![CDATA[optimization]]></kwd>
<kwd lng="en"><![CDATA[real life applications]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Abdullah]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Burke]]></surname>
<given-names><![CDATA[E. K.]]></given-names>
</name>
<name>
<surname><![CDATA[McCollum]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[A hybrid evolutionary approach to the university course timetabling problem]]></source>
<year>2007</year>
<conf-name><![CDATA[ IEEE Congress on Evolutionary Computation (CEC 2007)]]></conf-name>
<conf-loc>Singapore </conf-loc>
<page-range>1764-8</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Generic model for timetabling problems by integer linear programmimg approach]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Aizam]]></surname>
<given-names><![CDATA[N. A. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Uvaraja]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<source><![CDATA[World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering]]></source>
<year>2015</year>
<volume>9</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>668-75</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="book">
<article-title xml:lang=""><![CDATA[Advances in Soft Computing and Its Applications]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Arntzen]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Lokketangen]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[A Tabu Search Heuristic for a University Timetabling Problem]]></source>
<year>2005</year>
<page-range>65-85</page-range><publisher-loc><![CDATA[Boston, MA ]]></publisher-loc>
<publisher-name><![CDATA[Springer US]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Applying evolutionary computation to the school timetabling problem: The Greek case]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Beligiannis]]></surname>
<given-names><![CDATA[G. N.]]></given-names>
</name>
<name>
<surname><![CDATA[Moschopoulos]]></surname>
<given-names><![CDATA[C. N.]]></given-names>
</name>
<name>
<surname><![CDATA[Kaperonis]]></surname>
<given-names><![CDATA[G. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Likothanassis]]></surname>
<given-names><![CDATA[S. D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Comput. Oper. Res.]]></source>
<year>2008</year>
<volume>35</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>1265-80</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Solving university course timetabling problems using constriction particle swarm optimization with local search]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[R.-M.]]></given-names>
</name>
<name>
<surname><![CDATA[Shih]]></surname>
<given-names><![CDATA[H.-F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Algorithms]]></source>
<year>2013</year>
<volume>6</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>227-44</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Using simulated annealing and ant-colony optimization algorithms to solve the scheduling problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chmait]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Challita]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computer Science and Information Technology]]></source>
<year>2013</year>
<volume>1</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>208-24</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Colorni]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Dorigo]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Maniezzo]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<source><![CDATA[A genetic algorithm to solve the timetable problem]]></source>
<year>1992</year>
<page-range>90-060</page-range><publisher-loc><![CDATA[Milan, ItalyTR ]]></publisher-loc>
<publisher-name><![CDATA[Politecnico di Milano]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Efficient solutions for a university timetabling problem through integer programming]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Daskalaki]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Birbas]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2005</year>
<volume>160</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>106-20</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<article-title xml:lang=""><![CDATA[Knowledge-Based and Intelligent Information and Engineering Systems]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dino Matijas]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Molnar]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[CupiC]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[JakoboviC]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Dalbelo BasiC]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[University Course Timetabling Using ACO: A Case Study on Laboratory Exercises]]></source>
<year>2010</year>
<volume>6276</volume>
<page-range>100-10</page-range><publisher-loc><![CDATA[Berlin, Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hegerty]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Hung]]></surname>
<given-names><![CDATA[C.-C.]]></given-names>
</name>
<name>
<surname><![CDATA[Kasprak]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[A comparative study on differential evolution and genetic algorithms for some combinatorial problems]]></source>
<year>2009</year>
<conf-name><![CDATA[ 8Mexican International Conference on Artificial Intelligence]]></conf-name>
<conf-loc> </conf-loc>
<page-range>9-13</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Tackling real-coded genetic algorithms: Operators and tools for behavioural analysis]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Herrera]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Lozano]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Verdegay]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Artificial Intelligence Review]]></source>
<year>1998</year>
<volume>12</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>265-319</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="book">
<article-title xml:lang=""><![CDATA[MICAI 2008: Advances in Artificial Intelligence]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lara]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Flores]]></surname>
<given-names><![CDATA[J. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Calderon]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Solving a School Timetabling Problem Using a Bee Algorithm]]></source>
<year>2008</year>
<page-range>664-74</page-range><publisher-loc><![CDATA[Berlin, Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lukas]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Aribowo]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Muchri]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Solving timetable problem by genetic algorithm and heuristic search case study: universitas pelita harapan timetable]]></source>
<year>2012</year>
<volume>378</volume>
<publisher-name><![CDATA[INTECH Open Access Publisher]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mezura-Montes]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Velazquez-Reyes]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Coello Coello]]></surname>
<given-names><![CDATA[C. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[A comparative study of differential evolution variants for global optimization]]></source>
<year>2006</year>
<conf-name><![CDATA[ 8Annual Conference on Genetic and Evolutionary Computation, GECCO '06]]></conf-name>
<conf-loc>New York, NY, USA </conf-loc>
<page-range>485-92</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Michalewicz]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<source><![CDATA[Genetic Algorithms + Data Structures = Evolution Programs]]></source>
<year>1994</year>
<edition>2</edition>
<publisher-loc><![CDATA[New York, NY, USA ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag New York, Inc.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A system for automatic construction of exam timetable using genetic algorithms]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Moreira]]></surname>
<given-names><![CDATA[J. J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Tekhne-Revista de Estudos Politecnicos]]></source>
<year>2008</year>
<volume>6</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>319-36</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Raghavjee]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Pillay]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[A comparison of genetic algorithms and genetic programming in solving the school timetabling problem]]></source>
<year>2012</year>
<conf-name><![CDATA[ Nature and Biologically Inspired Computing (NaBIC), 2012 Fourth World Congress on]]></conf-name>
<conf-loc> </conf-loc>
<page-range>98-103</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Raghavjee]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Pillay]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[A comparative study of genetic algorithms using a direct and indirect representation in solving the south african school timetabling problem]]></source>
<year>2013</year>
<conf-name><![CDATA[ ORSSA]]></conf-name>
<conf-loc> </conf-loc>
<page-range>31-9</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="book">
<article-title xml:lang=""><![CDATA[Advances in Soft Computing and Its Applications]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Raghavjee]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Pillay]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[A Study of Genetic Algorithms to Solve the School Timetabling Problem]]></source>
<year>2013</year>
<page-range>64-80</page-range><publisher-loc><![CDATA[Berlin, Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rodriguez]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Martinez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Flores]]></surname>
<given-names><![CDATA[J. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Graff]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Solving a scholar timetabling problem using a genetic algorithm-study case: Instituto Tecnológico de zitacuaro]]></source>
<year>2014</year>
<conf-name><![CDATA[ Artificial Intelligence (MICAI), 2014 13th Mexican International Conference on]]></conf-name>
<conf-loc> </conf-loc>
<page-range>197-202</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sigl]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Golub]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Mornar]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<source><![CDATA[Solving timetable scheduling problem using genetic algorithms]]></source>
<year>2003</year>
<conf-name><![CDATA[ 25int. conf. on information technology interfaces]]></conf-name>
<conf-loc> </conf-loc>
<page-range>519-24</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Solving timetabling problems using a cultural algorithm]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Soza]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Becerra]]></surname>
<given-names><![CDATA[R. L]]></given-names>
</name>
<name>
<surname><![CDATA[Riff]]></surname>
<given-names><![CDATA[M. C]]></given-names>
</name>
<name>
<surname><![CDATA[Coello Coello]]></surname>
<given-names><![CDATA[C. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Appi. Soft Comput.]]></source>
<year>2011</year>
<volume>11</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>337-44</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Differential evolution &amp;ndash; a simple and efficient heuristic for global optimization over continuous spaces]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Storn]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Price]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[J. of Global Optimization]]></source>
<year>1997</year>
<volume>11</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>341-59</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
