메뉴 건너뛰기




Volumn 7665 LNCS, Issue PART 3, 2012, Pages 488-495

A meta-learning approach to select meta-heuristics for the traveling salesman problem using MLP-based label ranking

Author keywords

label ranking; meta learning; multilayer perceptron; traveling salesman problem

Indexed keywords

APPLICATION SCENARIO; CLASSIFICATION APPROACH; META HEURISTICS; META-LEARNING APPROACH; METALEARNING; MULTI LAYER PERCEPTRON; MULTI-LABEL;

EID: 84869001787     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-34487-9_59     Document Type: Conference Paper
Times cited : (17)

References (25)
  • 3
    • 0037361994 scopus 로고    scopus 로고
    • Ranking learning algorithms: Using ibl and metalearning on accuracy and time results
    • Brazdil, P., Soares, C., Costa, J.: Ranking learning algorithms: Using ibl and metalearning on accuracy and time results. Machine Learning 50, 251-257 (2003)
    • (2003) Machine Learning , vol.50 , pp. 251-257
    • Brazdil, P.1    Soares, C.2    Costa, J.3
  • 5
    • 0031122887 scopus 로고    scopus 로고
    • Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem
    • Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation 1(1), 53-66 (1997)
    • (1997) IEEE Transactions on Evolutionary Computation , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 6
    • 0000049494 scopus 로고
    • Greedy randomized adaptive search procedures
    • Feo, T., Resende, M.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109-133 (1995)
    • (1995) Journal of Global Optimization , vol.6 , pp. 109-133
    • Feo, T.1    Resende, M.2
  • 13
    • 0002472452 scopus 로고
    • Genetic algorithms and the optimal allocations of trial
    • Holland, J.: Genetic algorithms and the optimal allocations of trial. SIAM J. Comp. 2, 88-105 (1973)
    • (1973) SIAM J. Comp. , vol.2 , pp. 88-105
    • Holland, J.1
  • 15
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220, 671-680 (1983)
    • (1983) Science , vol.220 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, C.2    Vecchi, M.3
  • 16
    • 19044391501 scopus 로고
    • The euclidean traveling salesman problem is np-complete
    • Papadimitriou, C.H.: The euclidean traveling salesman problem is np-complete. Theoretical Computer Science 4(3), 237-244 (1977)
    • (1977) Theoretical Computer Science , vol.4 , Issue.3 , pp. 237-244
    • Papadimitriou, C.H.1
  • 17
    • 0026225350 scopus 로고
    • TSPLIB - A traveling salesman problem library
    • Reinelt, G.: TSPLIB - a traveling salesman problem library. ORSA Journal on Computing 3, 376-384 (1991)
    • (1991) ORSA Journal on Computing , vol.3 , pp. 376-384
    • Reinelt, G.1
  • 19
    • 77954569885 scopus 로고    scopus 로고
    • Understanding TSP Difficulty by Learning from Evolved Instances
    • Blum, C., Battiti, R. (eds.) LION 4. Springer, Heidelberg
    • Smith-Miles, K., van Hemert, J., Lim, X.Y.: Understanding TSP Difficulty by Learning from Evolved Instances. In: Blum, C., Battiti, R. (eds.) LION 4. LNCS, vol. 6073, pp. 266-280. Springer, Heidelberg (2010)
    • (2010) LNCS , vol.6073 , pp. 266-280
    • Smith-Miles, K.1    Van Hemert, J.2    Lim, X.Y.3
  • 20
    • 80052260522 scopus 로고    scopus 로고
    • Review: Measuring instance dificulty for combinatorial optimization problems
    • Smith-Miles, K., Lopes, L.: Review: Measuring instance dificulty for combinatorial optimization problems. Comput. Oper. Res. 39(5), 875-889 (2012)
    • (2012) Comput. Oper. Res. , vol.39 , Issue.5 , pp. 875-889
    • Smith-Miles, K.1    Lopes, L.2
  • 21
    • 0002965815 scopus 로고
    • The proof and measurement of association between two things
    • Spearman, C.: The proof and measurement of association between two things. American Journal of Psychology 15, 72-101 (1904)
    • (1904) American Journal of Psychology , vol.15 , pp. 72-101
    • Spearman, C.1
  • 23
    • 84890217212 scopus 로고    scopus 로고
    • Label ranking algorithms: A survey
    • Fũrnkranz, J., Hũllermeier, E. (eds.) Springer, Heidelberg
    • Vembu, S., Gärtner, T.: Label ranking algorithms: A survey. In: Fũrnkranz, J., Hũllermeier, E. (eds.) Preference Learning, pp. 45-64. Springer, Heidelberg (2011)
    • (2011) Preference Learning , pp. 45-64
    • Vembu, S.1    Gärtner, T.2
  • 24
    • 0036791948 scopus 로고    scopus 로고
    • A perspective view and survey of meta-learning
    • Vilalta, R., Drissi, Y.: A perspective view and survey of meta-learning. Artificial Intelligence Review 18, 77-95 (2002)
    • (2002) Artificial Intelligence Review , vol.18 , pp. 77-95
    • Vilalta, R.1    Drissi, Y.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.