<?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-55462024000301613</article-id>
<article-id pub-id-type="doi">10.13053/cys-28-3-5177</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Normal Attractor Intersection Based Multi-objective Optimization Using Particle Swarm Optimization]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Domínguez-Guerrero]]></surname>
<given-names><![CDATA[Josué]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Montiel-Ross]]></surname>
<given-names><![CDATA[Óscar]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Carrillo]]></surname>
<given-names><![CDATA[Víctor]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Martínez]]></surname>
<given-names><![CDATA[Edgar]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Castillo]]></surname>
<given-names><![CDATA[Óscar]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Autónoma de Ciudad Juárez  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Instituto Politécnico Nacional Centro de Investigación y Desarrollo de Tecnología Digital ]]></institution>
<addr-line><![CDATA[Tijuana ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Instituto Tecnológico de Tijuana  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>09</month>
<year>2024</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>09</month>
<year>2024</year>
</pub-date>
<volume>28</volume>
<numero>3</numero>
<fpage>1613</fpage>
<lpage>1623</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462024000301613&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-55462024000301613&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-55462024000301613&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: Frequently, multiobjective optimization problems are solved using non-dominated based evolutionary algorithms or gradient-based methods. In the last years, successful proposals that combine the two approaches have been developed. In this work, we propose the Normal Attractor Intersection (NAI) and the NAImopso. The NAI avoids the a priori definition of the search direction and the equality constraints; it uses a set of attractors that cover the entire Pareto Front to generate solutions in the Pareto front. The NAImopso is a multiobjective optimization algorithm based on decomposition; we used it to prove the ability of the NAI to obtain the Pareto front. We compared our proposal against four state-of-the-proposals, and it was evaluated using three well-recognized indicators as performance metrics, the hypervolume indicator, the coverage, and the &#949;-indicator. The experimental results showed that solutions obtained with the NAImopso were better than the solutions obtained with the other algorithms with it was compared.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Multi-objective optimization]]></kwd>
<kwd lng="en"><![CDATA[MOO classic method]]></kwd>
<kwd lng="en"><![CDATA[decomposition algorithm]]></kwd>
<kwd lng="en"><![CDATA[particle swarm optimization]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Miettinen]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Nonlinear multiobjective optimization]]></source>
<year>1998</year>
<volume>12</volume>
<page-range>257-98</page-range><publisher-loc><![CDATA[US ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Stadler]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A survey of multicriteria optimization or the vector maximum problem, part I: 1776&#8211;1960]]></article-title>
<source><![CDATA[Journal of Optimization Theory and Applications]]></source>
<year>1979</year>
<volume>29</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-52</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rivera]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Coello-Coello]]></surname>
<given-names><![CDATA[C. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Cruz-Reyes]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Fernandez]]></surname>
<given-names><![CDATA[E. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Gomez-Santillan]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Rangel-Valdez]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Preference incorporation into many-objective optimization: an ant colony algorithm based on interval outranking]]></article-title>
<source><![CDATA[Swarm and Evolutionary Computation]]></source>
<year>2022</year>
<volume>69</volume>
<page-range>101024</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rivera]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Cruz-Reyes]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Fernandez]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Gomez-Santillan]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Rangel-Valdez]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An interactive ACO enriched with an eclectic multi-criteria ordinal classifier to address many-objective optimisation problems]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2023</year>
<volume>232</volume>
<page-range>120813</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Benson]]></surname>
<given-names><![CDATA[H. P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set]]></article-title>
<source><![CDATA[Journal of Optimization Theory and Applications]]></source>
<year>1992</year>
<volume>73</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>47-64</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Das]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Dennis]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Normal-boundary intersection: An alternate method for generating pareto optimal points in multicriteria optimization problems]]></article-title>
<source><![CDATA[Contractor]]></source>
<year>1996</year>
<numero>96</numero>
<issue>96</issue>
<page-range>38</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ganesan]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Vasant]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Elamvazuthi]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Normal-boundary intersection based parametric multi-objective optimization of green sand mould system]]></article-title>
<source><![CDATA[Journal of Manufacturing Systems]]></source>
<year>2013</year>
<volume>32</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>197-205</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schaffer]]></surname>
<given-names><![CDATA[J. D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Some experiments in machine learning using vector evaluated genetic algorithms]]></source>
<year>1985</year>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Goldberg]]></surname>
<given-names><![CDATA[D. E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Genetic algorithms in search, optimization and machine learning]]></source>
<year>1989</year>
<edition>1</edition>
<publisher-name><![CDATA[Addison-Wesley Longman Publishing Co., Inc.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Logist]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[van-Impe]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Novel insights for multi-objective optimisation in engineering using normal boundary intersection and (enhanced) normalised normal constraint]]></article-title>
<source><![CDATA[Structural and Multidisciplinary Optimization]]></source>
<year>2011</year>
<volume>45</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>417-31</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dias-Lopes]]></surname>
<given-names><![CDATA[L. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Brito]]></surname>
<given-names><![CDATA[T. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Paiva]]></surname>
<given-names><![CDATA[A. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Peruchi]]></surname>
<given-names><![CDATA[R. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Balestrassi]]></surname>
<given-names><![CDATA[P. P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Robust parameter optimization based on multivariate normal boundary intersection]]></article-title>
<source><![CDATA[Computers and Industrial Engineering]]></source>
<year>2016</year>
<volume>93</volume>
<page-range>55-66</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[MOEA/D: A multiobjective evolutionary algorithm based on decomposition]]></article-title>
<source><![CDATA[IEEE Transactions on Evolutionary Computation]]></source>
<year>2007</year>
<volume>11</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>712-31</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rubio-Largo]]></surname>
<given-names><![CDATA[Á.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Vega-Rodríguez]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A multiobjective evolutionary algorithm based on decomposition with normal boundary intersection for traffic grooming in optical networks]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2014</year>
<volume>289</volume>
<page-range>91-116</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Luo]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Jin]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Jiang]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Decomposition-based multiobjective evolutionary algorithm with genetically hybrid differential evolution strategy]]></article-title>
<source><![CDATA[IEEE Access]]></source>
<year>2021</year>
<volume>9</volume>
<page-range>2428-42</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Meng]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Mahmoodi]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Knowledge-guided multiobjective particle swarm optimization with fusion learning strategies]]></article-title>
<source><![CDATA[Complex and Intelligent Systems]]></source>
<year>2021</year>
<volume>7</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>1223-39</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Datta]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Ghosh]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Sanyal]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Das]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A radial boundary intersection aided interior point method for multi-objective optimization]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2017</year>
<volume>377</volume>
<page-range>1-16</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cui]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Pan]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Okoye]]></surname>
<given-names><![CDATA[M. O.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Improved normal-boundary intersection algorithm: a method for energy optimization strategy in smart buildings]]></article-title>
<source><![CDATA[Building and Environment]]></source>
<year>2022</year>
<volume>212</volume>
<page-range>108846</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Siddiqui]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Azarm]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Gabriel]]></surname>
<given-names><![CDATA[S. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On improving normal boundary intersection method for generation of pareto frontier]]></article-title>
<source><![CDATA[Structural and Multidisciplinary Optimization]]></source>
<year>2012</year>
<volume>46</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>839-52</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sun]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Yu]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Liang]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[All-dimension neighborhood based particle swarm optimization with randomly selected neighbors]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2017</year>
<volume>405</volume>
<page-range>141-56</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hu]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Yen]]></surname>
<given-names><![CDATA[G. G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Adaptive multiobjective particle swarm optimization based on parallel cell coordinate system]]></article-title>
<source><![CDATA[IEEE Transactions on Evolutionary Computation]]></source>
<year>2015</year>
<volume>19</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-18</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Aghaei]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Akbari]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Roosta]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Baharvandi]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Multiobjective generation expansion planning considering power system adequacy]]></article-title>
<source><![CDATA[Electric Power Systems Research]]></source>
<year>2013</year>
<volume>102</volume>
<page-range>8-19</page-range></nlm-citation>
</ref>
<ref id="B22">
<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[Deb]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Thiele]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Comparison of multiobjective evolutionary algorithms: empirical results]]></article-title>
<source><![CDATA[Evolutionary Computation]]></source>
<year>2000</year>
<volume>8</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>173-95</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Deb]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Thiele]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Laumanns]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Zitzler]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Scalable multi-objective optimization test problems]]></source>
<year>2002</year>
<volume>1</volume>
<conf-name><![CDATA[ Congress on Evolutionary Computation]]></conf-name>
<conf-loc> </conf-loc>
<page-range>825-30</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Narukawa]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Setoguchi]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Tanigaki]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Olhofer]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Sendhoff]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Ishibuchi]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Preference representation using gaussian functions on a hyperplane in evolutionary multi-objective optimization]]></article-title>
<source><![CDATA[Soft Computing]]></source>
<year>2015</year>
<volume>20</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>2733-57</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Okabe]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Jin]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Sendhoff]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[A critical survey of performance indices for multi- objective optimisation]]></source>
<year>2003</year>
<volume>2</volume>
<conf-name><![CDATA[ The Congress on Evolutionary Computation]]></conf-name>
<conf-loc> </conf-loc>
<page-range>878-85</page-range></nlm-citation>
</ref>
<ref id="B26">
<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>
<name>
<surname><![CDATA[Laumanns]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Fonseca]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[da-Fonseca]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Performance assessment of multiobjective optimizers: an analysis and review]]></article-title>
<source><![CDATA[IEEE Transactions on Evolutionary Computation]]></source>
<year>2003</year>
<volume>7</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>117-32</page-range></nlm-citation>
</ref>
<ref id="B27">
<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 id="B28">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mishra]]></surname>
<given-names><![CDATA[K. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Harit]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A fast algorithm for finding the non dominated set in multiobjective optimization]]></article-title>
<source><![CDATA[International Journal of Computer Applications]]></source>
<year>2010</year>
<volume>1</volume>
<numero>25</numero>
<issue>25</issue>
<page-range>46-54</page-range></nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kawano]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Valdez]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Castillo]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Fuzzy combination of moth-flame optimization and lightning search algorithm with fuzzy dynamic parameter adjustment]]></article-title>
<source><![CDATA[Computación y Sistemas]]></source>
<year>2022</year>
<volume>26</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>743-57</page-range></nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mathur]]></surname>
<given-names><![CDATA[R. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Sharma]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A multi-objective task scheduling scheme GMOPSO-BFO in mobile cloud computing]]></article-title>
<source><![CDATA[Computación y Sistemas]]></source>
<year>2023</year>
<volume>27</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>477-88</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
