메뉴 건너뛰기




Volumn 6622 LNCS, Issue , 2011, Pages 203-214

Off-line and on-line tuning: A study on operator selection for a memetic algorithm applied to the QAP

Author keywords

[No Author keywords available]

Indexed keywords

MEMETIC ALGORITHMS; ONLINE TUNING; OPTIMIZATION ALGORITHMS; PARAMETER SETTING; QUADRATIC ASSIGNMENT PROBLEMS; SOLUTION PROCESS; TUNING METHOD; OPERATOR SELECTIONS;

EID: 79955786934     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20364-0_18     Document Type: Conference Paper
Times cited : (12)

References (25)
  • 1
    • 14644421108 scopus 로고    scopus 로고
    • A racing algorithm for configuring metaheuristics
    • Langdon, W., et al. (eds.) Morgan Kaufmann Publishers, San Francisco
    • Birattari, M., Stützle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Langdon, W., et al. (eds.) GECCO 2002, pp. 11-18. Morgan Kaufmann Publishers, San Francisco (2002)
    • (2002) GECCO 2002 , pp. 11-18
    • Birattari, M.1    Stützle, T.2    Paquete, L.3    Varrentrapp, K.4
  • 2
    • 38148998723 scopus 로고    scopus 로고
    • Improvement strategies for the F-race algorithm: Sampling design and iterative refinement
    • Bartz-Beielstein, T., Blesa Aguilera, M.J., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) HM 2007. Springer, Heidelberg
    • Balaprakash, P., Birattari, M., Stützle, T.: Improvement strategies for the F-race algorithm: Sampling design and iterative refinement. In: Bartz-Beielstein, T., Blesa Aguilera, M.J., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) HM 2007. LNCS, vol. 4771, pp. 108-122. Springer, Heidelberg (2007)
    • (2007) LNCS , vol.4771 , pp. 108-122
    • Balaprakash, P.1    Birattari, M.2    Stützle, T.3
  • 3
    • 33644511374 scopus 로고    scopus 로고
    • Fine-tuning of algorithms using fractional experimental designs and local search
    • Adenso-Díaz, B., Laguna, M.: Fine-tuning of algorithms using fractional experimental designs and local search. Operations Research 54(1), 99-114 (2006)
    • (2006) Operations Research , vol.54 , Issue.1 , pp. 99-114
    • Adenso-Díaz, B.1    Laguna, M.2
  • 11
    • 78049304013 scopus 로고    scopus 로고
    • Off-line and on-line tuning: A study on MAX-MIN ant system for TSP
    • Dorigo, M., Birattari, M., Di Caro, G.A., Doursat, R., Engelbrecht, A.P., Floreano, D., Gambardella, L.M., Groß, R., Şahin, E., Sayama, H., Stützle, T. (eds.) ANTS 2010. Springer, Heidelberg
    • Pellegrini, P., Stützle, T., Birattari, M.: Off-line and on-line tuning: a study on MAX-MIN ant system for TSP. In: Dorigo, M., Birattari, M., Di Caro, G.A., Doursat, R., Engelbrecht, A.P., Floreano, D., Gambardella, L.M., Groß, R., Şahin, E., Sayama, H., Stützle, T. (eds.) ANTS 2010. LNCS, vol. 6234, pp. 239-250. Springer, Heidelberg (2010)
    • (2010) LNCS , vol.6234 , pp. 239-250
    • Pellegrini, P.1    Stützle, T.2    Birattari, M.3
  • 12
    • 0003603223 scopus 로고
    • On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms
    • California Institute of Technology, Pasadena, CA, USA
    • Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Technical Report Caltech Concurrent Computation Program, 826, California Institute of Technology, Pasadena, CA, USA, 1989.
    • (1989) Technical Report Caltech Concurrent Computation Program , pp. 826
    • Moscato, P.1
  • 13
    • 0034315990 scopus 로고    scopus 로고
    • Fitness landscape analysis and memetic algorithms for the quadratic assignment problem
    • Merz, P., Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Transactions on Evolutionary Computation 4(4), 337-352 (2000)
    • (2000) IEEE Transactions on Evolutionary Computation , vol.4 , Issue.4 , pp. 337-352
    • Merz, P.1    Freisleben, B.2
  • 14
    • 84901399858 scopus 로고    scopus 로고
    • A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem
    • IEEE Press, Los Alamitos
    • Merz, P., Freisleben, B.: A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem. In: Proc. Congress on Evolutionary Computation, pp. 2063-2070. IEEE Press, Los Alamitos (1999)
    • (1999) Proc. Congress on Evolutionary Computation , pp. 2063-2070
    • Merz, P.1    Freisleben, B.2
  • 15
    • 0002459134 scopus 로고    scopus 로고
    • A genetic local search approach to the quadratic assignment problem
    • Morgan Kaufmann, San Francisco
    • Merz, P., Freisleben, B.: A genetic local search approach to the quadratic assignment problem. In: 7th International Conference on Genetic Algorithms, pp. 465-472. Morgan Kaufmann, San Francisco (1997)
    • (1997) 7th International Conference on Genetic Algorithms , pp. 465-472
    • Merz, P.1    Freisleben, B.2
  • 16
    • 0002737691 scopus 로고
    • Genetic algorithms and rule learning in dynamic system control
    • Morgan Kaufmann Publishers Inc., San Francisco
    • Goldberg, D.E.: Genetic algorithms and rule learning in dynamic system control. In: International Conference on Genetic Algorithms and Their Applications, pp. 8-15. Morgan Kaufmann Publishers Inc., San Francisco (1985)
    • (1985) International Conference on Genetic Algorithms and Their Applications , pp. 8-15
    • Goldberg, D.E.1
  • 17
    • 0000150947 scopus 로고
    • Applying adaptive algorithms to epistatic domains
    • Davis, L.: Applying adaptive algorithms to epistatic domains. In: Proc. of IJCAI, pp. 162-164 (1985)
    • (1985) Proc. of IJCAI , pp. 162-164
    • Davis, L.1
  • 18
    • 84944312713 scopus 로고    scopus 로고
    • On fitness distributions and expected fitness gain of mutation rates in parallel evolutionary algorithms
    • Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN VII. Springer, Heidelberg
    • Corne, D.W., Oates, M.J., Kell, D.B.: On fitness distributions and expected fitness gain of mutation rates in parallel evolutionary algorithms. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández- Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN VII. LNCS, vol. 2439, pp. 132-141. Springer, Heidelberg (2002)
    • (2002) LNCS , vol.2439 , pp. 132-141
    • Corne, D.W.1    Oates, M.J.2    Kell, D.B.3
  • 19
    • 32444431946 scopus 로고    scopus 로고
    • An adaptive pursuit strategy for allocating operator probabilities
    • IEEE Press, Piscataway
    • Thierens, D.: An adaptive pursuit strategy for allocating operator probabilities. In: IEEE Congress on Evolutionary Computation, pp. 1539-1546. IEEE Press, Piscataway (2005)
    • (2005) IEEE Congress on Evolutionary Computation , pp. 1539-1546
    • Thierens, D.1
  • 20
    • 0036568025 scopus 로고    scopus 로고
    • Finite-time analysis of the multiarmed bandit problem
    • Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Machine Learning 47(2), 235-256 (2002)
    • (2002) Machine Learning , vol.47 , Issue.2 , pp. 235-256
    • Auer, P.1    Cesa-Bianchi, N.2    Fischer, P.3
  • 23
    • 33749581467 scopus 로고    scopus 로고
    • New benchmark instances for the QAP and the experimental analysis of algorithms
    • Gottlieb, J., Raidl, G. (eds.) EvoCOP 2004. Springer, Heidelberg
    • Stützle, T., Fernandes, S.: New benchmark instances for the QAP and the experimental analysis of algorithms. In: Gottlieb, J., Raidl, G. (eds.) EvoCOP 2004. LNCS, vol. 3004, pp. 199-209. Springer, Heidelberg (2004)
    • (2004) LNCS , vol.3004 , pp. 199-209
    • Stützle, T.1    Fernandes, S.2


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