摘要：Online social networks provide large amount of valuable data and may serve as research platforms for various social network analysis tools. In this study, we propose a mathematical model for efficient exploration of an online social network. The goal is to spend minimal amount of time searching for characteristics which define a sub-network of users sharing the same interest or having certain common property. We further develop an efficient hybrid method (HEA), based on the combination of an Evolutionary Algorithm (EA) with Local Search procedure (LS). The proposed mathematical model and hybrid method are benchmarked on real-size data set with up to 10 000 users in a considered social network. We provide optimal solutions obtained by CPLEX solver on problem instances with up to 100 users, while larger instances that were out of reach of the CPLEX were efficiently solved by the proposed hybrid method. Presented computational results show that the HEA approach quickly reaches all optimal solutions obtained by CPLEX solver and gives solutions for the largest considered instance in very short CPU time.
关键词：Software Engineering;Hybrid optimization method, evolutionary algorithm, local search, social network, data flow;68T20, 90B10, 90B80, 68M10, 90C11
