首页 | 本学科首页   官方微博 | 高级检索  
     


A parallel hybrid metaheuristic for bicluster editing
Authors:Gilberto F de Sousa Filho  Teobaldo L Bulhões Júnior  Lucídio dos Anjos F Cabral  Luiz Satoru Ochi  Fábio Protti
Affiliation:1. Centro de Informática, Universidade Federal da Paraíba (UFPB), Jo?o Pessoa, PB, Brazil;2. Instituto de Computa??o, Universidade Federal Fluminense (UFF), Niterói, RJ, Brazil
Abstract:The bicluster editing problem (BEP) consists of editing (adding or removing) the edges of a bipartite graph G in order to transform it into a vertex‐disjoint union of complete bipartite subgraphs, in such a way that the sum of the weights of the edited edges is minimum. In this paper, we propose five parallel strategies for the implementation of a hybrid metaheuristic for the BEP, consisting of a GRASP with VNS as local search. Computational experiments show near‐linear speedups on Linux cluster with 64 processors and better solutions than those of the sequential approach.
Keywords:bicluster editing problem  metaheuristics  GRASP  parallelization  parallel GRASP
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号