Title
An Edge-Set Representation Based on a Spanning Tree for Searching Cut Space
Abstract
The encoding or representation scheme in evolutionary algorithms is very important because it can greatly affect their performance. Most previous evolutionary algorithms for solving graph problems have traditionally used a vertex-based encoding in which each gene corresponds to a vertex. In this paper, addressing the well-known maximum cut problem, we introduce an edge-set encoding based on the sp...
Year
DOI
Venue
2015
10.1109/TEVC.2014.2338076
IEEE Transactions on Evolutionary Computation
Keywords
Field
DocType
Encoding,Genetic algorithms,Vectors,Educational institutions,Approximation algorithms,Biological cells,Evolutionary computation
Approximation algorithm,Mathematical optimization,Vertex (geometry),Evolutionary algorithm,Evolutionary computation,Move-to-front transform,Spanning tree,Mathematics,Maximum cut,Encoding (memory)
Journal
Volume
Issue
ISSN
19
4
1089-778X
Citations 
PageRank 
References 
4
0.46
32
Authors
3
Name
Order
Citations
PageRank
Kisung Seo114118.95
Soohwan Hyun2244.18
Yong-Hyuk Kim335540.27