Ponencia
Simulated annealing applied to the MWPT problem
Autor/es | Gagliardi, Edilma Olinda
Leguizamón, Mario Guillermo Hernández Peñalver, Gregorio |
Coordinador/Director | Díaz Báñez, José Miguel
Garijo Royo, Delia Márquez Pérez, Alberto Urrutia Galicia, Jorge |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada II |
Fecha de publicación | 2013 |
Fecha de depósito | 2017-05-19 |
Publicado en |
|
Resumen | The Minimum Weight Pseudo-Triangulation (MWPT) problem is suspected to be NP-hard. We show here how Simulated Annealing (SA) can be applied for obtaining approximate solutions to the optimal ones. To do that, we applied ... The Minimum Weight Pseudo-Triangulation (MWPT) problem is suspected to be NP-hard. We show here how Simulated Annealing (SA) can be applied for obtaining approximate solutions to the optimal ones. To do that, we applied two SA algorithms, the basic version and our extended hybrid version of SA. Through the experimental evaluation and statistical study we assess the applicability and performance of the SA algorithms. The obtained results show the benefits of using the hybrid version of SA to achieve improved and higher quality solutions for the MWPT problem. |
Identificador del proyecto | 22/F014
ComPoSe IP04 EUI-EURC-2011-4306 |
Cita | Gagliardi, E.O., Leguizamón, M.G. y Hernández Peñalver, G. (2013). Simulated annealing applied to the MWPT problem. En XV Spanish Meeting on Computational Geometry, Sevilla. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Simulated annealing applied to ... | 1.132Mb | [PDF] | Ver/ | |