Using Differential Evolution for a Subclass of Graph Theory Problems

Using Differential Evolution for a Subclass of Graph Theory Problems

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 evo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on evolutionary computation 2009-10, Vol.13 (5), p.1190-1192
1. Verfasser: Greenwood, G.W.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Amplitude modulation
Applied sciences
Artificial intelligence
Combinatorial analysis
Combinatorics
Combinatorics. Ordered structures
Computer science
control theory
systems
Constraint optimization
Differential evolution
Evolution
Exact sciences and technology
Graph theory
Graphs
Handles
Information retrieval. Graph
Mathematics
NP-complete
NP-complete problem
Random variables
Sciences and techniques of general use
Shape
Solution space
Space exploration
Strings
Theoretical computing
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1089-778X
1941-0026
DOI:10.1109/TEVC.2009.2026000