Problema do caixeiro viajante: uma abordagem para o caso quadrático

The traveling salesman problem (TSP) is one of the most studied optimization problems in the literature, with various applications and variations. One such variation, the quadratic traveling salesman problem (QTSP), was initially introduced in the field of bioinformatics, focused on optimally findin...

Volledige beschrijving

Bewaard in:
Bibliografische gegevens
Hoofdauteur: Silva, Ítalo Epifânio de Lima e
Andere auteurs: Maia, Sílvia Maria Diniz Monteiro
Formaat: bachelorThesis
Taal:pt_BR
Gepubliceerd in: Universidade Federal do Rio Grande do Norte
Onderwerpen:
Problema do caixeiro viajante quadrático
Meta-heurísticas
Algoritmos evolucionários
Algoritmos genéticos
Algoritmos meméticos
Quadratic traveling salesman problem
Meta heuristics
Evolutionary algorithms
Genetic algorithms
Memetic algorithms
CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::TEORIA DA COMPUTACAO::ANALISE DE ALGORITMOS E COMPLEXIDADE DE COMPUTACAO
Online toegang:https://repositorio.ufrn.br/handle/123456789/56039
Tags: Voeg label toe
Geen labels, Wees de eerste die dit record labelt!

Internet

https://repositorio.ufrn.br/handle/123456789/56039

Gelijkaardige items