Automatic design of hybrid stochastic local search algorithms

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

Volumn 7919 LNCS, Issue , 2013, Pages 144-158

  Marmion, Marie Eléonore ^a   Mascia, Franco ^a   López Ibáñez, Manuel ^a   Stützle, Thomas ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

automatic algorithm design; generalized local search structure; grammar; Stochastic local search

Indexed keywords

AUTOMATIC ALGORITHMS; AUTOMATIC CONFIGURATION; COMBINATORIAL OPTIMIZATION PROBLEMS; GRAMMAR; LOCAL SEARCH; STATE-OF-THE-ART ALGORITHMS; STOCHASTIC LOCAL SEARCHES; VARIABLE NEIGHBORHOOD SEARCH;

HEURISTIC ALGORITHMS; SIMULATED ANNEALING; STOCHASTIC SYSTEMS;

ITERATIVE METHODS;

EID: 84882935221     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38516-2_12     Document Type: Conference Paper

References (22)

1. 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)
2. Burke, E.K., Hyde, M.R., Kendall, G.: Grammatical evolution of local search heuristics. IEEE Transactions on Evolutionary Computation 16(7), 406-417 (2012)
3. Cahon, S., Melab, N., Talbi, E.G.: ParadisEO: A framework for the reusable design of parallel and distributed metaheuristics. Journal of Heuristics 10(3), 357-380 (2004)
4. Conover, W.J.: Practical Nonparametric Statistics, 3rd edn. John Wiley & Sons, New York (1999)
5. Du, J., Leung, J.Y.T.: Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15(3), 483-495 (1990)
6. Dubois-Lacoste, J.: A study of Pareto and Two-Phase Local Search Algorithms for Biobjective Permutation Flowshop Scheduling. Master's thesis, IRIDIA, Université Libre de Bruxelles, Belgium (2009)
7. Dubois-Lacoste, J., López-Ibáñez, M., Stützle, T.: A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems. Computers & Operations Research 38(8), 1219-1236 (2011)
8. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109-113 (1995)
9. Glover, F.: Tabu search - Part I. INFORMS Journal on Computing 1(3), 190-206 (1989)
10. Hansen, P., Mladenovic, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research 130(3), 449-467 (2001)
11. Hoos, H.H., Stützle, T.: Stochastic Local Search-Foundations and Applications. Morgan Kaufmann Publishers, San Francisco (2005)
12. Hutter, F., Hoos, H.H., Leyton-Brown, K., Stützle, T.: ParamILS: an automatic algorithm configuration framework. Journal of Artificial Intelligence Research 36, 267-306 (2009)
13. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671-680 (1983)
14. López-Ibáñez, M., Dubois-Lacoste, J., Stützle, T., Birattari, M.: The irace package, iterated race for automatic algorithm configuration. Tech. Rep. TR/IRIDIA/2011-004, IRIDIA, Université Libre de Bruxelles, Belgium (2011)
15. 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, ch. 9, 2nd edn., pp. 363-397. Springer (2010)
16. Mascia, F., López-Ibáñez, M., Dubois-Lacoste, J., Stützle, T.: From grammars to parameters: Automatic iterated greedy design for the permutation flow-shop problem with weighted tardiness. In: 7th International Conference on Learning and Intelligent Optimization, LION 7. LNCS. Springer (to appear, 2013)
17. Mckay, R.I., Hoai, N.X.,Whigham, P.A., Shan, Y., O'Neill, M.: Grammar-based genetic programming: A survey. Genetic Programming and Evolvable Machines 11(3-4), 365-396 (2010)
18. Minella, G., Ruiz, R., Ciavotta, M.: A review and evaluation of multiobjective algorithms for the flowshop scheduling problem. INFORMS Journal on Computing 20(3), 451-471 (2008)
19. Nawaz, M., Enscore Jr., E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA 11(1), 91-95 (1983)
20. Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization - Algorithms and Complexity. Prentice Hall, Englewood Cliffs (1982)
21. Ruiz, R., Stützle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 177(3), 2033-2049 (2007)
22. Taillard, É.D.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64(2), 278-285 (1993)