<?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-55462023000100163</article-id>
<article-id pub-id-type="doi">10.13053/cys-27-1-4532</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[An Improved Estimation of Distribution Algorithm for Mixed-Integer Nonlinear Programming Problems: 																					E								D								A								I																															I																																			m										v																																			]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Molina-Pérez]]></surname>
<given-names><![CDATA[Daniel]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Mezura-Montes]]></surname>
<given-names><![CDATA[Efrén]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Portilla-Flores]]></surname>
<given-names><![CDATA[Edgar Alfredo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Vega-Alvarado]]></surname>
<given-names><![CDATA[Eduardo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Instituto Politécnico Nacional Centro de Innovación y Desarrollo Tecnológico en Cómputo ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Veracruzana Instituto de Investigaciones en Inteligencia Artificial ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Instituto Politécnico Nacional Unidad Profesional Interdisciplinaria de Ingeniería Campus Tlaxcala ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2023</year>
</pub-date>
<volume>27</volume>
<numero>1</numero>
<fpage>163</fpage>
<lpage>172</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462023000100163&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-55462023000100163&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-55462023000100163&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: In a mixed-integer nonlinear programming problem, integer restrictions divide the feasible region into discontinuous feasible parts with different sizes. Meta-heuristic optimization algorithms quickly lose diversity in such scenarios and get trapped in local optima. In this work, we propose an Estimation of Distribution Algorithm (EDA) with two modifications from its previous version (  E D  A  m v). The first modification consists in establishing the exploration and exploitation components for the histogram of discrete variables, aimed at improving the performance of the algorithm during the evolution. The second modification is a repulsion operator to overcome the population stagnation in discontinuous parts, so as continuing the search for possible solutions in other regions. From a comparative study on 16 test problems, the individual contribution of each modification was verified. According to statistical test results, the new proposal shows a significantly better performance than the other competitors tested.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Estimation of distribution algorithm]]></kwd>
<kwd lng="en"><![CDATA[integer restriction handling]]></kwd>
<kwd lng="en"><![CDATA[mixed integer nonlinear programming]]></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[Datta]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Figueira]]></surname>
<given-names><![CDATA[J. R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A real&#8211;integer&#8211; discrete-coded differential evolution]]></article-title>
<source><![CDATA[Applied Soft Computing]]></source>
<year>2013</year>
<volume>13</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>3884-93</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Deep]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Singh]]></surname>
<given-names><![CDATA[K. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Kansal]]></surname>
<given-names><![CDATA[M. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Mohan]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A real coded genetic algorithm for solving integer and mixed integer optimization problems]]></article-title>
<source><![CDATA[Applied Mathematics and Computation]]></source>
<year>2009</year>
<volume>212</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>505-18</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[K. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Geem]]></surname>
<given-names><![CDATA[Z. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[S.-h.]]></given-names>
</name>
<name>
<surname><![CDATA[Bae]]></surname>
<given-names><![CDATA[K.-w.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The harmony search heuristic algorithm for discrete structural optimization]]></article-title>
<source><![CDATA[Engineering Optimization]]></source>
<year>2005</year>
<volume>37</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>663-84</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A heuristic particle swarm optimization method for truss structures with discrete variables]]></article-title>
<source><![CDATA[Computers &amp; structures]]></source>
<year>2009</year>
<volume>87</volume>
<numero>7-8</numero>
<issue>7-8</issue>
<page-range>435-43</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[W. N.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid differential evolution algorithm for mixed-variable optimization problems]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2018</year>
<volume>466</volume>
<page-range>170-88</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[P. Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Jiang]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Car: A cutting and repulsion-based evolutionary framework for mixed-integer programming problems]]></article-title>
<source><![CDATA[IEEE Transactions on Cybernetics]]></source>
<year>2021</year>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Xin]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A biobjective perspective for mixed-integer programming]]></article-title>
<source><![CDATA[IEEE Transactions on Systems, Man, and Cybernetics: Systems]]></source>
<year>2021</year>
<volume>52</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>2374-85</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[López-Ibáñez]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Cáceres]]></surname>
<given-names><![CDATA[L. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Dubois-Lacoste]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Stutzle]]></surname>
<given-names><![CDATA[T. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Birattari]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[The irace package: User guide]]></source>
<year>2016</year>
<publisher-name><![CDATA[IRIDIA, Institut de Recherches Interdisciplinaires et de Developpements en Intelligence Artificielle, Universite Libre de Bruxelles]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Molina-Pérez]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Portilla-Flores]]></surname>
<given-names><![CDATA[E. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Mezura-Montes]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Vega-Alvarado]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[An improved estimation of distribution algorithm for solving constrained mixed-integer nonlinear programming problems]]></source>
<year>2022</year>
<conf-name><![CDATA[ IEEE World Congress on Computational Intelligence]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1-8</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ponsich]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Azzaro-Pantel]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Domenech]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Pibouleau]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Mixed-integer nonlinear programming optimization strategies for batch plant design problems]]></article-title>
<source><![CDATA[Industrial &amp; engineering chemistry research]]></source>
<year>2007</year>
<volume>46</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>854-63</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sahinidis]]></surname>
<given-names><![CDATA[N. V.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Mixed-integer nonlinear programming 2018]]></article-title>
<source><![CDATA[Optimization and Engineering]]></source>
<year>2019</year>
<volume>20</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>301-6</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schlueter]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Nonlinear mixed integer based optimization technique for space applications]]></source>
<year>2012</year>
<publisher-name><![CDATA[University of Birmingham]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schluter]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Egea]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Banga]]></surname>
<given-names><![CDATA[J. R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Extended ant colony optimization for non-convex mixed integer nonlinear programming]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2009</year>
<volume>36</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>2217-29</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Takahama]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Sakai]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Constrained optimization by the &#949; constrained differential evolution with gradient-based mutation and feasible elites]]></source>
<year>2006</year>
<conf-name><![CDATA[ IEEE international conference on evolutionary computation]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1-8</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhou]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Tang]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An estimation of distribution algorithm for mixed-variable newsvendor problems]]></article-title>
<source><![CDATA[IEEE Transactions on Evolutionary Computation]]></source>
<year>2019</year>
<volume>24</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>479-93</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhou]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A particle swarm optimization algorithm for mixed-variable optimization problems]]></article-title>
<source><![CDATA[Swarm and Evolutionary Computation]]></source>
<year>2021</year>
<volume>60</volume>
<page-range>100808</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
