Statistical analysis of heuristics for evolving sorting networks

Authors:
Lee Graham;Hassan Masum;Franz Oppacher
Affiliations:
Carleton University, Ottawa, ON, Canada;Carleton University, Ottawa, ON, Canada;Carleton University, Ottawa, ON, Canada
Venue:
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Year:
2005

Citing 5
Cited 3

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Evolution of Non-Deterministic Incremental Algorithms as a New Approach for Search in State Spaces

Proceedings of the 6th International Conference on Genetic Algorithms
More Effective Genetic Search For The Sorting Network Problem

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Isomorphism, Normalization, And A Genetic Algorithm For Sorting Network Optimization

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Depth Optimal Sorting Networks Resistant to k Passive Faults

SIAM Journal on Computing

Analysis of a restricted test case set for a sorting network genetic algorithm

AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
Solving the sorting network problem using iterative optimization with evolved hypermutations

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Fault tolerance in distributed genetic algorithms with tree topologies

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960's. The application of evolutionary computing to this problem has yielded human-competitive results in recent years. We build on previous work by presenting a genetic algorithm whose parameters and heuristics are tuned on a small instance of the problem, and then scaled up to larger instances. Also presented are positive and negative results regarding the efficacy of several domain-specific heuristics.