Combinatorial optimization with differential evolution
André L. Maravilha, Jaime Arturo Ramírez, Felipe Campelo · 2014
This work presents a differential evolution algorithm for combinatorial optimization, in which a set-based representation and operators define subproblems that are used to explore the search space. The proposed method is tested on the capacitated centered clustering problem.