Differential Evolution Algorithm for Solving Dynamic Constrained Programming Problems

Liu Chun-an · Journal of Kunming University of Science and Technology · 2010

The difficult to solve dynamic constrainted programming problems is how to do with the constraint and the time(invironment) variance.In this paper,a new differentinal evolution algorithm for solving a class of constrained programming problem defined in natural numbers set is proposed.First,a new fitness fuction and selection operator based on the constraint conditions of dynamic constrainted programming problem is given.Futhermore,a new mutation operator with one-dimensional inexact local search is designed.Based on these,the diversity of population is improved and enabling the algorithm to jump over any local minimum trap.The simulations show that the algorithm is reliable,fast and robust in global optimization,and the proposed algorithm is effective for solving the dynamic constrainted programming problems.

Read the paper · More papers on PaperTik