The Research On Cultural Algorithm For Solving Constraint Problem With Weak-constraints

There are many constraint optimization problems in the fields of society, economy, international cooperation and industry so on. Researcher has done lots of work on constraint optimization problem. But no one pay attention on constraint optimization with weak-constraint. There are some special constraints called weak-constraint in this constraint optimization problem. Weak-constraint means the constraint should be satisfied only if it is possible and the result depends on that weak-constraint are feasible.The cultural algorithm is an evolutionary computation technique based on swarm intelligence optimization algorithm, which was developed by Reynolds in 1994 and inspired by the development of culture.The main researches are as follow:1) We analysis the characteristic of the weak-constraint optimization problem, and defined the weak-constraints. The center of those problems is to find the suitable constraints group quickly.2) The method of pruning the infeasible weak-constraints group to solve weak-constraint optimization problems is first proposed. Such exploitation of branching-cutting technique can make the weak-constraints optimization problems satisfy more weak-constraints and produce feasible results at a relatively low computational cost.Finally, the development and research trend of Cultural Algorithm which is deal with the constraint optimization problem with weak-constraint is pointed out.