Observatorio de I+D+i UPM

Memorias de investigación
Communications at congresses:
Metaheuristic approaches for MWT and MWPT problems
Year:2011
Research Areas
  • Information technology and adata processing
Information
Abstract
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).
International
Si
Congress
XIV Spanish Meeting on Computational Geometry
960
Place
Alcalá de Henares, Madrid
Reviewers
Si
ISBN/ISSN
2014-2323
Start Date
27/06/2011
End Date
30/06/2011
From page
79
To page
82
Proc. of XIV Spanish Meeting on Computational Geometry
Participants
  • 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)
Research Group, Departaments and Institutes related
  • Creador: Departamento: Matemática Aplicada (Facultad de Informática)
S2i 2020 Observatorio de investigación @ UPM con la colaboración del Consejo Social UPM
Cofinanciación del MINECO en el marco del Programa INNCIDE 2011 (OTR-2011-0236)
Cofinanciación del MINECO en el marco del Programa INNPACTO (IPT-020000-2010-22)