A multiobjective box-covering algorithm for fractal modularity on complex networks

Hongrun Wu, Li Kuang, Feng Wang, Qi Rao, Maoguo Gong, Yuanxiang Li

Abstract: Highlights•Fractal modularity has been considered as an optimization objective for box-covering problem on complex networks and a multiobjective optimization function is formulized.•A multiobjective discrete PSO algorithm for box-covering problem is proposed.•A discrete particle status updating rule is designed according to the knowledge from former generations, and a mutation operator is proposed to promote the diversity and help the algorithm escape from local optima.•The experimental studies compared with 12 state-of-the-art algorithms demonstrate that the proposed algorithm is effective and promising.