A problem knowledge-based evolutionary algorithm KBOA for hypergraph bisectioning

• http://www.fit.vutbr.cz/~schwarz/PDFCLANKY/jckbse.ps

problem knowledge, Bayesian evolutionary algorithm, hypergraph partitioning

This paper is an experimental study on an utilization of additional knowledge about the decomposition problem to be solved. We have demonstrated this approach on the hypergraph bisectioning that can serve as a model of system decomposition in common, data base decomposition etc. We have focused on the extension of the Bayesian Optimization Algorithm BOA. The extension of the original BOA algorithm is based on the usage of a prior information about the hypergraph structure. This knowledge is used for both setting initial Bayesian network and the initial population using injection of clusters to improve the convergence of the decomposition process. The behaviour of our version KBOA is tested on the set of benchmarks, such as grid and random geometric graphs as well as real hypergraphs.

This paper is an experimental study on an utilization of additional knowledge about the decomposition problem to be solved. We have demonstrated this approach on the hypergraph bisectioning that can serve as a model of system decomposition in common, data base decomposition etc. We have focused on the extension of the Bayesian Optimization Algorithm BOA. The extension of the original BOA algorithm is based on the usage of a prior information about the hypergraph structure. This knowledge is used for both setting initial Bayesian network and the initial population using injection of clusters to improve the convergence of the decomposition process. The behaviour of our version KBOA is tested on the set of benchmarks, such as grid and random geometric graphs as well as real hypergraphs.