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
Descripción
Sumario: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.

Ejemplares similares