Tuning algorithms for tackling large instances: An experimental protocol

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7997 LNCS, Issue , 2013, Pages 410-422

  Mascia, Franco ^a   Birattari, Mauro ^a   Stützle, Thomas ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Automatic algorithm configuration; Iterated local search; Quadratic assignment problem; Robust tabu search; Scaling of parameters

Indexed keywords

ALGORITHM PARAMETERS; AUTOMATIC ALGORITHMS; EXPERIMENTAL PROTOCOLS; ITERATED LOCAL SEARCH; QUADRATIC ASSIGNMENT PROBLEMS; SCALING OF PARAMETERS; STOCHASTIC LOCAL SEARCHES; TABU SEARCH ALGORITHMS;

COMBINATORIAL OPTIMIZATION; LEARNING ALGORITHMS; OPTIMIZATION;

PARAMETER ESTIMATION;

EID: 84890952869     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-44973-4_44     Document Type: Conference Paper

References (12)

1. Hoos, H.H.: Programming by optimization. Commun. ACM 55(2), 70-80 (2012)
2. Lourenço, H.R., Martin, O., Stützle, T.: Iterated local search: framework and applications. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, 2nd edn, pp. 363-397. Springer, New York (2010)
3. Stützle, T.: Iterated local search for the quadratic assignment problem. Eur. J. Oper. Res. 174(3), 1519-1539 (2006)
4. Taillard, É.D.: Robust taboo search for the quadratic assignment problem. Parallel Comput. 17(4-5), 443-455 (1991)
5. Koopmans, T.C., Beckmann, M.J.: Assignment problems and the location of economic activities. Econometrica 25, 53-76 (1957)
6. Taillard, E.D.: Comparison of iterative searches for the quadratic assignment problem. Location Sci. 3(2), 87-105 (1995)
7. Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evol. Comput. 9(2), 159-195 (2001)
8. Tseng, L.Y., Chen, C.: Multiple trajectory search for large scale global optimization. In: Proceedings of IEEE Congress on Evolutionary Computation, Piscataway, NJ, IEEE, pp. 3052-3059 June 2008
9. Birattari, M., Zlochin, M., Dorigo, M.: Towards a theory of practice in metaheuristics design: a machine learning perspective. Theor. Inform. Appl. 40(2), 353-369 (2006)
10. Mladenovic, N., Hansen, P.: Variable neighbourhood search. Comput. Oper. Res. 24(11), 71-86 (1997)
11. Hansen, P., Mladenovic, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449-467 (2001)
12. Styles, J., Hoos, H.H., Müller, M.: Automatically configuring algorithms for scaling performance. In: Hamadi, Y., Schoenauer, M. (eds.) LION 6. LNCS, vol. 7219, pp. 205-219. Springer, Heidelberg (2012)