Automatically improving the anytime behaviour of optimisation algorithms

European Journal of Operational Research

Volumn 235, Issue 3, 2014, Pages 569-582

  López Ibáñez, Manuel ^a   Stützle, Thomas ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Anytime algorithms; Automatic configuration; Metaheuristics; Offline tuning

Indexed keywords

EID: 84894504496     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2013.10.043     Document Type: Article

References (61)

1. T. Achterberg SCIP: Solving constraint integer programs Mathematical Programming Computation 10 1 2009 0 1 41
2. B. Adenso-Díaz, and M. Laguna Fine-tuning of algorithms using fractional experimental design and local search Operations Research 540 1 2006 0 99 114
3. S. Aine, R. Kumar, and P.P. Chakrabarti Adaptive parameter control of evolutionary algorithms to improve quality-time trade-off Applied Soft Computing 90 2 2009 0 527 540
4. C. Ansótegui, M. Sellmann, and K. Tierney A gender-based genetic algorithm for the automatic configuration of algorithms I.P. Gent, Principles and practice of constraint programming, CP 2009 LNCS Vol. 5732 2009 Springer 142 157
5. A. Auger, J. Bader, D. Brockhoff, and E. Zitzler Investigating and exploiting the bias of the weighted hypervolume to articulate user preferences F. Rothlauf, Proceedings of GECCO 2009 2009 ACM Press 563 570
6. A. Auger, J. Bader, D. Brockhoff, and E. Zitzler Hypervolume-based multiobjective optimization: Theoretical foundations and practical implications Theoretical Computer Science 425 2012 0 75 103
7. A. Auger, and N. Hansen A restart CMA evolution strategy with increasing population size Proceedings of CEC 2005 2005 IEEE Press 1769 1776
8. P. Balaprakash, M. Birattari, and T. Stützle Improvement strategies for the F-race algorithm: Sampling design and iterative refinement T. Bartz-Beielstein, Hybrid metaheuristics LNCS Vol. 4771 2007 Springer 108 122
9. T. Bartz-Beielstein Experimental research in evolutionary computation: The new experimentalism 2006 Springer
10. T. Bartz-Beielstein, C. Lasarczyk, and M. Preuss The sequential parameter optimization toolbox T. Bartz-Beielstein, Experimental methods for the analysis of optimization algorithms 2010 Springer 337 360
11. M. Birattari Tuning metaheuristics: A machine learning perspective Studies in computational intelligence Vol. 197 2009 Springer
12. M. Birattari, T. Stützle, L. Paquete, and K. Varrentrapp A racing algorithm for configuring metaheuristics 2002 W.B. Langdon, Proceedings of GECCO 2002 Morgan Kaufmann Publishers San Francisco, CA 11 18
13. M. Birattari, Z. Yuan, P. Balaprakash, and T. Stützle F-race and iterated F-race: An overview T. Bartz-Beielstein, Experimental methods for the analysis of optimization algorithms 2010 Springer 311 336
14. J. Branke, and J. Elomari Simultaneous tuning of metaheuristic parameters for various computing budgets N. Krasnogor, P.L. Lanzi, Proceedings of GECCO 2011 2011 ACM Press 263 264
15. Chiarandini, M. (2005). Stochastic local search methods for highly constrained combinatorial optimisation problems. PhD thesis, FG Intellektik, FB Informatik, TU Darmstadt, Germany.
16. W.J. Conover Practical nonparametric statistics 1999 John Wiley & Sons
17. S.P. Coy, B.L. Golden, G.C. Runger, and E.A. Wasil Using experimental design to find effective parameter settings for heuristics Journal of Heuristics 70 1 2001 77 97
18. T. Dean, and M.S. Boddy An analysis of time-dependent planning Proceedings of the 7th national conference on artificial intelligence AAAI-88 1988 AAAI Press 49 54
19. den Besten, M. (2004). Simple metaheuristics for scheduling. PhD thesis, FB Informatik, TU Darmstadt, Germany.
20. M. Dorigo, and L.M. Gambardella Ant colony system: A cooperative learning approach to the traveling salesman problem IEEE Transactions on Evolutionary Computation 10 1 1997 0 53 66
21. M. Dorigo, and T. Stützle Ant colony optimization 2004 MIT Press Cambridge, MA
22. J. Dréo Using performance fronts for parameter setting of stochastic metaheuristics F. Rothlauf, GECCO (companion) 2009 ACM Press 2197 2200
23. J. Dubois-Lacoste, M. López-Ibáñez, and T. Stützle Automatic configuration of state-of-the-art multi-objective optimizers using the TP + PLS framework N. Krasnogor, P.L. Lanzi, Proceedings of GECCO 2011 2011 ACM Press 2019 2026
24. A.E. Eiben, Z. Michalewicz, M. Schoenauer, and J.E. Smith Parameter control in evolutionary algorithms F. Lobo, Parameter setting in evolutionary algorithms 2007 Springer 19 46
25. A.E. Eiben, and S.K. Smit Parameter tuning for configuring and analyzing evolutionary algorithms Swarm and Evolutionary Computation 10 1 2011 19 31
26. C.M. Fonseca, L. Paquete, and M. López-Ibáñez An improved dimension-sweep algorithm for the hypervolume indicator Proceedings of the 2006 congress on evolutionary computation (CEC 2006) 2006 IEEE Press Piscataway, NJ 1157 1163
27. M. Gagliolo, and C. Legrand Algorithm survival analysis T. Bartz-Beielstein, Experimental methods for the analysis of optimization algorithms 2010 Springer 161 184
28. V. Grunert da Fonseca, and C.M. Fonseca The attainment-function approach to stochastic multiobjective optimizer assessment and comparison T. Bartz-Beielstein, Experimental methods for the analysis of optimization algorithms 2010 Springer 103 130
29. H.H. Hoos Programming by optimization Communications of the ACM 550 2 2012 0 70 80
30. H.H. Hoos, and T. Stützle Stochastic local search - Foundations and applications 2005 Morgan Kaufman Publishers San Francisco, CA
31. F. Hutter, H.H. Hoos, and K. Leyton-Brown Sequential model-based optimization for general algorithm configuration Learning and intelligent optimization, 5th international conference, LION 5 LNCS 2011 Springer
32. F. Hutter, H.H. Hoos, K. Leyton-Brown, and T. Stützle ParamILS: An automatic algorithm configuration framework Journal of Artificial Intelligence Research 36 2009 267 306
33. Johnson, D. S., McGeoch, L. A., Rego, C., & Glover, F. (2001). 8th DIMACS implementation challenge. http://www.research.att.com/dsj/chtsp/.
34. 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
35. Knowles, J. D. (2005). A summary-attainment-surface palotting method for visualizing the performance of stochastic multiobjective optimizers. In Proceedings of the 5th international conference on intelligent systems design and applications (pp. 552-557).
36. Knowles, J. D., Thiele, L., & Zitzler, E. (2006). A tutorial on the performance assessment of stochastive multiobjective optimizers. TIK-Report 214, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH), Zürich, Switzerland, February 2006. Revised version.
37. K. Leyton-Brown, M. Pearson, and Y. Shoham Towards a universal test suite for combinatorial auction algorithms A. Jhingran, ACM conference on electronic commerce (EC-00) 2000 ACM Press New York, NY 66 76
38. López-Ibáñez, M. & Stützle, T. (2012a). Automatically improving the anytime behaviour of optimisation algorithms. Technical Report TR/IRIDIA/2012-012, IRIDIA, Université Libre de Bruxelles, Belgium.
39. López-Ibáñez, M. & Stützle, T. (2012b). Automatically improving the anytime behaviour of optimisation algorithms: Supplementary material. http://iridia.ulb.ac.be/supp/IridiaSupp2012-011/.
40. López-Ibáñez, M., Dubois-Lacoste, J., Stützle, T., & Birattari M. (2011). The irace package, iterated race for automatic algorithm configuration. Technical Report TR/IRIDIA/2011-004, IRIDIA, Université Libre de Bruxelles, Belgium.
41. M. López-Ibáñez, T. Liao, and T. Stützle On the anytime behavior of IPOP-CMA-ES C.A. Coello Coello, PPSN 2012, Part I LNCS Vol. 7491 2012 Springer 357 366
42. M. López-Ibáñez, L. Paquete, and T. Stützle Exploratory analysis of stochastic local search algorithms in biobjective optimization T. Bartz-Beielstein, Experimental methods for the analysis of optimization algorithms 2010 Springer 209 222
43. M. López-Ibáñez, and T. Stützle Automatic configuration of multi-objective ACO algorithms M. Dorigo, Swarm intelligence, 7th international conference, ANTS 2010 LNCS Vol. 6234 2010 Springer 95 106
44. M. López-Ibáñez, and T. Stützle The automatic design of multi-objective ant colony optimization algorithms IEEE Transactions on Evolutionary Computation 160 6 2012 0 861 875
45. S. Loudni, and P. Boizumault Combining VNS with constraint programming for solving anytime optimization problems European Journal of Operational Research 191 2008 705 735
46. O. Maron, and A.W. Moore The racing algorithm: Model selection for lazy learners Artificial Intelligence Research 110 1-5 1997 193 225
47. M. Maur, M. López-Ibáñez, and T. Stützle Pre-scheduled and adaptive parameter variation in MAX-MIN Ant System H. Ishibuchi, Proceedings of the 2010 congress on evolutionary computation (CEC 2010) 2010 IEEE Press 3823 3830
48. M.A. Montes de Oca, T. Stützle, M. Birattari, and M. Dorigo Frankenstein's PSO: A composite particle swarm optimization algorithm IEEE Transactions on Evolutionary Computation 130 5 2009 1120 1132
49. 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 183 190
50. A. Radulescu, M. López-Ibáñez, and T. Stützle Automatically improving the anytime behaviour of multiobjective evolutionary algorithms R.C. Purshouse, EMO 2013 LNCS Vol. 7811 2013 Springer 825 840
51. Stützle, T. (1997). MAX-MIN Ant System for the quadratic assignment problem. Technical Report AIDA-97-4, FG Intellektik, FB Informatik, TU Darmstadt, Germany, July 1997.
52. Stützle T. (2002). ACOTSP: A software package of various ant colony optimization algorithms applied to the symmetric traveling salesman problem. http://www.aco-metaheuristic.org/aco-code/.
53. T. Stützle, and H.H. Hoos MAX-MIN ant system Future Generation Computer Systems 160 8 2000 889 914
54. T. Stützle, M. López-Ibáñez, P. Pellegrini, M. Maur, M.A. Montes de Oca, and M. Birattari et al. Parameter adaptation in ant colony optimization Y. Hamadi, E. Monfroy, F. Saubion, Autonomous search 2012 Springer Berlin, Germany 191 215
55. B.W. Wah, and Y.X. Chen Optimal anytime constrained simulated annealing for constrained global optimization R. Dechter, Principles and practice of constraint programming, CP 2000 LNCS Vol. 1894 2000 Springer 425 440
56. S. Wessing, N. Beume, G. Rudolph, and B. Naujoks Parameter tuning boosts performance of variation operators in multiobjective optimization R. Schaefer, Parallel problem solving from nature XI LNCS Vol. 6238 2010 Springer 728 737
57. D.L. Woodruff, U. Ritzinger, and J. Oppen Research note: the point of diminishing returns in heuristic search International Journal of Metaheuristics 10 3 2011 0 222 231
58. S. Zilberstein Using anytime algorithms in intelligent systems AI Magazine 170 3 1996 0 73 83
59. E. Zitzler, D. Brockhoff, and L. Thiele The hypervolume indicator revisited: On the design of Pareto-compliant indicators via weighted integration S. Obayashi, EMO 2007 LNCS Vol. 4403 2007 Springer 862 876
60. E. Zitzler, and L. Thiele Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto evolutionary algorithm IEEE Transactions on Evolutionary Computation 30 4 1999 0 257 271
61. E. Zitzler, L. Thiele, M. Laumanns, C.M. Fonseca, and V. Grunert da Fonseca Performance assessment of multiobjective optimizers: an analysis and review IEEE Transactions on Evolutionary Computation 70 2 2003 0 117 132