Hybrid evolutionary algorithms for the TSP

Autores
Minetti, Gabriela F.; Hugo, Alfonso; Gallard, Raúl Hector
Año de publicación
2001
Idioma
español castellano
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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.
Eje: Inteligencia Computacional - Metaheurísticas
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Hybrid evolutionary algorithms
TSP
ARTIFICIAL INTELLIGENCE
Hybrid systems
Algorithms
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/21662
Acceder
id SEDICI_84bdfa5ced5d37205cb3b9503d96e171
oai_identifier_str oai:sedici.unlp.edu.ar:10915/21662
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Hybrid evolutionary algorithms for the TSPMinetti, Gabriela F.Hugo, AlfonsoGallard, Raúl HectorCiencias InformáticasHybrid evolutionary algorithmsTSPARTIFICIAL INTELLIGENCEHybrid systemsAlgorithmsEven 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.Eje: Inteligencia Computacional - MetaheurísticasRed de Universidades con Carreras en Informática (RedUNCI)2001-05info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/21662spainfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:27:32Zoai:sedici.unlp.edu.ar:10915/21662Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:27:33.195SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Hybrid evolutionary algorithms for the TSP
title Hybrid evolutionary algorithms for the TSP
spellingShingle Hybrid evolutionary algorithms for the TSP
Minetti, Gabriela F.
Ciencias Informáticas
Hybrid evolutionary algorithms
TSP
ARTIFICIAL INTELLIGENCE
Hybrid systems
Algorithms
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
dc.creator.none.fl_str_mv Minetti, Gabriela F.
Hugo, Alfonso
Gallard, Raúl Hector
author Minetti, Gabriela F.
author_facet Minetti, Gabriela F.
Hugo, Alfonso
Gallard, Raúl Hector
author_role author
author2 Hugo, Alfonso
Gallard, Raúl Hector
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Hybrid evolutionary algorithms
TSP
ARTIFICIAL INTELLIGENCE
Hybrid systems
Algorithms
topic Ciencias Informáticas
Hybrid evolutionary algorithms
TSP
ARTIFICIAL INTELLIGENCE
Hybrid systems
Algorithms
dc.description.none.fl_txt_mv 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.
Eje: Inteligencia Computacional - Metaheurísticas
Red de Universidades con Carreras en Informática (RedUNCI)
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.
publishDate 2001
dc.date.none.fl_str_mv 2001-05
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/21662
url http://sedici.unlp.edu.ar/handle/10915/21662
dc.language.none.fl_str_mv spa
language spa
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1842260113291739136
score 13.13397

Publicaciones similares