|
|||||||||||||||||||||||||
|
|||||||||||||||||||||||||
ABSTRACT
Self-adaptive crossover is a step towards exploiting the structure of problems automatically by evolution. We present a self-adaptive extension of the partially mapped crossover (PMX) operator that controls the crossover points. Because the link between strategy parameters and fitness is weak for self-adaptive crossover, superior results were hard to gather in the past. We can now report encouraging experimental results for the PMX on the traveling salesman problem (TSP) as an example for combinatorial problems. REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
INDEX TERMS
Primary Classification:
Keywords:
|
|||||||||||||||||||||||||