More Effective Genetic Search For The Sorting Network Problem

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.

[1]  W. Daniel Hillis,et al.  Co-evolving parasites improve simulated evolution as an optimization procedure , 1990 .

[2]  Sung-Soon Choi,et al.  A graph-based approach to the sorting network problem , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[3]  Sung-Soon Choi,et al.  A hybrid genetic search for the sorting network problem with evolving parallel layers , 2001 .

[4]  L. Darrell Whitley,et al.  Lamarckian Evolution, The Baldwin Effect and Function Optimization , 1994, PPSN.

[5]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[6]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[7]  Geoffrey E. Hinton,et al.  How Learning Can Guide Evolution , 1996, Complex Syst..

[8]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[9]  Ioannis Pitas,et al.  A new filter structure for the implementation of certain classes of image processing operations , 1988 .

[10]  M. A. Keane,et al.  Evolving sorting networks using genetic programming and the rapidly reconfigurable Xilinx 6216 field-programmable gate array , 1997, Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136).

[11]  Rolf Unbehauen,et al.  On the analysis of sorting networks from the viewpoint of circuit theory , 1998 .

[12]  G. Simpson.  THE BALDWIN EFFECT , 1953 .

[13]  D. J. Cavicchio,et al.  Adaptive search using simulated evolution , 1970 .

[14]  R. C. Bose,et al.  A Sorting Problem , 1962, JACM.

[15]  Darrell Whitley,et al.  Genitor: a different genetic algorithm , 1988 .

[16]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[17]  Hugues Juillé.  Evolution of Non-Deterministic Incremental Algorithms as a New Approach for Search in State Spaces , 1995, ICGA.

[18]  Richard K. Belew,et al.  Evolving Aesthetic Sorting Networks Using Developmental Grammars , 1993, ICGA.

[19]  Byung Ro Moon,et al.  Genetic Algorithm and Graph Partitioning , 1996, IEEE Trans. Computers.