Approximations on minimum weight pseudo-triangulations using ant colony optimization metaheuristic

Autores
Gagliardi, Edilma Olinda; Dorzán, María Gisela; Leguizamón, Mario Guillermo; Hernández Peñalver, Gregorio
Año de publicación
2009
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
Globally optimal pseudo-triangulations are di cult to be found by deterministic methods as, for most type of criteria, no polynomial algorithm is known. In this work, we consider the Minimum Weight Pseudo-Triangulation (MWPT) problem of a given set of n points in the plane. This paper shows how the Ant Colony Optimization (ACO) metaheuristic can be used to nd optimal pseudo-triangulations of minimum weight. For the experimental study presented here we have created a set of instances for MWPT since no reference to benchmarks for these problems were found in the literature. We assess through the experimental evaluation the applicability of the ACO metaheuristic for MWPT.
Presentado en el X Workshop Agentes y Sistemas Inteligentes
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Heuristic methods
pseudo-triangulation
minimum weight
computational geometry
ACO
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/20893
Acceder
id SEDICI_d63daf9f419c4a4e1aad02e53e3abfa0
oai_identifier_str oai:sedici.unlp.edu.ar:10915/20893
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Approximations on minimum weight pseudo-triangulations using ant colony optimization metaheuristicGagliardi, Edilma OlindaDorzán, María GiselaLeguizamón, Mario GuillermoHernández Peñalver, GregorioCiencias InformáticasHeuristic methodspseudo-triangulationminimum weightcomputational geometryACOGlobally optimal pseudo-triangulations are di cult to be found by deterministic methods as, for most type of criteria, no polynomial algorithm is known. In this work, we consider the Minimum Weight Pseudo-Triangulation (MWPT) problem of a given set of n points in the plane. This paper shows how the Ant Colony Optimization (ACO) metaheuristic can be used to nd optimal pseudo-triangulations of minimum weight. For the experimental study presented here we have created a set of instances for MWPT since no reference to benchmarks for these problems were found in the literature. We assess through the experimental evaluation the applicability of the ACO metaheuristic for MWPT.Presentado en el X Workshop Agentes y Sistemas InteligentesRed de Universidades con Carreras en Informática (RedUNCI)2009-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf149-158http://sedici.unlp.edu.ar/handle/10915/20893enginfo: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-29T10:54:26Zoai:sedici.unlp.edu.ar:10915/20893Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 10:54:26.807SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Approximations on minimum weight pseudo-triangulations using ant colony optimization metaheuristic
title Approximations on minimum weight pseudo-triangulations using ant colony optimization metaheuristic
spellingShingle Approximations on minimum weight pseudo-triangulations using ant colony optimization metaheuristic
Gagliardi, Edilma Olinda
Ciencias Informáticas
Heuristic methods
pseudo-triangulation
minimum weight
computational geometry
ACO
title_short Approximations on minimum weight pseudo-triangulations using ant colony optimization metaheuristic
title_full Approximations on minimum weight pseudo-triangulations using ant colony optimization metaheuristic
title_fullStr Approximations on minimum weight pseudo-triangulations using ant colony optimization metaheuristic
title_full_unstemmed Approximations on minimum weight pseudo-triangulations using ant colony optimization metaheuristic
title_sort Approximations on minimum weight pseudo-triangulations using ant colony optimization metaheuristic
dc.creator.none.fl_str_mv Gagliardi, Edilma Olinda
Dorzán, María Gisela
Leguizamón, Mario Guillermo
Hernández Peñalver, Gregorio
author Gagliardi, Edilma Olinda
author_facet Gagliardi, Edilma Olinda
Dorzán, María Gisela
Leguizamón, Mario Guillermo
Hernández Peñalver, Gregorio
author_role author
author2 Dorzán, María Gisela
Leguizamón, Mario Guillermo
Hernández Peñalver, Gregorio
author2_role author
author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Heuristic methods
pseudo-triangulation
minimum weight
computational geometry
ACO
topic Ciencias Informáticas
Heuristic methods
pseudo-triangulation
minimum weight
computational geometry
ACO
dc.description.none.fl_txt_mv Globally optimal pseudo-triangulations are di cult to be found by deterministic methods as, for most type of criteria, no polynomial algorithm is known. In this work, we consider the Minimum Weight Pseudo-Triangulation (MWPT) problem of a given set of n points in the plane. This paper shows how the Ant Colony Optimization (ACO) metaheuristic can be used to nd optimal pseudo-triangulations of minimum weight. For the experimental study presented here we have created a set of instances for MWPT since no reference to benchmarks for these problems were found in the literature. We assess through the experimental evaluation the applicability of the ACO metaheuristic for MWPT.
Presentado en el X Workshop Agentes y Sistemas Inteligentes
Red de Universidades con Carreras en Informática (RedUNCI)
description Globally optimal pseudo-triangulations are di cult to be found by deterministic methods as, for most type of criteria, no polynomial algorithm is known. In this work, we consider the Minimum Weight Pseudo-Triangulation (MWPT) problem of a given set of n points in the plane. This paper shows how the Ant Colony Optimization (ACO) metaheuristic can be used to nd optimal pseudo-triangulations of minimum weight. For the experimental study presented here we have created a set of instances for MWPT since no reference to benchmarks for these problems were found in the literature. We assess through the experimental evaluation the applicability of the ACO metaheuristic for MWPT.
publishDate 2009
dc.date.none.fl_str_mv 2009-10
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/20893
url http://sedici.unlp.edu.ar/handle/10915/20893
dc.language.none.fl_str_mv eng
language eng
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
149-158
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_ 1844615801413304320
score 13.069144

Publicaciones similares