Title :
A metaevolutionary approach for the traveling salesman problem
Author :
M. Crepinsek;M. Mernik;V. Zumer
Author_Institution :
Fac. of Electr. Eng. & Comput. Sci., Maribor, Slovenia
Abstract :
The metaevolutionary approach used in searching for the best combination of crossover operators for the traveling salesman problem is described. Since different crossover operators preserve different useful properties, the combination of operators may out-perform a single operator. Rather than randomly search for the best combination of crossover operators, the metaevolutionary approach is used. Preliminary results confirm this hypothesis.
Keywords :
"Traveling salesman problems","Genetic algorithms","Evolutionary computation","Genetic mutations","Approximation algorithms","Computer science","Space exploration","NP-hard problem","Computational modeling","Simulated annealing"
Conference_Titel :
Information Technology Interfaces, 2000. ITI 2000. Proceedings of the 22nd International Conference on
Print_ISBN :
953-96769-1-6
