Memorias de investigación
Ponencias en congresos:
Metaheuristic approaches for MWT and MWPT problems
Año:2011
Áreas de investigación
  • Ciencias de la computación y tecnología informática
Datos
Descripción
It is known that the Minimum Weight Triangulation problem is NP-hard. Also the complexity of the Minimum Weight Pseudo-Triangulation problem is unknown, yet it is suspected to be also NP-hard. Therefore we focused on the development of approximate algorithms to find high quality triangulations and pseudo-triangulations of minimum weight. In this work we propose two metaheuristics to solve these problems: Ant Colony Optimization (ACO) and Simulated Annealing (SA). For the experimental study we have created a set of instances for MWT and MWPT problems, since no reference to benchmarks for these problems were found in the literature. Through experimental evaluation, we assess the applicability of the ACO and SA metaheuristics for MWT and MWPT problems. These results are compared with those obtained from the application of deterministic algorithms for the same problems (Delaunay Triangulation for MWT and a Greedy algorithm respectively for MWT and MWPT).
Internacional
Si
Nombre congreso
XIV Spanish Meeting on Computational Geometry
Tipo de participación
960
Lugar del congreso
Alcalá de Henares, Madrid
Revisores
Si
ISBN o ISSN
2014-2323
DOI
Fecha inicio congreso
27/06/2011
Fecha fin congreso
30/06/2011
Desde la página
79
Hasta la página
82
Título de las actas
Proc. of XIV Spanish Meeting on Computational Geometry
Esta actividad pertenece a memorias de investigación
Participantes
  • Autor: Gregorio Hernandez Peñalver UPM
  • Autor: M. Gisela Dorzán Universidad Nacional de San Luis
  • Autor: Edilma Olinda Gagliardi Universidad Nacional de San Luis
  • Autor: Guillermo Leguizamón Universidad Nacional de San Luis
Grupos de investigación, Departamentos, Centros e Institutos de I+D+i relacionados
  • Creador: Departamento: Matemática Aplicada (Facultad de Informática)