Published May 19, 2017 | Version v1
Publication Metadata-only

Simulated annealing applied to the MWPT problem

Creators

Contributors

Description

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.

Abstract

Proyecto Tecnologías Avanzadas de Bases de Datos (Universidad Nacional de San Luis, Argentina)

Abstract

Laboratorio de Investigación y Desarrollo en Inteligencia Computacional (Universidad Nacional de San Luis, Argentina)

Abstract

European Science Foundation

Abstract

Ministerio de Ciencia e Innovación

Additional details

Identifiers

URL
https://idus.us.es/handle/11441/60128
URN
urn:oai:idus.us.es:11441/60128

Origin repository

Origin repository
USE