An analysis of a reordering operator with tournament selection on a GA-hard problem

Authors:
Ying-ping Chen;David E. Goldberg
Affiliations:
Department of Computer Science and Department of General Engineering, University of Illinois, Urbana, IL;Department of General Engineering, University of Illinois, Urbana, IL
Venue:
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Year:
2003

Citing 11
Cited 0

A study of permutation crossover operators on the traveling salesman problem

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
The “molecular” traveling salesman

Biological Cybernetics
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation

Machine Learning - Special issue on genetic algorithms
The minimal deceptive problem revisited: the role of “genetic waste”

Computers and Operations Research
AllelesLociand the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator

Proceedings of the 3rd International Conference on Genetic Algorithms
The behavior of adaptive systems which employ genetic and correlation algorithms

The behavior of adaptive systems which employ genetic and correlation algorithms
Nonlinearities in genetic adaptive search.

Nonlinearities in genetic adaptive search.
A learning system based on genetic adaptive algorithms

A learning system based on genetic adaptive algorithms
Applying adaptive algorithms to epistatic domains

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper analyzes the performance of a genetic algorithm that utilizes tournament selection, one-point crossover, and a reordering operator. A model is proposed to describe the combined effect of the reordering operator and tournament selection, and the numerical solutions are presented as well. Pairwise, s-ary, and probabilistic tournament selection are all included in the proposed model. It is also demonstrated that the upper bound of the probability to apply the reordering operator, previously derived with proportionate selection, does not affect the performance. Therefore, tournament selection is a necessity when using a reordering operator in a genetic algorithm to handle the conditions studied in the present work.