The Study of Constraint Conditions about Cultural Algorithm

Abstract. We present a concept that classifies the constraint condition group in the strong-constraint condition and the weak-constraint conditions. And all of the contradictions are belong to weak-constraint condition group. Then the contradiction can be eliminated by the weakening strategy. The proposed approach is satisfied to both the common constraint condition group and the contradiction constraint condition group, And this bring the extension of the appliance. Furthermore, as the contrary constraint conditions are also satisfied, the final optimal result that obtained by cultural algorithm will be more comprehensive. The performance of the proposed approach can be shown by five test functions, and examine results prove that this method is efficient and effective to contradiction constraint optimization.