Title
A graph-based Lamarckian-Baldwinian hybrid for the sorting network problem
Abstract
A hybrid genetic algorithm (GA) is proposed for the optimal sorting network problem. Based on a graph-theoretical viewpoint, we devised a solution repair heuristic which incorporates a strong local optimization. We also propose a new encoding scheme which combines the characteristics of Lamarckian and Baldwinian GAs. Using a single-CPU PC, we obtained results comparable to previous results obtained with supercomputers.
Year
DOI
Venue
2005
10.1109/TEVC.2004.841682
IEEE Trans. Evolutionary Computation
Keywords
Field
DocType
single-cpu pc,strong local optimization,previous result,hybrid genetic algorithm,solution repair heuristic,baldwinian gas,optimal sorting network problem,graph-based lamarckian-baldwinian hybrid,lamarckian baldwinian hybrid encoding,sorting,new encoding scheme,genetic algorithms,graph theory,network problem,graph-theoretical viewpoint,sorting network
Graph theory,Sorting network,Heuristic,Supercomputer,Computer science,Algorithm,Sorting,Artificial intelligence,Local search (optimization),Genetic algorithm,Machine learning,Encoding (memory)
Journal
Volume
Issue
ISSN
9
1
1089-778X
Citations 
PageRank 
References 
10
0.82
5
Authors
2
Name
Order
Citations
PageRank
Sung-Soon Choi111211.03
Byung-Ro Moon284458.71