Using Differential Evolution for a Subclass of Graph Theory Problems
Greenwood, G.W.
Dept. of Electr. & Comput. Eng., Portland State Univ., Portland, OR, USA;
This paper appears in: Evolutionary Computation, IEEE Transactions on
Publication Date: Oct. 2009
Volume: 13,
Issue: 5
On page(s): 1190-1192
ISSN: 1089-778X
INSPEC Accession Number: 10879804
Digital Object Identifier: 10.1109/TEVC.2009.2026000
First Published: 2009-09-09
Current Version Published: 2009-09-22
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
