The irace Package: Iterated Race for Automatic Algorithm Configuration. The irace package implements the iterated racing procedure, which is an extension of the Iterated F-race procedure. Its main purpose is to automatically configure optimization algorithms by finding the most appropriate settings given a set of instances of an optimization problem. It builds upon the race package by Birattari and it is implemented in R. Keywords: automatic configuration, offline tuning, parameter tuning, racing, F-race. Relevant literature: Manuel López-Ibáñez, Jérémie Dubois-Lacoste, Thomas Stützle, and Mauro Birattari. The irace package, Iterated Race for Automatic Algorithm Configuration. Technical Report TR/IRIDIA/2011-004, IRIDIA, Université libre de Bruxelles, Belgium, 2011.

References in zbMATH (referenced in 53 articles )

Showing results 1 to 20 of 53.
Sorted by year (citations)

1 2 3 next

  1. Djukanovic, Marko; Raidl, Günther R.; Blum, Christian: Anytime algorithms for the longest common palindromic subsequence problem (2020)
  2. Franzin, Alberto; Stützle, Thomas: Revisiting simulated annealing: a component-based analysis (2019)
  3. Lu, Yongliang; Benlic, Una; Wu, Qinghua: A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem (2019)
  4. Pagnozzi, Federico; Stützle, Thomas: Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (2019)
  5. Strub, O.; Trautmann, N.: A two-stage approach to the UCITS-constrained index-tracking problem (2019)
  6. Welchowski, Thomas; Schmid, Matthias: Sparse kernel deep stacking networks (2019)
  7. Zhou, Qing; Benlic, Una; Wu, Qinghua; Hao, Jin-Kao: Heuristic search to the capacitated clustering problem (2019)
  8. Brazdil, Pavel (ed.); Giraud-Carrier, Christophe (ed.): Metalearning and algorithm selection: progress, state of the art and introduction to the 2018 special issue (2018)
  9. Chen, Yuning; Hao, Jin-Kao: Two phased hybrid local search for the periodic capacitated arc routing problem (2018)
  10. Eggensperger, Katharina; Lindauer, Marius; Hoos, Holger H.; Hutter, Frank; Leyton-Brown, Kevin: Efficient benchmarking of algorithm configurators via model-based surrogates (2018)
  11. Franzin, Alberto; Pérez Cáceres, Leslie; Stützle, Thomas: Effect of transformations of numerical parameters in automatic algorithm configuration (2018)
  12. Friedrich, Christian; Klausnitzer, Armin; Lasch, Rainer: Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance (2018)
  13. Furini, Fabio; Malaguti, Enrico; Santini, Alberto: An exact algorithm for the partition coloring problem (2018)
  14. Kiefer, Alexander; Schilde, Michael; Doerner, Karl F.: Scheduling of maintenance work of a large-scale tramway network (2018)
  15. Lu, Yongliang; Benlic, Una; Wu, Qinghua: A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints (2018)
  16. Lu, Yongliang; Benlic, Una; Wu, Qinghua: Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading (2018)
  17. Melchiori, Anna; Sgalambro, Antonino: A matheuristic approach for the quickest multicommodity (k)-splittable flow problem (2018)
  18. Paquay, Célia; Limbourg, Sabine; Schyns, Michaël: A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints (2018)
  19. Pereira, Jordi; Ritt, Marcus; Vásquez, Óscar C.: A memetic algorithm for the cost-oriented robotic assembly line balancing problem (2018)
  20. Pessoa, Luciana S.; Andrade, Carlos E.: Heuristics for a flowshop scheduling problem with stepwise job objective function (2018)

1 2 3 next