Abstract
Differential Evolution (DE) algorithm has been shown to be powerful for many real optimization problems. In traditional DE and its variant algorithms, there are three or more candidates used in the step of mutation, which is one of the three typical operation steps: mutation, crossover and selection. To simplify the mutation, we propose a novel evolution algorithm which needs only two individuals in mutation, and is based on a ordering of the individuals. It is the Binary-Differential Evolution algorithm based on Ordering of individuals (OBDE), which shows two-candidate-mutation can accomplish function optimization as well. Experimental results show that OBDE has advantages such as faster computing speed and better precision, compared with traditional DE algorithm.
| Original language | English |
|---|---|
| Title of host publication | 2010 Sixth International Conference on Natural Computation |
| Publisher | The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Pages | 2207-2211 |
| Number of pages | 5 |
| Volume | 5 |
| ISBN (Electronic) | 9781424459612 |
| ISBN (Print) | 9781424459612 |
| DOIs | |
| Publication status | Published - 2010 |
| Externally published | Yes |
| Event | 2010 6th International Conference on Natural Computation, ICNC'10 - Yantai, Shandong, China Duration: 10 Aug 2010 → 12 Aug 2010 |
Conference
| Conference | 2010 6th International Conference on Natural Computation, ICNC'10 |
|---|---|
| Country/Territory | China |
| City | Yantai, Shandong |
| Period | 10/08/10 → 12/08/10 |
Keywords
- Binary differential evolution
- Differential evolution
- Ordering