Fuzzy c-means (FCM) algorithm is dynamic cluster algorithm whose result often is local optimal decision. There often exists insignificant clustering in the result of Fuzzy c-means algorithm when traditional union, Intersection and inclusion work in fuzzy set. Our research indicates there are no insignificant clustering in the result of Fuzzy c-means algorithm over genetic algorithm and partial optimal solution can be avoided with this algorithm to a certain extent. The coding, select, corresponding crossover and mutation operators are designed. Finally we compared the performance of GFCM and FCM with testing data. Results show that the performance of GFCM is far better than FCM.