A genetic algorithm for the multi-source and multi-sink minimum vertex cut problem and its applications

Authors:
M. Tang;C. J. Fidge
Affiliations:
Faculty of Science and Technology, Queensland University of Technology, Brisbane, Australia;Faculty of Science and Technology, Queensland University of Technology, Brisbane, Australia
Venue:
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Year:
2009

Citing 5
Cited 0

Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence

Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence
Fault Evaluation for Security-Critical Communications Devices

Computer
Information Flow Analysis for Fail-Secure Devices

The Computer Journal
Product flow analysis in distribution networks with a fixed time horizon

ACSC '08 Proceedings of the thirty-first Australasian conference on Computer science - Volume 74
SIFA: a tool for evaluation of high-grade security devices

ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new penalty-based genetic algorithm for the multi-source and multi-sink minimum vertex cut problem, and illustrate the algorithm's usefulness with two real-world applications. It is proved in this paper that the genetic algorithm always produces a feasible solution by exploiting some domain-specific knowledge. The genetic algorithm has been implemented on the example applications and evaluated to show how well it scales as the problem size increases.