A graph-based Lamarckian-Baldwinian hybrid for the sorting network problem

Authors:
Sung-Soon Choi;Byung-Ro Moon
Affiliations:
Sch. of Comput. Sci. & Eng., Seoul Nat. Univ., South Korea;-
Venue:
IEEE Transactions on Evolutionary Computation
Year:
2005

Citing 0
Cited 3

Evolutionary design of oriented-tree networks using Cayley-type encodings

Information Sciences: an International Journal
Fault tolerance in distributed genetic algorithms with tree topologies

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Efficient filters for the simulated evolution of small sorting networks

Proceedings of the 14th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

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.