Hybrid evolutionary algorithms for the TSP

Even if simply stated the travelling salesman problem (TSP) is one of the most studied NP-hard problems. Many algorithms have been proposed to solve TSP. Dynamic programming and branch and bound techniques provided the global optimum solution for the largest nontrivial instance of TSP with 7397 citi...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Minetti, Gabriela F., Hugo, Alfonso, Gallard, Raúl Hector
Formato: Objeto de conferencia
Lenguaje:Español
Publicado: 2001
Materias:
Ciencias Informáticas
Hybrid evolutionary algorithms
TSP
ARTIFICIAL INTELLIGENCE
Hybrid systems
Algorithms
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/21662
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-21662
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Español
topic Ciencias Informáticas
Hybrid evolutionary algorithms
TSP
ARTIFICIAL INTELLIGENCE
Hybrid systems
Algorithms
spellingShingle Ciencias Informáticas
Hybrid evolutionary algorithms
TSP
ARTIFICIAL INTELLIGENCE
Hybrid systems
Algorithms
Minetti, Gabriela F.
Hugo, Alfonso
Gallard, Raúl Hector
Hybrid evolutionary algorithms for the TSP
topic_facet Ciencias Informáticas
Hybrid evolutionary algorithms
TSP
ARTIFICIAL INTELLIGENCE
Hybrid systems
Algorithms
description Even if simply stated the travelling salesman problem (TSP) is one of the most studied NP-hard problems. Many algorithms have been proposed to solve TSP. Dynamic programming and branch and bound techniques provided the global optimum solution for the largest nontrivial instance of TSP with 7397 cities. However, 4 years of CPU time was required on a network of computers.
format Objeto de conferencia
Objeto de conferencia
author Minetti, Gabriela F.
Hugo, Alfonso
Gallard, Raúl Hector
author_facet Minetti, Gabriela F.
Hugo, Alfonso
Gallard, Raúl Hector
author_sort Minetti, Gabriela F.
title Hybrid evolutionary algorithms for the TSP
title_short Hybrid evolutionary algorithms for the TSP
title_full Hybrid evolutionary algorithms for the TSP
title_fullStr Hybrid evolutionary algorithms for the TSP
title_full_unstemmed Hybrid evolutionary algorithms for the TSP
title_sort hybrid evolutionary algorithms for the tsp
publishDate 2001
url http://sedici.unlp.edu.ar/handle/10915/21662
work_keys_str_mv AT minettigabrielaf hybridevolutionaryalgorithmsforthetsp
AT hugoalfonso hybridevolutionaryalgorithmsforthetsp
AT gallardraulhector hybridevolutionaryalgorithmsforthetsp
bdutipo_str Repositorios
_version_ 1764820464787521536

Ejemplares similares