Abstract
In order to solve sequence constrained optimization problems, a differential evolution algorithm with mapping (MDE) is presented. By mapping the sorting variables to random coefficient range [0,1], the constrained problems can be turned into unconstrained. In addition, differential evolution algorithm (DE) with self-adapting parameters is applied to accelerate the convergence rate. The results show the high efficiency of the method to solve such constrained problems.
Original language | English |
---|---|
Pages (from-to) | 154-158 |
Number of pages | 5 |
Journal | Zhongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Central South University (Science and Technology) |
Volume | 42 |
Issue number | SUPPL. 1 |
Publication status | Published - Sept 2011 |
Keywords
- DE algorithm
- Mapping
- Self-adapting parameter
- Sequence constrained problem