Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools

Computers and Operations Research

Volumn 51, Issue , 2014, Pages 190-199

  Mascia, Franco ^a   López Ibáñez, Manuel ^a   Dubois Lacoste, Jérémie ^a   Stützle, Thomas ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Automatic algorithm configuration; Bin packing; Flowshop scheduling; Grammatical evolution; Heuristics

Indexed keywords

COMPUTATIONAL GRAMMARS; GENETIC ALGORITHMS; SCHEDULING; STOCHASTIC SYSTEMS;

AUTOMATIC ALGORITHMS; BIN PACKING; FLOW-SHOP SCHEDULING; GRAMMATICAL EVOLUTION; HEURISTICS;

ALGORITHMS;

EID: 84903118447     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2014.05.020     Document Type: Article

References (35)

1. Birattari M. Tuning metaheuristics: a machine learning perspective. In: Studies in computational intelligence, vol. 197. Berlin, Heidelberg, Germany: Springer; 2009
2. V. Nannen, and A.E. Eiben A method for parameter calibration and relevance estimation in evolutionary algorithms M. Cattolico, Proceedings of GECCO 2006 2006 ACM Press New York, NY 183 190
3. F. Hutter, H.H. Hoos, K. Leyton-Brown, and T. Stützle ParamILS an automatic algorithm configuration framework J Artif Intell Res 36 2009 267 306
4. Bartz-Beielstein T, Lasarczyk C, Preuss M. The sequential parameter optimization toolbox. In: Bartz-Beielstein T, et al., editors. Experimental methods for the analysis of optimization algorithms. Berlin, Germany: Springer; 2010. p. 337-60.
5. Birattari M, Yuan Z, Balaprakash P, Stützle T. F-race and iterated F-race: an overview. In: In: Bartz-Beielstein T, et al., editors. Experimental methods for the analysis of optimization algorithms. Berlin, Germany: Springer; 2010. p. 311-36.
6. López-Ibáñez M, Dubois-Lacoste J, Stützle T, Birattari M. The irace package, iterated race for automatic algorithm configuration Technical report. TR/IRIDIA/2011-004, IRIDIA, Université Libre de Bruxelles, Belgium. URL http://iridia.ulb.ac.be/IridiaTrSeries/ IridiaTr2011-004.pdf; 2011.
7. F. Hutter, H.H. Hoos, and K. Leyton-Brown Sequential model-based optimization for general algorithm configuration C.A. Coello Coello, LION 5, Lecture notes in computer science vol. 6683 2011 Springer Heidelberg, Germany
8. Z. Yuan, M.A. Montes de Oca, T. Stützle, and M. Birattari Continuous optimization algorithms for tuning real and integer algorithm parameters of swarm intelligence algorithms Swarm Intell 6 1 2012 49 75
9. E. Montero, M.-C. Riff, and B. Neveu A beginner?s guide to tuning methods Appl Soft Comput 17 2014 39 51
10. A.R. KhudaBukhsh, L. Xu, H.H. Hoos, and K. Leyton-Brown SATenstein automatically building local search SAT solvers from components C. Boutilier, Proceedings of the twenty-first international joint conference on artificial intelligence (IJCAI-09) 2009 AAAI Press Menlo Park, CA 517 524
11. M. López-Ibáñez, and T. Stützle The automatic design of multi-objective ant colony optimization algorithms IEEE Trans Evol Comput 16 6 2012 861 875
12. Y. Caseau, G. Silverstein, and F. Laburthe Learning hybrid algorithms for vehicle routing problems Theory Pract Logic Program 1 6 2001 779 806
13. A.S. Fukunaga Evolving local search heuristics for SAT using genetic programming K. Deb, Proceedings of GECCO 2004. Part II. Lecture notes in computer science vol. 3103 2004 Springer Heidelberg, Germany 483 494
14. A.S. Fukunaga Automated discovery of local search heuristics for satisfiability testing Evol Comput 16 1 2008 31 61
15. R.I. Mckay, N.X. Hoai, P.A. Whigham, Y. Shan, and M. O?Neill Grammar-based genetic programming a survey Genet Program Evol Mach 11 3-4 2010 365 396
16. J.A. Vázquez-Rodríguez, and G. Ochoa On the automatic discovery of variants of the NEH procedure for flow shop scheduling using genetic programming J Oper Res Soc 62 2 2010 381 396
17. E.K. Burke, M.R. Hyde, and G. Kendall Grammatical evolution of local search heuristics IEEE Trans Evol Comput 16 7 2012 406 417
18. M. O?Neill, and C. Ryan Grammatical evolution IEEE Trans Evol Comput 5 4 2001 349 358
19. H.H. Hoos Programming by optimization Commun ACM 55 2 2012 70 80
20. J. Koza Genetic programming: on the programming of computers by the means of natural selection 1992 MIT Press Cambridge, MA
21. J. Tavares, and F.B. Pereira Automatic design of ant algorithms with grammatical evolution A. Moraglio, Proceedings of the 15th European conference on genetic programming, EuroGP. Lecture notes in computer science vol. 7244 2012 Springer Heidelberg, Germany 206 217
22. E.K. Burke, M. Gendreau, M.R. Hyde, G. Kendall, G. Ochoa, and E. Özcan et al. Hyper-heuristics a survey of the state of the art J Oper Res Soc 64 12 2013 1695 1724
23. F. Mascia, M. López-Ibánez, J. Dubois-Lacoste, and T. Stützle From grammars to parameters automatic iterated greedy design for the permutation flow-shop problem with weighted tardiness P. Pardalos, G. Nicosia, LION 7. Lecture notes in computer science vol. 7997 2013 Springer Heidelberg, Germany 321 334
24. M.R. Garey, and D.S. Johnson Computers and intractability: a guide to the theory of NP-COmpleteness 1979 Freeman & Co San Francisco, CA
25. S. Martello, and P. Toth Knapsack problems: algorithms and computer implementations 1990 John Wiley & Sons Chichester, UK
26. Mascia F, López-Ibáñez M, Dubois-Lacoste J, Stützle T. Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools: supplementary material. http://iridia.ulb.ac.be/supp/IridiaSupp2013-009/ , 2013.
27. S. Martello, and P. Toth Lower bounds and reduction procedures for the bin packing problem Discret Appl Math 28 1 1990 59 70 ISSN 0166-218X
28. D.S. Johnson Optimal two- and three-stage production scheduling with setup times included Naval Res Logist Quart 1 1954 61 68
29. M.R. Garey, D.S. Johnson, and R. Sethi The complexity of flowshop and jobshop scheduling Math Oper Res 1 1976 117 129
30. J. Du, and J.Y.-T. Leung Minimizing total tardiness on one machine is NP-hard Math Oper Res 15 3 1990 483 495
31. R. Ruiz, and T. Stützle A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem Eur J Oper Res 177 3 2007 2033 2049
32. J. Dubois-Lacoste, M. López-Ibá nez, and T. Stützle A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems Comput Oper Res 38 8 2011 1219 1236
33. É.D. Taillard Benchmarks for basic scheduling problems Eur J Oper Res 64 2 1993 278 285
34. G. Minella, R. Ruiz, and M. Ciavotta A review and evaluation of multiobjective algorithms for the flowshop scheduling problem INFORMS J Comput 20 3 2008 451 471
35. M.-E. Marmion, F. Mascia, M. López-Ibá nez, and T. Stützle Automatic design of hybrid stochastic local search algorithms M.J. Blesa, Hybrid metaheuristics. Lecture notes in computer science vol. 7919 2013 Springer Heidelberg, Germany 144 158 ISBN 978-3-642-38515-5