A method for task network partition with limited community number

Abstract

In order to solve the problem that the number of communities in the current task network partition method cannot be determined, this paper proposes the concept and measurement method of task support degree, and takes the community to have a large internal relevance and a small external-community relevance as the optimization objective of task network partition. Based on the NSGA-II method, the concept of task partition granularity is introduced, and a task network partition method based on NSGA-II with limited community number is proposed. Finally, simulation experiments verify the feasibility of the algorithm and its advantages in terms of time consumption compared with traditional methods.