|
Descripción
|
|
|---|---|
| It is known that the MinimumWeight Triangulation problem is NP-hard. Also the complexity of MinimumWeight Pseudo-Triangulation problem is unknown, suspecting that it is also a NP-hard problem. Therefore we focused on the evelopment of approximate algorithms to find high quality triangulations and pseudo-triangulations of minimum weight. In this work we propose the use of 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 the 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
|
XVII Congreso Argentino de Ciencias de la Computación 2011 (CACIC 2011) |
|
Tipo de participación
|
960 |
|
Lugar del congreso
|
La Plata, Argentina |
|
Revisores
|
Si |
|
ISBN o ISSN
|
978-950-34-0756-1 |
|
DOI
|
|
|
Fecha inicio congreso
|
10/10/2011 |
|
Fecha fin congreso
|
14/10/2011 |
|
Desde la página
|
151 |
|
Hasta la página
|
160 |
|
Título de las actas
|
Actas de XVII Congreso Argentino de Ciencias de la Computación 2011 |