Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

HIS

2009

2009

Abstract--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.

Related Content

Added |
18 Feb 2011 |

Updated |
18 Feb 2011 |

Type |
Journal |

Year |
2009 |

Where |
HIS |

Authors |
Bin Hu, Günther R. Raidl |

Comments (0)