Solución al Problema de Secuenciación de Trabajos mediante el Problema del Agente Viajero
Solution of the Job-Shop Scheduling Problem through the Traveling Salesman Problem
G.E. Anaya Fuentes, E.S. Hernández Gress
, J.C. Seck Tuoh Mora, J. Medina Marín
Autor para correspondencia
Universidad Autónoma del Estado de Hidalgo, Área Académica de Ingeniería; Carboneras,CP 42183, Mineral de la Reforma Hidalgo, México
Leído
4613
Vecesse ha leído el artículo
2851
Total PDF
1762
Total HTML
Compartir estadísticas
array:23 [ "pii" => "S1697791216300280" "issn" => "16977912" "doi" => "10.1016/j.riai.2016.07.003" "estado" => "S300" "fechaPublicacion" => "2016-10-01" "aid" => "298" "copyrightAnyo" => "2016" "documento" => "article" "crossmark" => 1 "licencia" => "http://creativecommons.org/licenses/by-nc-nd/4.0/" "subdocumento" => "fla" "cita" => "Revista Iberoamericana de Automática e Informática industrial. 2016;13:430-7" "abierto" => array:3 [ "ES" => true "ES2" => true "LATM" => true ] "gratuito" => true "lecturas" => array:2 [ "total" => 1386 "formatos" => array:3 [ "EPUB" => 29 "HTML" => 818 "PDF" => 539 ] ] "itemSiguiente" => array:18 [ "pii" => "S1697791216300267" "issn" => "16977912" "doi" => "10.1016/j.riai.2016.07.001" "estado" => "S300" "fechaPublicacion" => "2016-10-01" "aid" => "296" "documento" => "article" "crossmark" => 1 "licencia" => "http://creativecommons.org/licenses/by-nc-nd/4.0/" "subdocumento" => "fla" "cita" => "Revista Iberoamericana de Automática e Informática industrial. 2016;13:438-49" "abierto" => array:3 [ "ES" => true "ES2" => true "LATM" => true ] "gratuito" => true "lecturas" => array:2 [ "total" => 1056 "formatos" => array:3 [ "EPUB" => 26 "HTML" => 735 "PDF" => 295 ] ] "es" => array:11 [ "idiomaDefecto" => true "titulo" => "Control de Modelos Max Plus Lineales con Restricciones Temporales" "tienePdf" => "es" "tieneTextoCompleto" => "es" "tieneResumen" => array:2 [ 0 => "es" 1 => "en" ] "paginas" => array:1 [ 0 => array:2 [ "paginaInicial" => "438" "paginaFinal" => "449" ] ] "titulosAlternativos" => array:1 [ "en" => array:1 [ "titulo" => "Control Problem in Max Plus Linear Model with Temporal Constraints" ] ] "contieneResumen" => array:2 [ "es" => true "en" => true ] "contieneTextoCompleto" => array:1 [ "es" => true ] "contienePdf" => array:1 [ "es" => true ] "autores" => array:1 [ 0 => array:2 [ "autoresLista" => "C. Cárdenas, J. Cardillo, J.J. Loiseau, C. Martinez" "autores" => array:4 [ 0 => array:2 [ "nombre" => "C." "apellidos" => "Cárdenas" ] 1 => array:2 [ "nombre" => "J." "apellidos" => "Cardillo" ] 2 => array:2 [ "nombre" => "J.J." "apellidos" => "Loiseau" ] 3 => array:2 [ "nombre" => "C." "apellidos" => "Martinez" ] ] ] ] ] "idiomaDefecto" => "es" "EPUB" => "https://multimedia.elsevier.es/PublicationsMultimediaV1/item/epub/S1697791216300267?idApp=UINPBA00004N" "url" => "/16977912/0000001300000004/v2_201610120039/S1697791216300267/v2_201610120039/es/main.assets" ] "itemAnterior" => array:18 [ "pii" => "S1697791216300346" "issn" => "16977912" "doi" => "10.1016/j.riai.2016.07.005" "estado" => "S300" "fechaPublicacion" => "2016-10-01" "aid" => "304" "documento" => "article" "crossmark" => 1 "licencia" => "http://creativecommons.org/licenses/by-nc-nd/4.0/" "subdocumento" => "fla" "cita" => "Revista Iberoamericana de Automática e Informática industrial. 2016;13:421-9" "abierto" => array:3 [ "ES" => true "ES2" => true "LATM" => true ] "gratuito" => true "lecturas" => array:2 [ "total" => 2033 "formatos" => array:3 [ "EPUB" => 41 "HTML" => 1459 "PDF" => 533 ] ] "es" => array:11 [ "idiomaDefecto" => true "titulo" => "Desarrollo de un Sistema de Iluminación Artificial Inteligente para Cultivos Protegidos" "tienePdf" => "es" "tieneTextoCompleto" => "es" "tieneResumen" => array:2 [ 0 => "es" 1 => "en" ] "paginas" => array:1 [ 0 => array:2 [ "paginaInicial" => "421" "paginaFinal" => "429" ] ] "titulosAlternativos" => array:1 [ "en" => array:1 [ "titulo" => "Development of an Artificial Intelligent Lighting System for Protected Crops" ] ] "contieneResumen" => array:2 [ "es" => true "en" => true ] "contieneTextoCompleto" => array:1 [ "es" => true ] "contienePdf" => array:1 [ "es" => true ] "autores" => array:1 [ 0 => array:2 [ "autoresLista" => "Basil Mohammed Al-Hadithi, Cecilia E. García Cena, Raquel Cedazo León, Carlos Loor Loor" "autores" => array:4 [ 0 => array:2 [ "nombre" => "Basil Mohammed" "apellidos" => "Al-Hadithi" ] 1 => array:2 [ "nombre" => "Cecilia E. García" "apellidos" => "Cena" ] 2 => array:2 [ "nombre" => "Raquel Cedazo" "apellidos" => "León" ] 3 => array:2 [ "nombre" => "Carlos Loor" "apellidos" => "Loor" ] ] ] ] ] "idiomaDefecto" => "es" "EPUB" => "https://multimedia.elsevier.es/PublicationsMultimediaV1/item/epub/S1697791216300346?idApp=UINPBA00004N" "url" => "/16977912/0000001300000004/v2_201610120039/S1697791216300346/v2_201610120039/es/main.assets" ] "es" => array:14 [ "idiomaDefecto" => true "titulo" => "Solución al Problema de Secuenciación de Trabajos mediante el Problema del Agente Viajero" "tieneTextoCompleto" => true "paginas" => array:1 [ 0 => array:2 [ "paginaInicial" => "430" "paginaFinal" => "437" ] ] "autores" => array:1 [ 0 => array:4 [ "autoresLista" => "G.E. Anaya Fuentes, E.S. Hernández Gress, J.C. Seck Tuoh Mora, J. Medina Marín" "autores" => array:4 [ 0 => array:3 [ "nombre" => "G.E." "apellidos" => "Anaya Fuentes" "email" => array:1 [ 0 => "gustavoerick_anay@hotmail.com" ] ] 1 => array:4 [ "nombre" => "E.S." "apellidos" => "Hernández Gress" "email" => array:1 [ 0 => "evaselenehg@hotmail.com" ] "referencia" => array:1 [ 0 => array:2 [ "etiqueta" => "<span class="elsevierStyleSup">*</span>" "identificador" => "cor0005" ] ] ] 2 => array:3 [ "nombre" => "J.C." "apellidos" => "Seck Tuoh Mora" "email" => array:1 [ 0 => "juanseck@gmail.com" ] ] 3 => array:3 [ "nombre" => "J." "apellidos" => "Medina Marín" "email" => array:1 [ 0 => "jmedina@uaeh.edu.mx" ] ] ] "afiliaciones" => array:1 [ 0 => array:2 [ "entidad" => "Universidad Autónoma del Estado de Hidalgo, Área Académica de Ingeniería; Carboneras,CP 42183, Mineral de la Reforma Hidalgo, México" "identificador" => "aff0005" ] ] "correspondencia" => array:1 [ 0 => array:3 [ "identificador" => "cor0005" "etiqueta" => "⁎" "correspondencia" => "Autor para correspondencia." ] ] ] ] "titulosAlternativos" => array:1 [ "en" => array:1 [ "titulo" => "Solution of the Job-Shop Scheduling Problem through the Traveling Salesman Problem" ] ] "textoCompleto" => "<span class="elsevierStyleSections"><span id="sec0005" class="elsevierStyleSection elsevierViewall"><span class="elsevierStyleSectionTitle" id="sect0025">Referencias no citadas</span><p id="par0005" class="elsevierStylePara elsevierViewall"><a class="elsevierStyleCrossRef" href="#bib0005">Beasley, 1990</a>, <a class="elsevierStyleCrossRef" href="#bib0010">Bektas, 2006</a>, <a class="elsevierStyleCrossRef" href="#bib0015">Bozejko et al., 2009</a>, <a class="elsevierStyleCrossRef" href="#bib0020">Buthainah and Hamza, 2008</a>, <a class="elsevierStyleCrossRef" href="#bib0025">Cerny, 1985</a>, <a class="elsevierStyleCrossRef" href="#bib0030">Chambers, 1998</a>, <a class="elsevierStyleCrossRef" href="#bib0035">Chatterjee et al., 1996</a>, <a class="elsevierStyleCrossRef" href="#bib0130">Chunguo et al., 2004</a>, <a class="elsevierStyleCrossRef" href="#bib0040">Delgado, 2005</a>, <a class="elsevierStyleCrossRef" href="#bib0045">Dorigo, 1997</a>, <a class="elsevierStyleCrossRef" href="#bib0050">Fogel, 1998</a>, <a class="elsevierStyleCrossRef" href="#bib0055">Gao et al., 2007</a>, <a class="elsevierStyleCrossRef" href="#bib0060">Ge et al., 2007</a>, <a class="elsevierStyleCrossRef" href="#bib0065">Gerhard, 2006</a>, <a class="elsevierStyleCrossRef" href="#bib0070">Goldberg, 1989</a>, <a class="elsevierStyleCrossRef" href="#bib0075">Holland, 1992</a>, <a class="elsevierStyleCrossRef" href="#bib0080">Jog et al., 1991</a>, <a class="elsevierStyleCrossRef" href="#bib0085">Juang, 2004</a>, <a class="elsevierStyleCrossRef" href="#bib0135">Larrañaga et al., 1999</a>, <a class="elsevierStyleCrossRef" href="#bib0090">Maldonado, 2010</a>, <a class="elsevierStyleCrossRef" href="#bib0095">Moon et al., 2002</a>, <a class="elsevierStyleCrossRef" href="#bib0100">Ruiz, 2011</a>, <a class="elsevierStyleCrossRef" href="#bib0105">Sivanamdam and Deepa, 2008</a>, <a class="elsevierStyleCrossRef" href="#bib0110">Tamilarasi y Anantha, 2010</a>, <a class="elsevierStyleCrossRef" href="#bib0115">Wagner, 1975</a>, <a class="elsevierStyleCrossRef" href="#bib0120">Winston, 2005</a> y <a class="elsevierStyleCrossRef" href="#bib0125">Yamada y Nakano, 1997</a>.</p></span></span>" "textoCompletoSecciones" => array:1 [ "secciones" => array:6 [ 0 => array:3 [ "identificador" => "xres740057" "titulo" => "Resumen" "secciones" => array:1 [ 0 => array:1 [ "identificador" => "abst0005" ] ] ] 1 => array:2 [ "identificador" => "xpalclavsec744093" "titulo" => "Palabras clave" ] 2 => array:3 [ "identificador" => "xres740056" "titulo" => "Abstract" "secciones" => array:1 [ 0 => array:1 [ "identificador" => "abst0010" ] ] ] 3 => array:2 [ "identificador" => "xpalclavsec744092" "titulo" => "Keywords" ] 4 => array:2 [ "identificador" => "sec0005" "titulo" => "Referencias no citadas" ] 5 => array:1 [ "titulo" => "Referencias" ] ] ] "pdfFichero" => "main.pdf" "tienePdf" => true "PalabrasClave" => array:2 [ "es" => array:1 [ 0 => array:4 [ "clase" => "keyword" "titulo" => "Palabras clave" "identificador" => "xpalclavsec744093" "palabras" => array:4 [ 0 => "algoritmos eficientes" 1 => "sistemas industriales de producción" 2 => "problemas de optimización" 3 => "problema de agente viajero" ] ] ] "en" => array:1 [ 0 => array:4 [ "clase" => "keyword" "titulo" => "Keywords" "identificador" => "xpalclavsec744092" "palabras" => array:4 [ 0 => "Efficient algorithms" 1 => "industrial production systems" 2 => "optimization problem" 3 => "traveling salesman problem" ] ] ] ] "tieneResumen" => true "resumen" => array:2 [ "es" => array:2 [ "titulo" => "Resumen" "resumen" => "<span id="abst0005" class="elsevierStyleSection elsevierViewall"><p id="spar0005" class="elsevierStyleSimplePara elsevierViewall">En este trabajo se estudia el Problema de Secuenciación de Trabajos codificado como un Problema de Agente Viajero y resuelto mediante Algoritmos Genéticos. Se propone un Algoritmo Genético en donde se comparan dos tipos de selección: por torneo y por ruleta. Se realizan diferentes pruebas para la solución del Problema del Agente Viajero con los dos tipos de selección bajo diferentes parámetros: número de individuos, número de iteraciones, probabilidad de cruce y probabilidad de mutación; a partir de estos se seleccionan los parámetros y el tipo de selección. Posteriormente se codifica al Problema de Secuenciación como un Problema del Agente Viajero. La propuesta se presenta mediante la aplicación a diferentes ejemplos del Problema de Secuenciación de Trabajos y la comparación con los resultados obtenidos en la literatura<span class="elsevierStyleItalic">.</span></p></span>" ] "en" => array:2 [ "titulo" => "Abstract" "resumen" => "<span id="abst0010" class="elsevierStyleSection elsevierViewall"><p id="spar0010" class="elsevierStyleSimplePara elsevierViewall">In this paper we proposed a solution to the Job-Shop Scheduling Problem using the Traveling Salesman Problem solved by Genetic Algorithms. We proposed a genetic algorithm where we compare two types of selection: tournament and roulette. Different tests are performed to solve the Traveling Salesman Problem with the two types of selection under different parameters: number of individuals, number of iterations, crossover probability and mutation probability. Then the best type of selection and the best parameters are used to solve the Job-Shop Scheduling Problem with Genetic Algorithms for the Traveling Salesman Problem. The proposal is presented solving different examples of Job Sequencing Problem and compare them with the results obtained in the literature.</p></span>" ] ] "bibliografia" => array:2 [ "titulo" => "Referencias" "seccion" => array:1 [ 0 => array:2 [ "identificador" => "bibs0005" "bibliografiaReferencia" => array:27 [ 0 => array:3 [ "identificador" => "bib0005" "etiqueta" => "Beasley, 1990" "referencia" => array:1 [ 0 => array:2 [ "contribucion" => array:1 [ 0 => array:2 [ "titulo" => "OR-Library: Distributing test problems by electronic mail" "autores" => array:1 [ 0 => array:2 [ "etal" => false "autores" => array:1 [ 0 => "J. Beasley" ] ] ] ] ] "host" => array:1 [ 0 => array:1 [ "Revista" => array:5 [ "tituloSerie" => "Journal of the Operational Research Society" "fecha" => "1990" "volumen" => "11" "paginaInicial" => "1069" "paginaFinal" => "1072" ] ] ] ] ] ] 1 => array:3 [ "identificador" => "bib0010" "etiqueta" => "Bektas, 2006" "referencia" => array:1 [ 0 => array:1 [ "referenciaCompleta" => "Bektas, T., 2006. The multiple traveling salesman problem: an overview of formulations and solution procedures, 34,209-219." ] ] ] 2 => array:3 [ "identificador" => "bib0015" "etiqueta" => "Bozejko et al., 2009" "referencia" => array:1 [ 0 => array:2 [ "contribucion" => array:1 [ 0 => array:2 [ "titulo" => "Parallel simulated annealing for the Job Shop Scheduling problem" "autores" => array:1 [ 0 => array:2 [ "etal" => false "autores" => array:3 [ 0 => "W. Bozejko" 1 => "J. Pempera" 2 => "C. Smuntnicki" ] ] ] ] ] "host" => array:1 [ 0 => array:1 [ "Revista" => array:5 [ "tituloSerie" => "Biological Cybernetics" "fecha" => "2009" "volumen" => "60" "paginaInicial" => "139" "paginaFinal" => "144" ] ] ] ] ] ] 3 => array:3 [ "identificador" => "bib0020" "etiqueta" => "Buthainah and Hamza, 2008" "referencia" => array:1 [ 0 => array:2 [ "contribucion" => array:1 [ 0 => array:2 [ "titulo" => "Enhanced Traveling Salesman Problem solving by Genetic Algorithm Technique" "autores" => array:1 [ 0 => array:2 [ "etal" => false "autores" => array:2 [ 0 => "F. Buthainah" 1 => "A. Hamza" ] ] ] ] ] "host" => array:1 [ 0 => array:1 [ "Revista" => array:5 [ "tituloSerie" => "World Academy of Science, Engineering and Technology" "fecha" => "2008" "volumen" => "38" "paginaInicial" => "298" "paginaFinal" => "302" ] ] ] ] ] ] 4 => array:3 [ "identificador" => "bib0025" "etiqueta" => "Cerny, 1985" "referencia" => array:1 [ 0 => array:1 [ "referenciaCompleta" => "Cerny, V., 1985. Thermodynamical Approach to the Traveling Salesman Problem: An Efficient Simulation Algorithm. Lecture note in computer science Proceedings of the 9<span class="elsevierStyleSup">th</span> Intenational Conference on Computational Science, 5544, 631-640." ] ] ] 5 => array:3 [ "identificador" => "bib0030" "etiqueta" => "Chambers, 1998" "referencia" => array:1 [ 0 => array:2 [ "contribucion" => array:1 [ 0 => array:2 [ "titulo" => "Genetic Algorithms" "autores" => array:1 [ 0 => array:2 [ "etal" => false "autores" => array:1 [ 0 => "L. Chambers" ] ] ] ] ] "host" => array:1 [ 0 => array:1 [ "Libro" => array:3 [ "fecha" => "1998" "editorial" => "University Western Press" "editorialLocalizacion" => "Australia" ] ] ] ] ] ] 6 => array:3 [ "identificador" => "bib0035" "etiqueta" => "Chatterjee et al., 1996" "referencia" => array:1 [ 0 => array:2 [ "contribucion" => array:1 [ 0 => array:2 [ "titulo" => "Genetic Algorithms and traveling salesman problems" "autores" => array:1 [ 0 => array:2 [ "etal" => false "autores" => array:3 [ 0 => "S. Chatterjee" 1 => "C. Carrera" 2 => "L. Linch" ] ] ] ] ] "host" => array:1 [ 0 => array:1 [ "Revista" => array:4 [ "tituloSerie" => "Siam Journal of Optimation" "fecha" => "1996" "paginaInicial" => "515" "paginaFinal" => "529" ] ] ] ] ] ] 7 => array:3 [ "identificador" => "bib0130" "etiqueta" => "Chunguo et al., 2004" "referencia" => array:1 [ 0 => array:2 [ "contribucion" => array:1 [ 0 => array:2 [ "titulo" => "A Modified Integer-Coding Genetic Algorithm for Job Shop Scheduling Problem, Trends in Artificial Intelligence" "autores" => array:1 [ 0 => array:2 [ "etal" => false "autores" => array:3 [ 0 => "W. Chunguo" 1 => "X. Wei" 2 => "L. Yanchun" ] ] ] ] ] "host" => array:1 [ 0 => array:1 [ "Revista" => array:5 [ "tituloSerie" => "Lecture Notes in Computer Science" "fecha" => "2004" "volumen" => "3157" "paginaInicial" => "373" "paginaFinal" => "380" ] ] ] ] ] ] 8 => array:3 [ "identificador" => "bib0040" "etiqueta" => "Delgado, 2005" "referencia" => array:1 [ 0 => array:1 [ "referenciaCompleta" => "Delgado E., 2005. Aplicación de Algoritmos Genéticos para la Programación de Tareas de una celda de manufactura. Ingeniería e Investigación: Universidad Nacional de Colombia, 24-31." ] ] ] 9 => array:3 [ "identificador" => "bib0045" "etiqueta" => "Dorigo, 1997" "referencia" => array:1 [ 0 => array:2 [ "contribucion" => array:1 [ 0 => array:2 [ "titulo" => "Ant colonies for the traveling salesman problem" "autores" => array:1 [ 0 => array:2 [ "etal" => false "autores" => array:1 [ 0 => "M. Dorigo" ] ] ] ] ] "host" => array:1 [ 0 => array:1 [ "Libro" => array:3 [ "fecha" => "1997" "editorial" => "Universidad Libre de Bruselas" "editorialLocalizacion" => "Bélgica" ] ] ] ] ] ] 10 => array:3 [ "identificador" => "bib0050" "etiqueta" => "Fogel, 1998" "referencia" => array:1 [ 0 => array:2 [ "contribucion" => array:1 [ 0 => array:2 [ "titulo" => "An evolutionary approach to the traveling salesman problem" "autores" => array:1 [ 0 => array:2 [ "etal" => false "autores" => array:1 [ 0 => "D. Fogel" ] ] ] ] ] "host" => array:1 [ 0 => array:1 [ "Revista" => array:5 [ "tituloSerie" => "Biological Cybernetics" "fecha" => "1998" "volumen" => "60" "paginaInicial" => "139" "paginaFinal" => "144" ] ] ] ] ] ] 11 => array:3 [ "identificador" => "bib0055" "etiqueta" => "Gao et al., 2007" "referencia" => array:1 [ 0 => array:1 [ "referenciaCompleta" => "Gao, S., Zhang L, and Zhang F. 2007. g. <span class="elsevierStyleBold">S</span>olving Traveling Salesman Problem by Ant Colony Optimization Algorithm with Association Rule Proceedings of the Third International Conference on Natural Computation, 3, 693-698." ] ] ] 12 => array:3 [ "identificador" => "bib0060" "etiqueta" => "Ge et al., 2007" "referencia" => array:1 [ 0 => array:1 [ "referenciaCompleta" => "Ge, H., Du W., y Quian F., 2007. A hybrid algorithm based on swarm optimization and simulated annealing for job shop scheduling. Proceedings of the Third International Conference on Natural Computation, 3, 715-719." ] ] ] 13 => array:3 [ "identificador" => "bib0065" "etiqueta" => "Gerhard, 2006" "referencia" => array:1 [ 0 => array:2 [ "contribucion" => array:1 [ 0 => array:2 [ "titulo" => "Discrete and Combinatorial Optimization" "autores" => array:1 [ 0 => array:2 [ "etal" => false "autores" => array:1 [ 0 => "R. Gerhard" ] ] ] ] ] "host" => array:1 [ 0 => array:1 [ "Libro" => array:3 [ "fecha" => "2006" "editorial" => "Universidad de Heidelberg-Instituto de Ciencias de la Computación" "editorialLocalizacion" => "Alemania" ] ] ] ] ] ] 14 => array:3 [ "identificador" => "bib0070" "etiqueta" => "Goldberg, 1989" "referencia" => array:1 [ 0 => array:2 [ "contribucion" => array:1 [ 0 => array:2 [ "titulo" => "Genetic Algorithms in Search" "autores" => array:1 [ 0 => array:2 [ "etal" => false "autores" => array:1 [ 0 => "D. Goldberg" ] ] ] ] ] "host" => array:1 [ 0 => array:1 [ "Libro" => array:4 [ "titulo" => "Optimization and Machine Learning" "fecha" => "1989" "editorial" => "Addison-Wesley Publishing Corporation" "editorialLocalizacion" => "Estados Unidos de América" ] ] ] ] ] ] 15 => array:3 [ "identificador" => "bib0075" "etiqueta" => "Holland, 1992" "referencia" => array:1 [ 0 => array:2 [ "contribucion" => array:1 [ 0 => array:2 [ "titulo" => "Adaptation in Natural and Artificial Systems" "autores" => array:1 [ 0 => array:2 [ "etal" => false "autores" => array:1 [ 0 => "J. Holland" ] ] ] ] ] "host" => array:1 [ 0 => array:1 [ "Libro" => array:3 [ "fecha" => "1992" "editorial" => "MIT Press" "editorialLocalizacion" => "Cambridge, Estados Unidos de América" ] ] ] ] ] ] 16 => array:3 [ "identificador" => "bib0080" "etiqueta" => "Jog et al., 1991" "referencia" => array:1 [ 0 => array:2 [ "contribucion" => array:1 [ 0 => array:2 [ "titulo" => "Parallel Genetic Algorithms Applied to the Traveling Salesman Problem" "autores" => array:1 [ 0 => array:2 [ "etal" => false "autores" => array:4 [ 0 => "P. Jog" 1 => "J. Kim" 2 => "J. Suh" 3 => "D. Gucht" ] ] ] ] ] "host" => array:1 [ 0 => array:1 [ "Revista" => array:4 [ "tituloSerie" => "European Journal of Operational Research" "fecha" => "1991" "paginaInicial" => "490" "paginaFinal" => "510" ] ] ] ] ] ] 17 => array:3 [ "identificador" => "bib0085" "etiqueta" => "Juang, 2004" "referencia" => array:1 [ 0 => array:2 [ "contribucion" => array:1 [ 0 => array:2 [ "titulo" => "A hybrid genetic algorithm and particle swarm optimization for recurrent network design" "autores" => array:1 [ 0 => array:2 [ "etal" => false "autores" => array:1 [ 0 => "C. Juang" ] ] ] ] ] "host" => array:1 [ 0 => array:1 [ "Revista" => array:5 [ "tituloSerie" => "IEEE Transactions on Evolutionary Computation" "fecha" => "2004" "volumen" => "34" "paginaInicial" => "997" "paginaFinal" => "1006" ] ] ] ] ] ] 18 => array:3 [ "identificador" => "bib0135" "etiqueta" => "Larrañaga et al., 1999" "referencia" => array:1 [ 0 => array:2 [ "contribucion" => array:1 [ 0 => array:2 [ "titulo" => "Genetic Algorithms for the Traveling Salesman Problem: A review of Representations and Operators" "autores" => array:1 [ 0 => array:2 [ "etal" => false "autores" => array:5 [ 0 => "P. Larrañaga" 1 => "C. Kuijpers" 2 => "R. Murga" 3 => "I. Inza" 4 => "S. Dizdarevic" ] ] ] ] ] "host" => array:1 [ 0 => array:1 [ "Revista" => array:4 [ "tituloSerie" => "Artificial Intelligence Review" "fecha" => "1999" "paginaInicial" => "129" "paginaFinal" => "170" ] ] ] ] ] ] 19 => array:3 [ "identificador" => "bib0090" "etiqueta" => "Maldonado, 2010" "referencia" => array:1 [ 0 => array:1 [ "referenciaCompleta" => "Maldonado C. 2010. El mundo de las ciencias de la complejidad: Una investigación sobre qué son, su desarrollo y sus posibilidades. Universidad del Rosario." ] ] ] 20 => array:3 [ "identificador" => "bib0095" "etiqueta" => "Moon et al., 2002" "referencia" => array:1 [ 0 => array:2 [ "contribucion" => array:1 [ 0 => array:2 [ "titulo" => "An efficient genetic algorithm for the traveling salesman problem with precedent constraints" "autores" => array:1 [ 0 => array:2 [ "etal" => false "autores" => array:4 [ 0 => "C. Moon" 1 => "J. Kim" 2 => "G. Choi" 3 => "Y. Seo" ] ] ] ] ] "host" => array:1 [ 0 => array:1 [ "Revista" => array:5 [ "tituloSerie" => "European Journal of Operational Research" "fecha" => "2002" "paginaInicial" => "606" "paginaFinal" => "617" "itemHostRev" => array:3 [ "pii" => "S0735109703014153" "estado" => "S300" "issn" => "07351097" ] ] ] ] ] ] ] 21 => array:3 [ "identificador" => "bib0100" "etiqueta" => "Ruiz, 2011" "referencia" => array:1 [ 0 => array:2 [ "contribucion" => array:1 [ 0 => array:2 [ "titulo" => "Complexity Indicators Applied to the Job Shop Scheduling Problem" "autores" => array:1 [ 0 => array:2 [ "etal" => false "autores" => array:1 [ 0 => "J. Ruiz" ] ] ] ] ] "host" => array:1 [ 0 => array:1 [ "Revista" => array:4 [ "tituloSerie" => "International Journal of Combinatorial Optimization Problems and Informatics" "fecha" => "2011" "paginaInicial" => "25" "paginaFinal" => "31" ] ] ] ] ] ] 22 => array:3 [ "identificador" => "bib0105" "etiqueta" => "Sivanamdam and Deepa, 2008" "referencia" => array:1 [ 0 => array:2 [ "contribucion" => array:1 [ 0 => array:2 [ "titulo" => "Introduction to Genetic Algorithms" "autores" => array:1 [ 0 => array:2 [ "etal" => false "autores" => array:2 [ 0 => "S. Sivanamdam" 1 => "S. Deepa" ] ] ] ] ] "host" => array:1 [ 0 => array:1 [ "Libro" => array:3 [ "fecha" => "2008" "editorial" => "Springer" "editorialLocalizacion" => "Estados Unidos de América" ] ] ] ] ] ] 23 => array:3 [ "identificador" => "bib0110" "etiqueta" => "Tamilarasi y Anantha, 2010" "referencia" => array:1 [ 0 => array:2 [ "contribucion" => array:1 [ 0 => array:2 [ "titulo" => "An enhanced genetic algorithm with simulated annealing for jobshop scheduling" "autores" => array:1 [ 0 => array:2 [ "etal" => false "autores" => array:2 [ 0 => "A. Tamilarasi" 1 => "K. Anantha" ] ] ] ] ] "host" => array:1 [ 0 => array:1 [ "Revista" => array:5 [ "tituloSerie" => "International Journal of Engineering Science and Technology" "fecha" => "2010" "volumen" => "2" "paginaInicial" => "144" "paginaFinal" => "151" ] ] ] ] ] ] 24 => array:3 [ "identificador" => "bib0115" "etiqueta" => "Wagner, 1975" "referencia" => array:1 [ 0 => array:2 [ "contribucion" => array:1 [ 0 => array:2 [ "titulo" => "Principles of Operations Research" "autores" => array:1 [ 0 => array:2 [ "etal" => false "autores" => array:1 [ 0 => "H. Wagner" ] ] ] ] ] "host" => array:1 [ 0 => array:1 [ "Libro" => array:5 [ "edicion" => "2ª ed." "titulo" => "Englewood Cliffs" "fecha" => "1975" "editorial" => "N.J. Prentice Hall" "editorialLocalizacion" => "Estados Unidos de América" ] ] ] ] ] ] 25 => array:3 [ "identificador" => "bib0120" "etiqueta" => "Winston, 2005" "referencia" => array:1 [ 0 => array:2 [ "contribucion" => array:1 [ 0 => array:2 [ "titulo" => "Investigación de Operaciones: Aplicaciones y Algoritmos" "autores" => array:1 [ 0 => array:2 [ "etal" => false "autores" => array:1 [ 0 => "W. Winston" ] ] ] ] ] "host" => array:1 [ 0 => array:1 [ "Libro" => array:3 [ "fecha" => "2005" "editorial" => "Indiana University Press" "editorialLocalizacion" => "Estados Unidos de América" ] ] ] ] ] ] 26 => array:3 [ "identificador" => "bib0125" "etiqueta" => "Yamada y Nakano, 1997" "referencia" => array:1 [ 0 => array:1 [ "referenciaCompleta" => "Yamada T., y Nakano R., 1997. Genetic Algorithms for Job Shop Scheduling. Proceedings of Modern Heuristic for Decision Support, UNICOM Seminar London, 67-81." ] ] ] ] ] ] ] ] "idiomaDefecto" => "es" "url" => "/16977912/0000001300000004/v2_201610120039/S1697791216300280/v2_201610120039/es/main.assets" "Apartado" => array:4 [ "identificador" => "41963" "tipo" => "SECCION" "en" => array:2 [ "titulo" => "Artículos" "idiomaDefecto" => true ] "idiomaDefecto" => "en" ] "PDF" => "https://static.elsevier.es/multimedia/16977912/0000001300000004/v2_201610120039/S1697791216300280/v2_201610120039/es/main.pdf?idApp=UINPBA00004N&text.app=https://www.elsevier.es/" "EPUB" => "https://multimedia.elsevier.es/PublicationsMultimediaV1/item/epub/S1697791216300280?idApp=UINPBA00004N" ]
| año/Mes | Html | Total | |
|---|---|---|---|
| 2024 Octubre | 6 | 4 | 10 |
| 2024 Septiembre | 4 | 8 | 12 |
| 2024 Agosto | 7 | 3 | 10 |
| 2024 Julio | 10 | 7 | 17 |
| 2024 Junio | 7 | 3 | 10 |
| 2024 Mayo | 17 | 2 | 19 |
| 2024 Abril | 8 | 11 | 19 |
| 2024 Marzo | 13 | 14 | 27 |
| 2024 Febrero | 11 | 11 | 22 |
| 2024 Enero | 13 | 6 | 19 |
| 2023 Diciembre | 16 | 18 | 34 |
| 2023 Noviembre | 12 | 23 | 35 |
| 2023 Octubre | 25 | 23 | 48 |
| 2023 Septiembre | 15 | 8 | 23 |
| 2023 Agosto | 13 | 10 | 23 |
| 2023 Julio | 10 | 43 | 53 |
| 2023 Junio | 20 | 45 | 65 |
| 2023 Mayo | 9 | 40 | 49 |
| 2023 Abril | 14 | 33 | 47 |
| 2023 Marzo | 15 | 65 | 80 |
| 2023 Febrero | 11 | 44 | 55 |
| 2023 Enero | 8 | 36 | 44 |
| 2022 Diciembre | 14 | 36 | 50 |
| 2022 Noviembre | 22 | 43 | 65 |
| 2022 Octubre | 10 | 43 | 53 |
| 2022 Septiembre | 19 | 38 | 57 |
| 2022 Agosto | 16 | 49 | 65 |
| 2022 Julio | 11 | 47 | 58 |
| 2022 Junio | 13 | 38 | 51 |
| 2022 Mayo | 10 | 31 | 41 |
| 2022 Abril | 18 | 30 | 48 |
| 2022 Marzo | 28 | 55 | 83 |
| 2022 Febrero | 11 | 49 | 60 |
| 2022 Enero | 37 | 76 | 113 |
| 2021 Diciembre | 29 | 51 | 80 |
| 2021 Noviembre | 23 | 82 | 105 |
| 2021 Octubre | 32 | 114 | 146 |
| 2021 Septiembre | 24 | 65 | 89 |
| 2021 Agosto | 16 | 53 | 69 |
| 2021 Julio | 14 | 71 | 85 |
| 2021 Junio | 19 | 41 | 60 |
| 2021 Mayo | 22 | 10 | 32 |
| 2021 Abril | 50 | 17 | 67 |
| 2021 Marzo | 29 | 82 | 111 |
| 2021 Febrero | 15 | 72 | 87 |
| 2021 Enero | 17 | 56 | 73 |
| 2020 Diciembre | 20 | 66 | 86 |
| 2020 Noviembre | 16 | 125 | 141 |
| 2020 Octubre | 14 | 69 | 83 |
| 2020 Septiembre | 23 | 69 | 92 |
| 2020 Agosto | 18 | 32 | 50 |
| 2020 Julio | 17 | 46 | 63 |
| 2020 Junio | 22 | 58 | 80 |
| 2020 Mayo | 15 | 57 | 72 |
| 2020 Abril | 9 | 31 | 40 |
| 2020 Marzo | 20 | 41 | 61 |
| 2020 Febrero | 13 | 26 | 39 |
| 2020 Enero | 10 | 26 | 36 |
| 2019 Diciembre | 10 | 29 | 39 |
| 2019 Noviembre | 9 | 33 | 42 |
| 2019 Octubre | 74 | 13 | 87 |
| 2019 Septiembre | 9 | 15 | 24 |
| 2019 Agosto | 7 | 11 | 18 |
| 2019 Julio | 15 | 34 | 49 |
| 2019 Junio | 23 | 41 | 64 |
| 2019 Mayo | 69 | 47 | 116 |
| 2019 Abril | 24 | 32 | 56 |
| 2019 Marzo | 7 | 36 | 43 |
| 2019 Febrero | 3 | 17 | 20 |
| 2019 Enero | 3 | 13 | 16 |
| 2018 Diciembre | 3 | 16 | 19 |
| 2018 Noviembre | 4 | 7 | 11 |
| 2018 Octubre | 6 | 17 | 23 |
| 2018 Septiembre | 4 | 5 | 9 |
| 2018 Agosto | 2 | 8 | 10 |
| 2018 Julio | 1 | 3 | 4 |
| 2018 Junio | 4 | 2 | 6 |
| 2018 Mayo | 1 | 9 | 10 |
| 2018 Abril | 5 | 7 | 12 |
| 2018 Marzo | 4 | 1 | 5 |
| 2018 Febrero | 0 | 1 | 1 |
| 2018 Enero | 5 | 0 | 5 |
| 2017 Diciembre | 5 | 2 | 7 |
| 2017 Noviembre | 4 | 2 | 6 |
| 2017 Octubre | 7 | 2 | 9 |
| 2017 Septiembre | 6 | 5 | 11 |
| 2017 Agosto | 6 | 11 | 17 |
| 2017 Julio | 9 | 6 | 15 |
| 2017 Junio | 9 | 3 | 12 |
| 2017 Mayo | 6 | 9 | 15 |
| 2017 Abril | 5 | 2 | 7 |
| 2017 Marzo | 13 | 25 | 38 |
| 2017 Febrero | 15 | 4 | 19 |
| 2017 Enero | 30 | 1 | 31 |
| 2016 Diciembre | 133 | 8 | 141 |
| 2016 Noviembre | 145 | 12 | 157 |
| 2016 Octubre | 117 | 10 | 127 |
Mostrar todo