Set partitioning problem is the typical NP problem in combinatorial
optimization. The article establishes a set partitioning problem model, and solves it by
using differential evolution algorithm. By computing simulation cases in the literature
and comparing the result, it indicates that the algorithm for solving set partitioning
problem is feasible and effective.