DC FieldValueLanguage
dc.contributor.authorĐurić, Brankicaen
dc.contributor.authorKratica, Jozefen
dc.contributor.authorTošić, Dušanen
dc.contributor.authorFilipović, Vladimiren
dc.date.accessioned2020-04-26T19:14:55Z-
dc.date.available2020-04-26T19:14:55Z-
dc.date.issued2008-07-21en
dc.identifier.issn1335-9150en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/501-
dc.description.abstractThis 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 2000 edges.en
dc.publisherSlovak Academy of Sciences-
dc.relationSerbian Ministry of Science and Ecology, project 144007-
dc.relation.ispartofComputing and Informaticsen
dc.subjectBalanced partitions | Combinatorial optimization | Evolutionary computation | Metaheuristicsen
dc.titleSolving the maximally balanced connected partition problem in graphs by using genetic algorithmen
dc.typeArticleen
dc.identifier.scopus2-s2.0-47249137773en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage341en
dc.relation.lastpage354en
dc.relation.issue3en
dc.relation.volume27en
dc.description.rankM23-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
crisitem.author.orcid0000-0002-9752-0971-
Show simple item record

SCOPUSTM   
Citations

18
checked on Jun 12, 2024

Page view(s)

53
checked on May 9, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.