A metaevolutionary approach for the traveling salesman problem

Proceedings of the International Conference on Information Technology Interfaces, ITI

Volumn , Issue , 2000, Pages 357-362

  Črepinšek, Matej ^a   Mernik, Marjan ^a   Žumer, Viljem ^a  

^a UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

Evolution algorithms; Genetic algorithms; Traveling salesman problem

Indexed keywords

EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; TRAVELING SALESMAN PROBLEM;

CROSSOVER OPERATOR; EVOLUTION ALGORITHMS; META-EVOLUTIONARY; USEFUL PROPERTIES;

INFORMATION TECHNOLOGY;

EID: 70349977998     PISSN: 13301012     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Back T., Fogel D.B., Michalewicz Z. (1996), Handbook of Evolutionary Computations University Oxford Press, New York.
2. Freisleben B., Hartfelder M. (1993), "In search of the best genetic algorithm for the traveling salesman problem". In Proceedings of 9'h International Coilference on Control Systems and Coinpiiter Science, Bucharest, pp. 485-93.
3. Freisleben B., Merz P. (1996), "New genetic local search operators for the traveling salesman problem". In Proceedings of Parallel Problem Solvingfroni Nature IV, pp S90-899.
4. Goldberg D.E., Eingle R. (1985), "Alleles, Loci, and the TSP". In Proceedings of the First International Conference on Genetic Algorithms, pp. 154-159.
5. Grefenstette J. J. (1986), "Optimization of Control Parameters for Genetic Algorithms. IEEE Transactions on Systems, Man h Cybernetics SMC-16, No 1, pp. 122-128
6. Katayama K., Hirabayashi H., Narihisa H. (1998). "Performance Analysis of a New Genetic Crossover for the Traveling Salesman Problem". IEICE Transactions oil Fiindamentals of elecbonics, Communications and Computer Science, Vol.ES 1-A, No.5, pp 738-750.
7. Lee M., Takagi H. (1994), "A framework for studying the effects of dynamic crossover, mutation, and population sizing in genetic algorithms". Advances in Fuzzy Logic, Neural Networks and Genetic Algorithms, Lecture Notes in Artificial Intelligence 10 1, pp. 11 1-126
8. Michalewicz Z. (1996), Genetic Algorithms + Data Struetiires = Evolution Programs. Third Edition. Springer-Verlag.
9. Oliver I.M., Smith D.J., Holland J.R.C.(1987), "A Study of Permutation Crossover Operators on the Traveling Salesman Problem". In Proceedings of the Second International Conference on Geiietic Algorithms, pp. 224-230.
10. Reinelt G. (1991), "TSPLTB-a Traveling Salesman Problem Library". Eirropean Journal of Operations Research, Vol 52, pp 125, (http://softlib rice.edu/softlib/tsplib)
11. Whitley D., Starkweather T., Fuquay D'A. (1989), "Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination Operator" IT1 Proceedings of the Third International Conference on Genetic Algorithms, pp. 133-140.
12. Yamamura M., Ono I., Kobayashi S. (1996), "Emergent search on double circle TSPs using subtour exchange crossover". In Proceedings of International Conference 017 Evolutionary Conipzitation, pp. 535-540