A C++ Implementation of of Tabu Search for k-cardinality tree problem based on generic programming and component reuse
We present a C++ implementation of Tabu Search method for the Minimum k-Cardinality Tree problem. Tabu Search is a well known heuristic for sub-optimally solving optimization problems. This method applies also to Minimum k-Cardinality Tree --an important problem to both theory and industrial applica...
| Autores: | , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2000 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/96454 |
| Acceso en línea: | https://hdl.handle.net/2117/96454 |
| Access Level: | acceso abierto |
| Palabra clave: | K-cardinality tree problem C++ Tabu Search Generic programming Optimization Reusing components Àrees temàtiques de la UPC::Informàtica |
| Sumario: | We present a C++ implementation of Tabu Search method for the Minimum k-Cardinality Tree problem. Tabu Search is a well known heuristic for sub-optimally solving optimization problems. This method applies also to Minimum k-Cardinality Tree --an important problem to both theory and industrial applications. Our implementation is based on generic programming and re-usability of several components for Tabu Search method. We have compared our program with other ad hoc implementations for the problem and have observed a good performance of our implementation. Moreover, our implementation represents time savings, flexibility and robustness mainly due to the component reuse. |
|---|