Approximations on minimum weight pseudo-triangulation problem using ant colony optimization

Autor:	Hernández Peñalver, Gregorio, Gagliardi, Edilma Olinda, Dorzán, M. Gisela, Leguizamón, Guillermo
Rok vydání:	2011
Předmět:	Informática TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY Computer Science::Neural and Evolutionary Computation MathematicsofComputing_NUMERICALANALYSIS ComputingMethodologies_ARTIFICIALINTELLIGENCE
Zdroj:	Computer Science Society (SCCC), 2011 30th International Conference of the Chilean | 30th International Conference of the Chilean | 9-11 Nov. 2011 | Curico, Chile Archivo Digital UPM instname
Popis:	In this work, we consider the Minimum Weight Pseudo-Triangulation (MWPT) problem of a given set of n points in the plane. Globally optimal pseudo-triangulations with respect to the weight, as optimization criteria, are difficult to be found by deterministic methods, since no polynomial algorithm is known. We show how the Ant Colony Optimization (ACO) metaheuristic can be used to find high quality pseudo-triangulations of minimum weight. We present the experimental and statistical study based on our own set of instances since no reference to benchmarks for these problems were found in the literature. Throughout the experimental evaluation, we appraise the ACO metaheuristic performance for MWPT problem.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::70e6ea55ab8238e45dc3a2bcb7449874 https://oa.upm.es/19305/ Zobrazit plný text záznamu