A graph-based approach to the sorting network problem

We consider the problem space of a sorting network as a graph. Based on this viewpoint, we devised local optimization heuristics for sorting networks and combined them with a genetic algorithm framework. Using a single-CPU PC, we obtained results comparable with previous results obtained using supercomputers.