Using Differential Evolution for a Subclass of Graph Theory Problems
G.W. Greenwood · IEEE Transactions on Evolutionary Computation · 2009
Conventional differential evolution algorithms explore continuous spaces. In contrast, NP-complete graph problems are combinatorial and thus have discrete solution spaces, many with solutions encoded as binary strings. This letter describes a simple method showing how a conventional differential evolution algorithm can be used to solve these types of graph theory problems. The method is deterministic and can handle graphs of arbitrary size.