<?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-18992021000200044</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Enfoque multiobjetivo para el problema difuso de empaquetamiento con costo y tamaño variable]]></article-title>
<article-title xml:lang="en"><![CDATA[Multiobjective approach for the fuzzy variable cost and size bin packing problem]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Herrera Franklin]]></surname>
<given-names><![CDATA[Jorge]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rosete]]></surname>
<given-names><![CDATA[Alejandro]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Centro de Investigación y Manejo Ambiental del Transporte  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Cuba</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Tecnológica de La Habana José Antonio Echeverría. CUJAE. Facultad de Ingeniería Informática ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Cuba</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2021</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2021</year>
</pub-date>
<volume>15</volume>
<numero>2</numero>
<fpage>44</fpage>
<lpage>61</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_arttext&amp;pid=S2227-18992021000200044&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_abstract&amp;pid=S2227-18992021000200044&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_pdf&amp;pid=S2227-18992021000200044&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[RESUMEN En la investigación se aborda una variante difusa del Problema de Empaquetamiento con Costo y Tamaño Variables donde se permite una sobrecarga de los contenedores. El nivel de sobrecarga está definido por valores de alfa-corte o pertenencia de los cuales se generan instancias que conforman el problema difuso. El muestreo empírico de los alfa-corte tiene el problema de que cada instancia con un grado de pertenencia determinado, debe resolverse y además se pueden perder soluciones interesantes en cuanto a compromiso costo-capacidad. En el presente trabajo se introduce una propuesta donde se trata el problema de la obtención de la solución difusa como un problema multiobjetivo donde se busca minimizar el costo mientras se maximiza el valor de pertenencia de la solución. Para esto se utilizaron las metaheurísticas multiobjetivo Búsqueda Local, Recocido Simulado Ulungu, Algoritmo Genético y su variante NSGA-II. Fueron implementados varios operadores basados en la heurística First Fit Decreasing. Los resultados experimentales mostraron que el NSGA-II resulta ser el más eficaz a la misma vez que el más lento, pero sin llegar a ser inviable su utilización en instancias grandes. También se comprobó en un grupo de instancias difusas, de las cuales se conoce la solución exacta para 11 valores de pertenencia, que este método permite obtener soluciones que mejoran valores de pertenencia con el mismo costo.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[ABSTRACT The research addresses a fuzzy variant of the Variable Cost and Size Bin Packing Problem where an overload of the bins is allowed. The level of overload is defined by alpha-cuts or membership values which generates crisp instances that conform the fuzzy problem. The empirical sampling of the alpha-cuts has the problem that every single crisp instance must be solved as well as it can be missed interesting solutions that improve the trade-off between cost and capacity. In the present work a proposal is introduced where the problem of obtaining the fuzzy solution is treated as a multiobjective problem aiming to minimize the cost while maximizing the membership value of the solution. For this, the multiobjective metaheuristics Local Search, Ulungu Simulated Annealing, Genetic Algorithm and its variant NSGA-II were used. Several operators based on the First Fit Decreasing heuristic were implemented. The experimental results showed that the NSGA-II turns out to be the most efficient and at the same time the slowest, but without becoming unfeasible its use in large instances. It was also verified in a group of fuzzy instances, of which the exact solution is known for 11 membership values, that this method allows obtaining solutions that improve membership values with the same cost.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[optimización multiobjetivo]]></kwd>
<kwd lng="es"><![CDATA[problema difuso de empaquetamiento con costo y tamaño variable]]></kwd>
<kwd lng="es"><![CDATA[metaheurísticas]]></kwd>
<kwd lng="es"><![CDATA[enfoque paramétrico]]></kwd>
<kwd lng="en"><![CDATA[multiobjective optimization]]></kwd>
<kwd lng="en"><![CDATA[fuzzy variable cost and size bin packing problem]]></kwd>
<kwd lng="en"><![CDATA[metaheuristics]]></kwd>
<kwd lng="en"><![CDATA[parametric approach]]></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[Alcalá-Fdez]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Sánchez]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[García]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Del Jesus]]></surname>
<given-names><![CDATA[M.J]]></given-names>
</name>
<name>
<surname><![CDATA[Ventura]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Garrell]]></surname>
<given-names><![CDATA[J.M]]></given-names>
</name>
<name>
<surname><![CDATA[Otero]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Romero]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Bacardit]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Rivas]]></surname>
<given-names><![CDATA[V.M]]></given-names>
</name>
<name>
<surname><![CDATA[Fernández]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Herrera]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
</person-group>
<source><![CDATA[Keel: A Software Tool To Assess Evolutionary Algorithms For Data Mining Problems]]></source>
<year>2009</year>
<volume>13</volume>
<page-range>307-18</page-range><publisher-name><![CDATA[Soft Computing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Alioui]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
<name>
<surname><![CDATA[Acar]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An Evaluation Of A Constrained Multi-Objective Genetic Algorithm]]></article-title>
<source><![CDATA[Journal Of Scientific Perspectives]]></source>
<year>2020</year>
<volume>4</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>137-46</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Amine]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
</person-group>
<source><![CDATA[Multiobjective Simulated Annealing: Principles And Algorithm Variants.]]></source>
<year>2019</year>
<volume>2019</volume>
<page-range>8134674</page-range><publisher-name><![CDATA[Advances In Operations Research]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Audet]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Bigeon]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Cartier]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Le Digabel]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Salomon]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<source><![CDATA[Performance Indicators In Multiobjective Optimization.]]></source>
<year>2020</year>
<publisher-name><![CDATA[European Journal Of Operational Research]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Biswas]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Acharyya]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<source><![CDATA[Multi-Objective Simulated Annealing Variants To Infer Gene Regulatory Network: A Comparative Study.]]></source>
<year>2020</year>
<page-range>1</page-range><publisher-name><![CDATA[Ieee/Acm Transactions On Computational Biology And Bioinformatics]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Calderín-Fajardo]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<source><![CDATA[Soft Computing En Problemas De Optimización Dinámicos]]></source>
<year>2016</year>
<publisher-name><![CDATA[Universidad De Granada]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chakraborty]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Ray]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Parametric Approach And Genetic Algorithm For Multi Objective Linear Programming With Imprecise Parameters.]]></article-title>
<source><![CDATA[Opsearch]]></source>
<year>2010</year>
<volume>47</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>73-92</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Correia]]></surname>
<given-names><![CDATA[I]]></given-names>
</name>
<name>
<surname><![CDATA[Gouveia]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Saldanha-Da-Gama]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Solving The Variable Size Bin Packing Problem With Discretized Formulations.]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2008</year>
<volume>35</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>2103-13</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Crainic]]></surname>
<given-names><![CDATA[T.G]]></given-names>
</name>
<name>
<surname><![CDATA[Gobbato]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Perboli]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
<name>
<surname><![CDATA[Rei]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
<name>
<surname><![CDATA[Watson]]></surname>
<given-names><![CDATA[J.-P]]></given-names>
</name>
<name>
<surname><![CDATA[Woodruff]]></surname>
<given-names><![CDATA[D.L]]></given-names>
</name>
</person-group>
<source><![CDATA[Bin Packing Problems With Uncertainty On Item Characteristics: An Application To Capacity Planning In Logistics.]]></source>
<year>2014</year>
<volume>111</volume>
<page-range>654-62</page-range><publisher-name><![CDATA[Procedia - Social And Behavioral Sciences]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Crainic]]></surname>
<given-names><![CDATA[T.G]]></given-names>
</name>
<name>
<surname><![CDATA[Perboli]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
<name>
<surname><![CDATA[Rei]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
<name>
<surname><![CDATA[Tadei]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient Lower Bounds And Heuristics For The Variable Cost And Size Bin Packing Problem.]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2011</year>
<volume>38</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>1474-82</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dósa]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
<name>
<surname><![CDATA[Epstein]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<source><![CDATA[The Tight Asymptotic Approximation Ratio Of First Fit For Bin Packing With Cardinality Constraints.]]></source>
<year>2018</year>
<volume>96</volume>
<page-range>33-49</page-range><publisher-name><![CDATA[Journal Of Computer And System Sciences]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ebrahimnejad]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Verdegay]]></surname>
<given-names><![CDATA[J.L]]></given-names>
</name>
</person-group>
<source><![CDATA[Fuzzy Sets-Based Methods And Techniques For Modern Analytics.]]></source>
<year>2018</year>
<publisher-name><![CDATA[Springer International Publishing. Studies In Fuzziness And Soft Computing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fraire-Huacuja]]></surname>
<given-names><![CDATA[H.J]]></given-names>
</name>
<name>
<surname><![CDATA[Padilla]]></surname>
<given-names><![CDATA[A.E]]></given-names>
</name>
<name>
<surname><![CDATA[Cruz-Reyes]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Gómez-Santillán]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Rangel-Valdez]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
<name>
<surname><![CDATA[Morales-Rodríguez]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Frausto]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<source><![CDATA[Variable Neighborhood Search Algorithm For The Variable Cost And Size Bin Packing Problem.]]></source>
<year>2019</year>
<page-range>17</page-range><publisher-name><![CDATA[Handbook Of Research On Metaheuristics For Order Picking Optimization In Warehouses To Smart Cities.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Friesen]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Langston]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Variable Sized Bin-Packing]]></article-title>
<source><![CDATA[Siam J. Comput,]]></source>
<year>1986</year>
<volume>15</volume>
<numero>1</numero>
<issue>1</issue>
</nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gobbato]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<source><![CDATA[Stochastic Programming For City Logistics: New Models And Methods]]></source>
<year>2014</year>
<publisher-name><![CDATA[Politecnico Di Torino]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Haouari]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Serairi]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Heuristics For The Variable Sized Bin-Packing Problem]]></article-title>
<source><![CDATA[Computers And Operations Research,]]></source>
<year>2009</year>
<volume>36</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>2877-2884.</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hassanat]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Almohammadi]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
<name>
<surname><![CDATA[Alkafaween]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
<name>
<surname><![CDATA[Abunawas]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
<name>
<surname><![CDATA[Hammouri]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Prasath]]></surname>
<given-names><![CDATA[V]]></given-names>
</name>
</person-group>
<source><![CDATA[Choosing Mutation And Crossover Ratios For Genetic Algorithms - A Review With A New Dynamic Approach]]></source>
<year>2019</year>
<volume>10</volume>
<page-range>390</page-range><publisher-name><![CDATA[Inf]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Herrera-Franklin]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Rosete]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[García-Borroto]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Cabrera-García]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Influencia De Distribuciones Estadísticas En La Complejidad De Instancias Del Problema De Empaquetamiento Con Tamaño Y Costo Variable]]></article-title>
<source><![CDATA[Revista De Ingeniería Mecánica]]></source>
<year>2020</year>
<volume>23</volume>
<numero>2</numero>
<issue>2</issue>
</nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Herrera-Franklin]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Rosete]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[García-Borroto]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Cruz-Corona]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Pelta]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<source><![CDATA[On The Impact Of Fuzzy Constraints In The Variable Size And Cost Bin Packing Problem.]]></source>
<year>2020</year>
<page-range>230-40</page-range><publisher-name><![CDATA[Cham: Springer International Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kalaskar]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Variable Size Bin Packing Algorithm For Iot.]]></article-title>
<source><![CDATA[International Journal Of Science And Research (Ijsr)]]></source>
<year>2013</year>
<volume>4</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>2599-602</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mann]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
</person-group>
<source><![CDATA[Approximability Of Virtual Machine Allocation: Much Harder Than Bin Packing.]]></source>
<year>2015</year>
<publisher-name><![CDATA[Proceedings Of The 9th Hungarian-Japanese Symposium On Discrete Mathematics And Its Applications.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mohamed]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Said]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Lakhdar]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<source><![CDATA[Continuous Lower Bound For The Variable Sized Bin-Packing Problem.]]></source>
<year>2012</year>
<page-range>8-13</page-range><publisher-name><![CDATA[9th International Conference On Modeling, Optimization &amp; Simulation]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mohammed]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Balaji]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Basha]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Venkatachalam]]></surname>
<given-names><![CDATA[Asha]]></given-names>
</name>
</person-group>
<source><![CDATA[Fco - Fuzzy Constraints Applied Cluster Optimization Technique For Wireless Adhoc Networks.]]></source>
<year>2020</year>
<volume>154</volume>
<page-range>501-8</page-range><publisher-name><![CDATA[Computer Communications]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Naseri]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Khazaei]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Parametric Approach To Solving The Fuzzy Multi-Objective Linear Fractional Programming Problem.]]></article-title>
<source><![CDATA[Journal Of New Researches In Mathematics]]></source>
<year>2018</year>
<volume>4</volume>
<numero>14</numero>
<issue>14</issue>
<page-range>87-102</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pillay]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
<name>
<surname><![CDATA[Qu]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<source><![CDATA[Hyper-Heuristics: Theory And Applications]]></source>
<year>2018</year>
<page-range>67-73</page-range><publisher-name><![CDATA[Springer, Cham, Natural Computing Series]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shavarani]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Mosallaeipour]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Golabi]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Izbirak]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<source><![CDATA[A Congested Capacitated Multi-Level Fuzzy Facility Location Problem: An Efficient Drone Delivery System]]></source>
<year>2019</year>
<volume>108</volume>
<page-range>57-68</page-range><publisher-name><![CDATA[Computers And Operations Research]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Stanojevic]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
<name>
<surname><![CDATA[Stanojevic]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<source><![CDATA[On Fuzzy Solutions To A Class Of Fuzzy Multi-Objective Linear Optimization Problems]]></source>
<year>2020</year>
<page-range>63-76</page-range><publisher-name><![CDATA[Springer, Cham]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B28">
<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>2009</year>
<publisher-name><![CDATA[John Wiley &amp; Sons, Inc]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Torres]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Pelta]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Teresa Lamata]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<source><![CDATA[A New Approach For Solving Personalized Routing Problems With Fuzzy Constraints.]]></source>
<year>2018</year>
<page-range>1-5.</page-range><publisher-name><![CDATA[2018 Ieee International Conference On Fuzzy Systems (Fuzz-Ieee)]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Mehrotra]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<source><![CDATA[Chance-Constrained Bin Packing Problem With An Application To Operating Room Planning.]]></source>
<year>2019</year>
<publisher-name><![CDATA[Optimization Online]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
