More Effective Genetic Search For The Sorting Network Problem
Sung-Soon Choi, Byung Ro Moon · 2002
In [8], the authors proposed a hybrid genetic algorithm for the optimal sorting network problem. In this paper, we propose an approach to further improve this work. For this, we designed a novel data structure to efficiently process the dominating operation in solving the problem. We also developed an effective local search heuristic based on a fast approximate measure. Combining it with genetic operators, we obtained the most stable results so far.