Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:ojs.cai.ui.sav.sk:article/253

Solving the Maximally Balanced Connected Partition Problem in Graphs by Using Genetic Algorithm

Authors
Publication date
27 January 2012
Publisher
Institute of Informatics, Slovak Academy of Sciences

Abstract

This paper exposes a research of the NP-hard Maximally Balanced Connected Partition problem (MBCP). The proposed solution comprises of a genetic algorithm (GA) that uses: binary representation, fine-grained tournament selection, one-point crossover, simple mutation with frozen genes and caching technique. In cases of unconnected partitions, penalty functions are successfully applied in order to obtain the feasible individuals. The effectiveness of presented approach is demonstrated on the grid graph instances and on random instances with up to 300 vertices and 2 000 edges

Similar works

Full text

thumbnail-image

Computing and Informatics (E-Journal - Institute of Informatics, SAS, Bratislava)

redirect
oaioai:ojs.cai.ui.sav.sk:article/...
Last time updated on 15/12/2019

This paper was published in Computing and Informatics (E-Journal - Institute of Informatics, SAS, Bratislava).

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.