• DocumentCode
    1365620
  • Title

    Using Differential Evolution for a Subclass of Graph Theory Problems

  • Author

    Greenwood, Garrison W.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Portland State Univ., Portland, OR, USA
  • Volume
    13
  • Issue
    5
  • fYear
    2009
  • Firstpage
    1190
  • Lastpage
    1192
  • Abstract
    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.
  • Keywords
    combinatorial mathematics; graph theory; optimisation; NP-complete graph problem; binary string; conventional differential evolution algorithm; discrete solution space; graph theory; Differential evolution; NP-complete; graph theory;
  • fLanguage
    English
  • Journal_Title
    Evolutionary Computation, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1089-778X
  • Type

    jour

  • DOI
    10.1109/TEVC.2009.2026000
  • Filename
    5233862
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1365620