Memetic algorithm with simulated annealing strategy and tightness greedy optimization for community detection in networks
A Memetic algorithm (MA-SAT) is proposed for community detection in networks. Simulated annealing (SA) and tightness greedy optimization (TGO) are used. TGO is designed to improve diversity, increasing little computation cost. The balance between SA strategy and genetic algorithm is analyzed. The abundant results show that the MA-SAT is very efficient and competitive.
memetic algorithm simulated annealing tightness community detection network genetic algorithm