<?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>2227-1899</journal-id>
<journal-title><![CDATA[Revista Cubana de Ciencias Informáticas]]></journal-title>
<abbrev-journal-title><![CDATA[Rev cuba cienc informat]]></abbrev-journal-title>
<issn>2227-1899</issn>
<publisher>
<publisher-name><![CDATA[Editorial Ediciones Futuro]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S2227-18992019000300013</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Tratamiento de restricciones en el problema de formación de equipos de proyectos de software. Técnicas de penalización y preservación.]]></article-title>
<article-title xml:lang="en"><![CDATA[Treatment of restrictions on the problem of forming teams software projects. Penalization and preservation techniques.]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Infante Abreu]]></surname>
<given-names><![CDATA[Ana Lilian]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Tecnológica de La Habana José Antonio Echevarría (CUJAE).  ]]></institution>
<addr-line><![CDATA[ La Habana]]></addr-line>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>09</month>
<year>2019</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>09</month>
<year>2019</year>
</pub-date>
<volume>13</volume>
<numero>3</numero>
<fpage>13</fpage>
<lpage>29</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_arttext&amp;pid=S2227-18992019000300013&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_abstract&amp;pid=S2227-18992019000300013&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_pdf&amp;pid=S2227-18992019000300013&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[RESUMEN La formación de equipos de proyectos de software es un problema complejo, en tanto debe considerar varios factores, como son, la asignación de las personas con las competencias apropiadas a los roles, la carga de trabajo, las incompatibilidades entre los miembros, entre otros. Este proceso es aún más complejo en organizaciones medianas y grandes teniendo en cuenta la cantidad de combinaciones de asignaciones posibles. El trabajo toma como antecedente un modelo que plantea: maximizar las competencias de los trabajadores, minimizar las incompatibilidades entre los miembros del equipo, balancear la carga de trabajo y minimizar el costo de desarrollar software a distancia. Además, incluye doce tipos de restricciones. El modelo citado responde a un problema combinatorio multiobjetivo por lo que para su solución se utilizaron un conjunto de variantes multiobjetivo de los algoritmos metaheurísticos Escalador de Colinas y Recocido Simulado. En trabajos previos se utilizó la técnica de rechazo para el tratamiento de las restricciones obteniéndose que más del 60% de las soluciones que se generan son no factibles, por lo que son desechadas durante la búsqueda. Este trabajo implementa otras técnicas como son penalización y preservación, con las que se obtienen muy buenos resultados.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[ABSTRACT Forming teams of software projects is a complex problem, as should consider several factors, such as the allocation of people with the appropriate roles responsibilities, workload, incompatibilities between members, among others. This process is even more complex in medium and large organizations considering the number of combinations of possible assignments. The work takes as a model posing history: maximize the skills of workers, minimize incompatibilities between team members, balancing the workload and minimize the cost of developing software remotely. It also includes twelve types of restrictions. Said model responds to a multi-objective combinatorial problem so for its solution set of multiobjective metaheuristics algorithms variants Hill Climbing and Simulated Annealing were used. In previous work we were used rejection technique for treating restrictions yielding over 60% of the generated solutions are not feasible, so are discarded during the search was used in previous studies. This work implements other techniques such as penalty and preservation, with very good results.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[técnicas para tratamiento de restricciones]]></kwd>
<kwd lng="es"><![CDATA[algoritmos metaheurísticos]]></kwd>
<kwd lng="es"><![CDATA[problema de formación de equipos]]></kwd>
<kwd lng="en"><![CDATA[techniques for treatment of restrictions]]></kwd>
<kwd lng="en"><![CDATA[metaheuristics algorithms]]></kwd>
<kwd lng="en"><![CDATA[forming teams of software projects problem]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Aliay]]></surname>
<given-names><![CDATA[M. M]]></given-names>
</name>
<name>
<surname><![CDATA[Golalikhanib]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Zhuangby]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A computational study on different penalty approaches for solving constrained global optimization problems with the electromagnetism-like method.]]></article-title>
<source><![CDATA[Optimization]]></source>
<year>2014</year>
<volume>63</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>403-19</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[André]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Baldoquín]]></surname>
<given-names><![CDATA[M. G]]></given-names>
</name>
<name>
<surname><![CDATA[Acuña]]></surname>
<given-names><![CDATA[S. T]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Formal model for assigning human resources to teams in software projects.]]></article-title>
<source><![CDATA[Information and Software Technology]]></source>
<year>2011</year>
<volume>53</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>16</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ángeles]]></surname>
<given-names><![CDATA[M. D. L]]></given-names>
</name>
<name>
<surname><![CDATA[Gómez]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Acuña]]></surname>
<given-names><![CDATA[S. T]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Procedimiento para Determinar las Necesidades de Competencias en Organizaciones Desarrolladoras de Software.]]></article-title>
<source><![CDATA[Revista Colombiana de Computación]]></source>
<year>2005</year>
<volume>7</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>28</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Barreto]]></surname>
<given-names><![CDATA[A. S]]></given-names>
</name>
</person-group>
<source><![CDATA[Apoio à Decisão Gerencial na Alocação de Recursos Humanos em Projetos de Software]]></source>
<year>2003</year>
<publisher-name><![CDATA[Universidade Federal do Rio de Janeiro]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Centeno]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Rey]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Martínez]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[Algoritmode optimización metaheurístico aplicado al calculo del flujo de carga óptimo en redes eléctricas de potencia]]></source>
<year>2012</year>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Coello]]></surname>
<given-names><![CDATA[C. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Theorical and numerical constraint-handling techniques used with evolutionary algorithm: a survey of the state of the art.]]></article-title>
<source><![CDATA[Computer methods in applied mechanics and engineering]]></source>
<year>2002</year>
<volume>191</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>1245-87</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Coello]]></surname>
<given-names><![CDATA[C. A]]></given-names>
</name>
<name>
<surname><![CDATA[Cruz]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hybridizing a genetic algorithm with an artificial immune system for global optimization.]]></article-title>
<source><![CDATA[Engineering Optimization]]></source>
<year>2004</year>
<volume>36</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>607-34</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Coello]]></surname>
<given-names><![CDATA[C. A. C]]></given-names>
</name>
<name>
<surname><![CDATA[Cortés]]></surname>
<given-names><![CDATA[N. C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hybridizing a genetic algorithm with an artificial immune system for global optimization]]></article-title>
<source><![CDATA[Engineering Optimization]]></source>
<year>2004</year>
<volume>36</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>607-34</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Coello]]></surname>
<given-names><![CDATA[E. M.-M. A. C. A]]></given-names>
</name>
</person-group>
<source><![CDATA[A simple multimembered evolution strategy to solve constrained optimization problems.]]></source>
<year>2003</year>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Decarvalho]]></surname>
<given-names><![CDATA[L. R]]></given-names>
</name>
</person-group>
<source><![CDATA[Planejamento da alocação de recursos humanos em Ambientes de desenvolvimento de software orientados à Organização.]]></source>
<year>2003</year>
<publisher-name><![CDATA[Universidade Federal do Rio de Janeiro]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Derrac]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[García]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Molina]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Herrera]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
</person-group>
<source><![CDATA[A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms]]></source>
<year>2011</year>
<volume>1</volume>
<page-range>3-18</page-range><publisher-name><![CDATA[Swarm and Evolutionary Computation]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Escalera]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
<name>
<surname><![CDATA[Infante]]></surname>
<given-names><![CDATA[A. L]]></given-names>
</name>
<name>
<surname><![CDATA[André]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Rosete]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Técnicas para el tratamiento de restricciones en el problema de conformación de equipos de proyectos de software]]></article-title>
<source><![CDATA[Revista Cubana de Ciencias Informáticas]]></source>
<year>2015</year>
<volume>9</volume>
<numero>Especial CCIA 17</numero>
<issue>Especial CCIA 17</issue>
<page-range>110-25</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gupta]]></surname>
<given-names><![CDATA[R. K]]></given-names>
</name>
<name>
<surname><![CDATA[Bhunia]]></surname>
<given-names><![CDATA[A. K]]></given-names>
</name>
<name>
<surname><![CDATA[Roy]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<source><![CDATA[A GA based penalty function technique for solving constrained redundancy allocation problem of series system with interval valued reliability of components]]></source>
<year>2009</year>
<month>a</month>
<volume>232</volume>
<page-range>275-84</page-range><publisher-name><![CDATA[Journal of Computational and Applied Mathematics]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gupta]]></surname>
<given-names><![CDATA[R. K]]></given-names>
</name>
<name>
<surname><![CDATA[Bhunia]]></surname>
<given-names><![CDATA[A. K]]></given-names>
</name>
<name>
<surname><![CDATA[Roy]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[GA based penalty function technique for solving constrained redundancy allocation problem of series system with interval valued reliability of components.]]></article-title>
<source><![CDATA[Journal of Computational and Applied Mathematics]]></source>
<year>2009</year>
<month>b</month>
<volume>232</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>275-84</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Homaifar]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Qi]]></surname>
<given-names><![CDATA[C. X]]></given-names>
</name>
<name>
<surname><![CDATA[Lai]]></surname>
<given-names><![CDATA[S. H]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Constrained optimization via genetic algorithms]]></article-title>
<source><![CDATA[Simulation]]></source>
<year>1994</year>
<volume>62</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>242-53</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hu]]></surname>
<given-names><![CDATA[X]]></given-names>
</name>
<name>
<surname><![CDATA[Eberhart]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<source><![CDATA[Solving Constrained Nonlinear Optimization Problems with Particle Swarm Optimization]]></source>
<year>2002</year>
<volume>5</volume>
<page-range>203-6</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Infante]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[Algoritmos de trayectoria multiobjetivo aplicados al problema de asignación de recursos humanos a equipos de proyecto de software]]></source>
<year>2012</year>
<publisher-name><![CDATA[Instituto Superior Politécnico José Antonio Echeverría]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ishibuchi]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Kaige]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Narukawa]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
</person-group>
<source><![CDATA[Comparison between lamarckian and baldwinian repair on multiobjective 0/1 Knapsack Problems]]></source>
<year>2005</year>
<page-range>370-85</page-range><publisher-name><![CDATA[In Evolutionary Multi-Criterion Optimization]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jadaan]]></surname>
<given-names><![CDATA[O. S]]></given-names>
</name>
<name>
<surname><![CDATA[Rajamani]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Rao]]></surname>
<given-names><![CDATA[C. R]]></given-names>
</name>
</person-group>
<source><![CDATA[Adaptive penalty function for solving constrained evolutionary optimization]]></source>
<year>2009</year>
<month>a</month>
<publisher-name><![CDATA[Journal of Theoretical and Applied Information Technology.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jadaan]]></surname>
<given-names><![CDATA[O. S]]></given-names>
</name>
<name>
<surname><![CDATA[Rajamani]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Rao]]></surname>
<given-names><![CDATA[C. R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Adaptive penalty function for solving constrained evolutionary optimization]]></article-title>
<source><![CDATA[Journal of Theoretical and Applied Information Technology]]></source>
<year>2009</year>
<month>b</month>
<volume>5</volume>
<numero>3</numero>
<issue>3</issue>
</nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kirkpatrick]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Gelatt]]></surname>
<given-names><![CDATA[C. D]]></given-names>
</name>
<name>
<surname><![CDATA[Vecchi]]></surname>
<given-names><![CDATA[M. P]]></given-names>
</name>
</person-group>
<source><![CDATA[Optimization by Simulated Annealing]]></source>
<year>1983</year>
<volume>220</volume>
<page-range>10</page-range><publisher-name><![CDATA[Science]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kowalczyk]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<source><![CDATA[Constrained genetic operators preserving feasibility of solutions in genetic algorithms]]></source>
<year>1997</year>
<page-range>191-6</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liepins]]></surname>
<given-names><![CDATA[G. E]]></given-names>
</name>
<name>
<surname><![CDATA[Vose]]></surname>
<given-names><![CDATA[M. D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Representational Issues in Genetic Optimization.]]></article-title>
<source><![CDATA[Journal of Experimental and Theorical Computer Science]]></source>
<year>1990</year>
<volume>2</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>101-15</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lukasiewycz]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Glaß]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Haubelt]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Teich]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<source><![CDATA[A Feasibility-Preserving Local Search Operator for Constrained Discrete Optimization Problems.]]></source>
<year>2008</year>
<month>a</month>
<page-range>1968-75</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lukasiewycz]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Glaß]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Teich]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<source><![CDATA[A Feasibility-preserving Crossover and Mutation Operator for Constrained Combinatorial Problems]]></source>
<year>2008</year>
<month>b</month>
<page-range>919-28</page-range></nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mezura]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
<name>
<surname><![CDATA[Coello]]></surname>
<given-names><![CDATA[C. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Use of Multiobjective Optimization Concepts to Handle Constraints in Genetic Algorithms.]]></source>
<year>2003</year>
<page-range>229--254</page-range><publisher-loc><![CDATA[London ]]></publisher-loc>
<publisher-name><![CDATA[Evolutionary Multiobjective Optimization: Theoretical Advances And Applications]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B27">
<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[A Survey of Constraint Handling Techniques in Evolutionary Computation Methods]]></source>
<year>1995</year>
<volume>4</volume>
<page-range>135-55</page-range><publisher-name><![CDATA[Evolutionary Programming]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="">
<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>2013</year>
</nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Michalewicz]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
<name>
<surname><![CDATA[Dasgupta]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Richie]]></surname>
<given-names><![CDATA[R. L]]></given-names>
</name>
<name>
<surname><![CDATA[Schoenauer]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<source><![CDATA[A co-evolutionary algorithm for numerical optimization with nonlinear constraints.]]></source>
<year>1995</year>
<page-range>647-51</page-range><publisher-loc><![CDATA[Piscataway, New Jersey. ]]></publisher-loc>
<publisher-name><![CDATA[IEEE Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Michalewicz]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
<name>
<surname><![CDATA[Dasgupta]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Richie]]></surname>
<given-names><![CDATA[R. L]]></given-names>
</name>
<name>
<surname><![CDATA[Schoenauer]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Evolutionary algorithms for constrained engineering problems.]]></article-title>
<source><![CDATA[Computers &amp; Industrial Engineering Journal,]]></source>
<year>1996</year>
<volume>30</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>851-70</page-range></nlm-citation>
</ref>
<ref id="B31">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Michalewicz]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
<name>
<surname><![CDATA[Janikow]]></surname>
<given-names><![CDATA[C. Z]]></given-names>
</name>
</person-group>
<source><![CDATA[Handling Constraints in Genetic Algorithms]]></source>
<year>1991</year>
</nlm-citation>
</ref>
<ref id="B32">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Michalewicz]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
<name>
<surname><![CDATA[Koziel]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<source><![CDATA[A decoder-based evolutionary algorithm for constrained parameter optimization problems.]]></source>
<year>1998</year>
<publisher-name><![CDATA[Parallel Problem Solving from Nature-PPSN V]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B33">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Michalewicz]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
<name>
<surname><![CDATA[Nazhiyath]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<source><![CDATA[Genocop III: A co-evolutionary algorithm for numerical optimization problems with nonlinear constraints.]]></source>
<year>1995</year>
<volume>2</volume>
<page-range>647-51</page-range><publisher-name><![CDATA[In IEEE International Conference]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B34">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Michalewicz]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
<name>
<surname><![CDATA[Schoenauer]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Evolutionary algorithms for constrained parameter optimization problems]]></article-title>
<source><![CDATA[Evolutionaty Computation]]></source>
<year>1996</year>
<volume>4</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-32</page-range></nlm-citation>
</ref>
<ref id="B35">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nakano]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<source><![CDATA[Conventional Genetic Algorithm for Job Shop Problems.]]></source>
<year>1991</year>
<page-range>474-9</page-range><publisher-loc><![CDATA[San Mateo, California. : Morgan Kaufmann Publishers ]]></publisher-loc>
<publisher-name><![CDATA[Proceedings of the Fourth International Conference on Genetic Algorithms.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B36">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Neil]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Proyectos Informáticos: Fracasos y Lecciones Aprendidas]]></article-title>
<source><![CDATA[Revista de Derecho y Tecnologías de la Información]]></source>
<year>2006</year>
<volume>11</volume>
<numero>4</numero>
<issue>4</issue>
</nlm-citation>
</ref>
<ref id="B37">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ngo-The]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Ruhe]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Systematic Approach for Solving the Wicked Problem of Software Release Planning]]></article-title>
<source><![CDATA[Soft Computing]]></source>
<year>2008</year>
<volume>12</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>95-108</page-range></nlm-citation>
</ref>
<ref id="B38">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Orvosh]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Davis]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<source><![CDATA[Using a genetic algorithm to optimize problems with feasibility constraints.]]></source>
<year>1994</year>
<volume>2</volume>
<page-range>548-53</page-range><publisher-name><![CDATA[Proceedings of the first IEEE Conference]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B39">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Padhye]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
<name>
<surname><![CDATA[Mittal]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Deb]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
</person-group>
<source><![CDATA[Feasibility Preserving Constraint-Handling Strategies for Real Parameter Evolutionary Optimization]]></source>
<year>2015</year>
</nlm-citation>
</ref>
<ref id="B40">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Paquet]]></surname>
<given-names><![CDATA[U]]></given-names>
</name>
<name>
<surname><![CDATA[Engelbrecht]]></surname>
<given-names><![CDATA[A. P]]></given-names>
</name>
</person-group>
<source><![CDATA[A New Particle Swarm Optimiser for Linearly Constrained Optimisation. Evolutionary Computation]]></source>
<year>2003</year>
<page-range>227-33</page-range></nlm-citation>
</ref>
<ref id="B41">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rasjido]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Pandolfi]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Villagra]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Algoritmos de reparación para el manejo de restricciones en la planificación del mantenimiento de locaciones petroleras.]]></article-title>
<source><![CDATA[Informe Científico Técnico UNPA]]></source>
<year>2011</year>
<volume>3</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>41-62</page-range></nlm-citation>
</ref>
<ref id="B42">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schott]]></surname>
<given-names><![CDATA[J. R]]></given-names>
</name>
</person-group>
<source><![CDATA[Fault Tolerant Design Using Single and Multicriteria Genetic Algorithm Optimization]]></source>
<year>1995</year>
<publisher-name><![CDATA[Maestría]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B43">
<nlm-citation citation-type="">
<collab>Standishgroup</collab>
<source><![CDATA[Standish Group 2015 Chaos Report]]></source>
<year>2015</year>
</nlm-citation>
</ref>
<ref id="B44">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Talbi]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<source><![CDATA[METAHEURISTICS FROM DESIGN TO IMPLEMENTATION.]]></source>
<year>1965</year>
<publisher-name><![CDATA[John Wiley &amp; Sons]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B45">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Valdez]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Pandolfi]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Villagra]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[Manejo de restricciones con función de penalidad para la planificación del mantenimiento de locaciones petroleras]]></source>
<year>2011</year>
</nlm-citation>
</ref>
<ref id="B46">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Veldhuizen]]></surname>
<given-names><![CDATA[D. A. V]]></given-names>
</name>
<name>
<surname><![CDATA[Lamont]]></surname>
<given-names><![CDATA[G. B]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art.]]></article-title>
<source><![CDATA[Evolutionary Computation]]></source>
<year>2000</year>
<volume>8</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>23</page-range></nlm-citation>
</ref>
<ref id="B47">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Villagra]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Lasso]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Pandolfi]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[E. D. S.]]></surname>
<given-names><![CDATA[Pedro]]></given-names>
</name>
</person-group>
<source><![CDATA[Manejo de Restricciones y Mejora en los Procesos de Búsqueda en Algoritmos Evolutivos aplicados a Problemas Dinámicos y Scheduling.]]></source>
<year>2010</year>
<month>a</month>
</nlm-citation>
</ref>
<ref id="B48">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Villagra]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Lasso]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Pandolfi]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[E. D. S]]></surname>
<given-names><![CDATA[Pedro]]></given-names>
</name>
</person-group>
<source><![CDATA[Manejo de Restricciones usando penalidades y Procesos de Búsqueda Mejorados en Algoritmos Evolutivos aplicados a Problemas Dinámicos de Scheduling]]></source>
<year>2010</year>
<month>b</month>
</nlm-citation>
</ref>
<ref id="B49">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vose]]></surname>
<given-names><![CDATA[G. E. L. A. M. D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Representational Issues in Genetic Optimization.]]></article-title>
<source><![CDATA[Journal of Experimental and Theorical Computer Science]]></source>
<year>1990</year>
<volume>2</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>4 30</page-range></nlm-citation>
</ref>
<ref id="B50">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Whitley]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Gordon]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Mathias]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
</person-group>
<source><![CDATA[Lamarckian evolution, the Baldwin effect and function optimization. Parallel Problem Solving from Nature]]></source>
<year>1994</year>
</nlm-citation>
</ref>
<ref id="B51">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zitzler]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
<name>
<surname><![CDATA[Thiele]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach.]]></article-title>
<source><![CDATA[IEEE Transactions on Evolutionary Computation]]></source>
<year>1999</year>
<volume>3</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>257-71</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
