Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/87262
Título:
|
An implementation of a generic memetic algorithm for the edge biconnectivity augmentation problem
|
Autor/a:
|
Xhafa Xhafa, Fatos
|
Otros autores:
|
Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics |
Abstract:
|
In this paper we present an implementation of a generic memetic algorithm for the edge bi-connectivity augmentation problem --the problem of augmenting a given graph by a cheapest possible set of additional edges in order to make the graph edge bi-connected. This problem is known for its applications to communication network design --the extension of an existing communication network to become robust against single link failures-- as well as in VLSI floor planning. We provide a C++ implementation of a generic memetic algorithm for the problem, as a good alternative for approximately solving it. We use known benchmarks in the literature for the problem as to experimentally evaluate how good the generic memetic algorithm works for the problem. |
Materia(s):
|
-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica -Memetic algorithm -Bi-connectivity augmentation problem |
Derechos:
|
|
Tipo de documento:
|
Artículo - Versión publicada Informe |
Compartir:
|
|
Mostrar el registro completo del ítem