Menu

Filtros : "Evolutionary combinatorial optimization" Removido: "2016" Limpar

Filtros

Refine with date range

  • 1

1 - 3 (3 records)

  • Artigo de periodico

    A new generalized partition crossover for the traveling salesman problem: tunneling between local optima (2020)

    Tinós, Renato ; Whitley, Darrell; Ochoa, Gabriela

    Source: Evolutionary Computation. Unidade: FFCLRP

    Subjects: COMPUTAÇÃO EVOLUTIVA, OTIMIZAÇÃO COMBINATÓRIA

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      TINÓS, Renato e WHITLEY, Darrell e OCHOA, Gabriela. A new generalized partition crossover for the traveling salesman problem: tunneling between local optima. Evolutionary Computation, v. 28, n. 2, p. 255-288, 2020Tradução . . Disponível em: https://doi.org/10.1162/evco_a_00254. Acesso em: 29 jan. 2026.

    • APA

      Tinós, R., Whitley, D., & Ochoa, G. (2020). A new generalized partition crossover for the traveling salesman problem: tunneling between local optima. Evolutionary Computation, 28( 2), 255-288. doi:10.1162/evco_a_00254

    • NLM

      Tinós R, Whitley D, Ochoa G. A new generalized partition crossover for the traveling salesman problem: tunneling between local optima [Internet]. Evolutionary Computation. 2020 ; 28( 2): 255-288.[citado 2026 jan. 29 ] Available from: https://doi.org/10.1162/evco_a_00254

    • Vancouver

      Tinós R, Whitley D, Ochoa G. A new generalized partition crossover for the traveling salesman problem: tunneling between local optima [Internet]. Evolutionary Computation. 2020 ; 28( 2): 255-288.[citado 2026 jan. 29 ] Available from: https://doi.org/10.1162/evco_a_00254

  • Trabalho de evento

    A new method for identification of recombining components in the generalized partition crossover (2019)

    Carvalho, Ozeas Quevedo de; Tinós, Renato ; Whitley, Darrell; Sanches, Danilo Sipoli

    Source: Proceedings. Conference titles: Brazilian Conference on Intelligent Systems (BRACIS). Unidade: FFCLRP

    Assunto: OTIMIZAÇÃO COMBINATÓRIA

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      CARVALHO, Ozeas Quevedo de et al. A new method for identification of recombining components in the generalized partition crossover. 2019, Anais.. Piscataway: IEEE, 2019. Disponível em: https://doi.org/10.1109/BRACIS.2019.00016. Acesso em: 29 jan. 2026.

    • APA

      Carvalho, O. Q. de, Tinós, R., Whitley, D., & Sanches, D. S. (2019). A new method for identification of recombining components in the generalized partition crossover. In Proceedings. Piscataway: IEEE. doi:10.1109/BRACIS.2019.00016

    • NLM

      Carvalho OQ de, Tinós R, Whitley D, Sanches DS. A new method for identification of recombining components in the generalized partition crossover [Internet]. Proceedings. 2019 ;[citado 2026 jan. 29 ] Available from: https://doi.org/10.1109/BRACIS.2019.00016

    • Vancouver

      Carvalho OQ de, Tinós R, Whitley D, Sanches DS. A new method for identification of recombining components in the generalized partition crossover [Internet]. Proceedings. 2019 ;[citado 2026 jan. 29 ] Available from: https://doi.org/10.1109/BRACIS.2019.00016

  • Trabalho de evento-anais periodico

    Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic (2018)

    Tinós, Renato ; Helsgaun, Keld; Whitley, Darrell

    Source: Lecture Notes in Computer Science. Conference titles: International Conference on Parallel Problem Solving from Nature (PPSN). Unidade: FFCLRP

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, MATEMÁTICA DA COMPUTAÇÃO, CIÊNCIA DA COMPUTAÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      TINÓS, Renato e HELSGAUN, Keld e WHITLEY, Darrell. Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic. Lecture Notes in Computer Science. Cham: Springer International Publishing. Disponível em: https://doi.org/10.1007/978-3-319-99253-2_8. Acesso em: 29 jan. 2026. , 2018

    • APA

      Tinós, R., Helsgaun, K., & Whitley, D. (2018). Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic. Lecture Notes in Computer Science. Cham: Springer International Publishing. doi:10.1007/978-3-319-99253-2_8

    • NLM

      Tinós R, Helsgaun K, Whitley D. Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic [Internet]. Lecture Notes in Computer Science. 2018 ; 11101 95-107.[citado 2026 jan. 29 ] Available from: https://doi.org/10.1007/978-3-319-99253-2_8

    • Vancouver

      Tinós R, Helsgaun K, Whitley D. Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic [Internet]. Lecture Notes in Computer Science. 2018 ; 11101 95-107.[citado 2026 jan. 29 ] Available from: https://doi.org/10.1007/978-3-319-99253-2_8
  • 1

1 - 3 (3 records)

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2026