Novel Binary Differential Evolution Algorithm for Discrete Optimization

New binary differential evolution algorithm was proposed for the combinatorial optimization problem. With the same framework of the original differential evolution algorithm, three new operators were used to expand the continuous field of the original differential evolution to the discrete field. Firstly, a new operator, mapping operator, in the new algorithm was used to ensure the original mutation operator still effective. Then a new S operator, with sigmoid function, was used to keep the result of the mutation operator falls in the interval. Before the crossover operator, an inverse mapping operator transformed the continuous numbers to discrete. Two initial simulation results show it is effective and useful.