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.
No takes yet. Share an insight, caveat, or question.
Choi et al. (2005) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: