To access the full text documents, please follow this link: http://hdl.handle.net/2117/87262

An implementation of a generic memetic algorithm for the edge biconnectivity augmentation problem
Xhafa Xhafa, Fatos
Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
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.
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
Memetic algorithm
Bi-connectivity augmentation problem
info:eu-repo/semantics/publishedVersion
Report
         

Show full item record

Related documents

Other documents of the same author

Spaho, Evjola; Sakamoto, Shinji; Barolli, Leonard; Xhafa Xhafa, Fatos; Ikeda, Makoto
Sakamoto, Shinji; Oda, Tetsuya; Bravo, Albert; Barolli, Leonard; Ikeda, Makoto; Xhafa Xhafa, Fatos
Spaho, Evjola; Barolli, Leonard; Xhafa Xhafa, Fatos; Biberaj, A.; Shurdi, O.
Xhafa Xhafa, Fatos; Herrero, Xavier; Barolli, Admir; Barolli, Leonard; Takizawa, Makoto
 

Coordination

 

Supporters