Using Differential Evolution for a Subclass of Graph Theory Problems

@article{Greenwood2009UsingDE,
  title={Using Differential Evolution for a Subclass of Graph Theory Problems},
  author={Garrison W. Greenwood},
  journal={IEEE Transactions on Evolutionary Computation},
  year={2009},
  volume={13},
  pages={1190-1192}
}
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. 
Highly Cited
This paper has 21 citations. REVIEW CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
14 Extracted Citations
4 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 14 extracted citations

Referenced Papers

Publications referenced by this paper.

Similar Papers

Loading similar papers…