B. Hu, G. Raidl:

"A memetic algorithm for the generalized minimum vertex-biconnected network problem";

Talk: Conference on Hybrid Intelligent Systems - HIS, Shenyang, China; 2009-08-12 - 2009-08-14; in: "9th International Conference on Hybrid Intelligent Systems - HIS 2009", (2009), 6 pages.

The generalized minimum vertex-biconnected network

problem plays an important role in the design of survivable

backbone networks that should be fault tolerant to single

component outage. When given a graph where the nodes are

partitioned into clusters, the goal is to find a subgraph of

minimum costs that connects exactly one node from each cluster

in a vertex-biconnected way. We present a memetic algorithm

that uses fast local improvement methods to produce high quality

solutions and an intelligent crossover operator which controls the

balance between diversity and intensity in the population. Tests

on Euclidean TSPlib instances with up to 442 nodes show that

this approach is highly efficient.

http://publik.tuwien.ac.at/files/PubDat_179082.pdf

Created from the Publication Database of the Vienna University of Technology.