Learning classifier systems for optimisation problems: A case study on fractal travelling salesman problem

GECCO'08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation 2008

Volumn , Issue , 2008, Pages 2039-2046

  Tabacman, Maximiliano ^a   Bacardit, Jaume ^b   Krasnogor, Natalio ^b   Loiseau, Irene ^a  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Learning classifier systems; Machine learning; Optimization; Traveling salesman problem

Indexed keywords

CLASSIFIERS; COMBINATORIAL OPTIMIZATION; EDUCATION; FRACTALS; LEARNING SYSTEMS;

CASE STUDIES; COMBINATORIAL OPTIMISATION; LEARNING RULES; LEARNING-CLASSIFIER-SYSTEMS; MACHINE LEARNING; OPTIMAL TOURS; OPTIMISATION; TRAVELLING SALESMAN PROBLEMS;

TRAVELING SALESMAN PROBLEM;

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

References (13)

1. J. Bacardit. Pittsburgh Genetics-Based Machine Learning in the Data Mining era: Representations, generalization, and run-time. PhD thesis, Ramon Llull University, Barcelona, Catalonia, Spain, 2004.
2. J. Bacardit. Analysis of the initialization stage of a Pittsburgh approach learning classifier system. In GECCO 2005: Proceedings of the Genetic and Evolutionary Computation Conference, volume 2, pages 1843-1850. ACM Press, 2005.
3. J. Bacardit and N. Krasnogor. Empirical evaluation of ensemble techniques for a Pittsburgh learning classifier system. In Proceedings of the 9th International Workshop on Learning Classifier Systems, (to appear), LNAI, Springer-Verlag, 2008.
4. J. H. Holland and J. S. Reitman. Cognitive systems based on adaptive algorithms. In D. Hayes-Roth and F. Waterman, editors, Pattern-directed Inference Systems, pages 313-329. Academic Press, New York, 1978.
5. A. Mariano, P. Moscato, and M. Norman. Arbitrarily large planar etsp instances with known optimal tours. Pesquisa Operacional, 15:89-96, 1995.
6. A. Mariano, P. Moscato, and M. Norman. Using 1-systems to generate arbitrarily large instances of the euclidean traveling salesman problem with known optimal tours. In Anales del XXVII Simposio Brasileiro de Pesquisa Operacional, Vitoria, Brazil, 6-8 Nov. 1995.
7. P. Moscato and M. Norman. An analysis of the performance of traveling salesman heuristics on infinite-size fractal instances in the euclidean plane. Technical report, CeTAD - Universidad Nacional de La Plata, 1994.
8. M. Norman and P. Moscato. The euclidean traveling salesman problem and a space-filling curve. Chaos, Solitons and Fractals, 6:389-397, 1995.
9. H. Peitgen, H. Jürgens, and D. Saupe. Chaos and Fractals. Springer, February 2004.
10. S. Smith. A Learning System Based on Genetic Algorithms. PhD thesis, University of Pittsburgh, 1980.
11. M. Stout, J. Bacardit, J. D. Hirst, and N. Krasnogor. Prediction of recursive convex hull class assignments for protein residues. Bioinformatics, In press, 2008.
12. M. Stout, J. Bacardit, J. D. Hirst, R. E. Smith, and N. Krasnogor. Prediction of topological contacts in proteins using learning classifier systems. Soft Computing, Special Issue on Evolutionary and Metaheuristic-based Data Mining (EMBDM), In Press, 2008.
13. D. Wolpert and W. Macready. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1):67-82, April 1997.