Skip to main content
Erschienen in: Memetic Computing 3/2015

01.09.2015 | Regular Research Paper

On composing an algorithm portfolio

verfasst von: Shiu Yin Yuen, Xin Zhang

Erschienen in: Memetic Computing | Ausgabe 3/2015

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Evolutionary algorithms are versatile optimization techniques inspired by processes in nature. So far, a wide variety of algorithms have been suggested. However, there is relatively little effort on studying how individual algorithms can work together in a portfolio to achieve a synergy. In this paper, we propose a general methodology to automatically compose a good portfolio from a set of selected evolutionary algorithms. As a single algorithm is a degenerate portfolio, our method also provides an answer to when a portfolio of two or more algorithms are beneficial. Our method has the nice property of being parameter-less; it does not introduce extra parameters. Hence there is no need for parameter control. To illustrate our ideas, we show how a portfolio of five state of the art evolutionary algorithms is automatically constructed using the test functions from the special session on real-parameter optimization of Congress on Evolutionary Computation 2005. It is found that the resulting portfolio obtains the best average ranking. The applicability and limitations of the paradigm of using a benchmarking suite to access evolutionary algorithms are also examined. Though this paper has used evolutionary algorithms only to compose an algorithm portfolio, the idea is generic and is applicable to portfolios with non-evolutionary algorithms as well.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
1.
Zurück zum Zitat Engelbrecht AP (2007) Computational intelligence, an introduction, 2nd edn. Wiley, New JerseyCrossRef Engelbrecht AP (2007) Computational intelligence, an introduction, 2nd edn. Wiley, New JerseyCrossRef
2.
Zurück zum Zitat Brownlee J (2011) Clever algorithms: nature-inspired programming pecipes, 1st edn. Lulu Enterprises, Australia Brownlee J (2011) Clever algorithms: nature-inspired programming pecipes, 1st edn. Lulu Enterprises, Australia
3.
Zurück zum Zitat Lam AYS, Li VOK (2012) Real-coded chemical reaction optimization. IEEE Trans Evol Comput 16:339–353CrossRef Lam AYS, Li VOK (2012) Real-coded chemical reaction optimization. IEEE Trans Evol Comput 16:339–353CrossRef
4.
Zurück zum Zitat Taha HA (1997) Operations research: an introduction, 6th edn. Prentice Hall, New JerseyMATH Taha HA (1997) Operations research: an introduction, 6th edn. Prentice Hall, New JerseyMATH
5.
Zurück zum Zitat Nguyen QH, Ong Y-S, Lim MH (2009) A probabilistic memetic framework. IEEE Trans Evol Comput 13:604–623CrossRef Nguyen QH, Ong Y-S, Lim MH (2009) A probabilistic memetic framework. IEEE Trans Evol Comput 13:604–623CrossRef
6.
Zurück zum Zitat Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1:67–82CrossRef Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1:67–82CrossRef
7.
8.
Zurück zum Zitat Vrugt JA, Robinson BA (2007) Improved evolutionary optimization from genetically adaptive multimethod search. Proc Natl Acad Sci 104:708–711CrossRef Vrugt JA, Robinson BA (2007) Improved evolutionary optimization from genetically adaptive multimethod search. Proc Natl Acad Sci 104:708–711CrossRef
9.
Zurück zum Zitat Krasnogor N, Smith J (2005) A tutorial for competent memetic algorithms: model, taxonomy and design issues. IEEE Transs Evol Comput 9:474–488CrossRef Krasnogor N, Smith J (2005) A tutorial for competent memetic algorithms: model, taxonomy and design issues. IEEE Transs Evol Comput 9:474–488CrossRef
10.
Zurück zum Zitat Munoz MA, Kirley M, Halgamuge SK (2013) The algorithm selection problem on the continuous optimization domain. In: Moewes C, Nurnberger A (eds) Computational intelligence in intelligent data analysis, SCI 445. Springer, Heidelberg, pp 75–89CrossRef Munoz MA, Kirley M, Halgamuge SK (2013) The algorithm selection problem on the continuous optimization domain. In: Moewes C, Nurnberger A (eds) Computational intelligence in intelligent data analysis, SCI 445. Springer, Heidelberg, pp 75–89CrossRef
12.
Zurück zum Zitat Dietterich TG (2000) Ensemble methods in machine learning, vol 1857., Lecture notes in computer scienceSpringer, Heidelberg Dietterich TG (2000) Ensemble methods in machine learning, vol 1857., Lecture notes in computer scienceSpringer, Heidelberg
13.
Zurück zum Zitat Burke EK, Gendreau M, Hyde M, Kendall G, Ochoa G, Ozcan E, Qu R (2013) Hyper-heuristics: a survey of the state of the art. J Oper Res Soc 64:1695–1724CrossRef Burke EK, Gendreau M, Hyde M, Kendall G, Ochoa G, Ozcan E, Qu R (2013) Hyper-heuristics: a survey of the state of the art. J Oper Res Soc 64:1695–1724CrossRef
14.
Zurück zum Zitat Qin AK, Huang VL, Suganthan PN (2009) Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans Evol Comput 13:398–417CrossRef Qin AK, Huang VL, Suganthan PN (2009) Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans Evol Comput 13:398–417CrossRef
15.
Zurück zum Zitat Mallipeddi R, Suganthan PN, Pan QK, Tasgetiren MF (2011) Differential evolution algorithm with ensemble of parameters and mutation strategies. Appl Soft Comput 11:1679–1696CrossRef Mallipeddi R, Suganthan PN, Pan QK, Tasgetiren MF (2011) Differential evolution algorithm with ensemble of parameters and mutation strategies. Appl Soft Comput 11:1679–1696CrossRef
16.
Zurück zum Zitat Du W, Li B (2008) Multi-strategy ensemble particle swarm optimization for dynamic optimization. Inf Sci 178:3096–3109CrossRefMATH Du W, Li B (2008) Multi-strategy ensemble particle swarm optimization for dynamic optimization. Inf Sci 178:3096–3109CrossRefMATH
17.
Zurück zum Zitat Vrugt JA, Robinson BA, Hyman JM (2009) Self-adaptive multimethod search for global optimization in real-parameter spaces. IEEE Trans Evol Comput 13:243–259CrossRef Vrugt JA, Robinson BA, Hyman JM (2009) Self-adaptive multimethod search for global optimization in real-parameter spaces. IEEE Trans Evol Comput 13:243–259CrossRef
18.
Zurück zum Zitat Peng F, Tang K, Chen G, Yao X (2010) Population-based algorithm portfolios for numerical optimization. IEEE Trans Evol Comput 14:782–800CrossRef Peng F, Tang K, Chen G, Yao X (2010) Population-based algorithm portfolios for numerical optimization. IEEE Trans Evol Comput 14:782–800CrossRef
19.
Zurück zum Zitat Wang Y, Li B (2010) Multi-strategy ensemble evolutionary algorithm for dynamic multi-objective optimization. Memetic Comput 2:3–24CrossRefMATH Wang Y, Li B (2010) Multi-strategy ensemble evolutionary algorithm for dynamic multi-objective optimization. Memetic Comput 2:3–24CrossRefMATH
20.
Zurück zum Zitat Grobler J, Engelbrecht AP, Kendall G, Yadavalli VSS (2013) Multi-method algorithms: investigating the entity-to-algorithm allocation problem. In: Proc. IEEE congress on evolutionary computation. IEEE Press, New York, pp 570–577 Grobler J, Engelbrecht AP, Kendall G, Yadavalli VSS (2013) Multi-method algorithms: investigating the entity-to-algorithm allocation problem. In: Proc. IEEE congress on evolutionary computation. IEEE Press, New York, pp 570–577
21.
Zurück zum Zitat Hadka D, Reed P (2013) Borg: an auto-adaptive many-objective evolutionary computing framework. Evol Comput 21:231–259CrossRef Hadka D, Reed P (2013) Borg: an auto-adaptive many-objective evolutionary computing framework. Evol Comput 21:231–259CrossRef
22.
Zurück zum Zitat Li K, Fialho A, Kwong S, Zhang Q (2014) Adaptive operator selection with bandits for a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 18:114–130CrossRef Li K, Fialho A, Kwong S, Zhang Q (2014) Adaptive operator selection with bandits for a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 18:114–130CrossRef
25.
Zurück zum Zitat Das S, Suganthan PN (2011) Differential evolution: a survey of the state-of-the-art. IEEE Trans Evol Comput 15:4–31CrossRef Das S, Suganthan PN (2011) Differential evolution: a survey of the state-of-the-art. IEEE Trans Evol Comput 15:4–31CrossRef
26.
Zurück zum Zitat Wang Y, Cai Z, Zhang Q (2011) Differential evolution with composite trial vector generation strategies and control parameters. IEEE Trans Evol Comput 15:55–66CrossRef Wang Y, Cai Z, Zhang Q (2011) Differential evolution with composite trial vector generation strategies and control parameters. IEEE Trans Evol Comput 15:55–66CrossRef
28.
Zurück zum Zitat Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39:459–471MathSciNetCrossRefMATH Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39:459–471MathSciNetCrossRefMATH
29.
Zurück zum Zitat Yuen SY, Chow CK, Zhang X (2013) Which algorithm should I choose at any point of the search: an evolutionary portfolio approach. In: Proc. of the 14th Int. Conf. on Genetic and Evol. Comput. Conf (GECCO). ACM, New York, pp 567–574 Yuen SY, Chow CK, Zhang X (2013) Which algorithm should I choose at any point of the search: an evolutionary portfolio approach. In: Proc. of the 14th Int. Conf. on Genetic and Evol. Comput. Conf (GECCO). ACM, New York, pp 567–574
30.
Zurück zum Zitat Lobo FJ, Lima CF, Michalewicz Z (2007) Parameter setting in evolutionary algorithms. Springer, Berlin Lobo FJ, Lima CF, Michalewicz Z (2007) Parameter setting in evolutionary algorithms. Springer, Berlin
31.
Zurück zum Zitat Yuen SY, Zhang X (2013) On Composing an (evolutionary) algorithm portfolio. In: Proc. of the 14th Int. Conf. on Genetic and Evol. Comput. Conf (GECCO). ACM, New York, pp 83–84 Yuen SY, Zhang X (2013) On Composing an (evolutionary) algorithm portfolio. In: Proc. of the 14th Int. Conf. on Genetic and Evol. Comput. Conf (GECCO). ACM, New York, pp 83–84
32.
Zurück zum Zitat Suganthan PN, Hansen N, Liang JJ, Deb K, Chen YP, Auger A, Tiwari S (2005) Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-parameter Optimization”, Nanyang Technol. Univ. and IIT Kanpur, Singapore and Kanpur, India, Tech. Rep. 2005005 Suganthan PN, Hansen N, Liang JJ, Deb K, Chen YP, Auger A, Tiwari S (2005) Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-parameter Optimization”, Nanyang Technol. Univ. and IIT Kanpur, Singapore and Kanpur, India, Tech. Rep. 2005005
33.
Zurück zum Zitat Garcia S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour a case study on the CEC’2005 special session on real parameter optimization. J Heuristics 15:617–644CrossRefMATH Garcia S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour a case study on the CEC’2005 special session on real parameter optimization. J Heuristics 15:617–644CrossRefMATH
34.
Zurück zum Zitat Mann HB, Whitney DR (1947) On a test of whether one of two random variables is stochastically larger than the other. Ann Math Stat 18:50–60MathSciNetCrossRefMATH Mann HB, Whitney DR (1947) On a test of whether one of two random variables is stochastically larger than the other. Ann Math Stat 18:50–60MathSciNetCrossRefMATH
35.
Zurück zum Zitat Dowold K, Aderhold A, Scheidler A, Middendorf M (2011) Performance evaluation of artificial bee colony optimization and new selection schemes. Memetic Comput 3:149–162CrossRef Dowold K, Aderhold A, Scheidler A, Middendorf M (2011) Performance evaluation of artificial bee colony optimization and new selection schemes. Memetic Comput 3:149–162CrossRef
36.
Zurück zum Zitat Sörensen K (2015) Metaheuristics—the metaphor exposed. Int Trans Oper Res 22:3–18 Sörensen K (2015) Metaheuristics—the metaphor exposed. Int Trans Oper Res 22:3–18
37.
Zurück zum Zitat Liang JJ, Qu B-Y, Suganthan PN, Hernández-Díaz AG (2013) Problem definitions and evaluation criteria for the CEC 2013 special session and competition on real-parameter optimization. Technical report, Nanyang Technological University, Singapore Liang JJ, Qu B-Y, Suganthan PN, Hernández-Díaz AG (2013) Problem definitions and evaluation criteria for the CEC 2013 special session and competition on real-parameter optimization. Technical report, Nanyang Technological University, Singapore
38.
Zurück zum Zitat Tang K, Peng F, Chen G, Yao X (2014) Population-based algorithm portfolios with automated constituent algorithms selection. Inf Sci 279:94–104CrossRef Tang K, Peng F, Chen G, Yao X (2014) Population-based algorithm portfolios with automated constituent algorithms selection. Inf Sci 279:94–104CrossRef
Metadaten
Titel
On composing an algorithm portfolio
verfasst von
Shiu Yin Yuen
Xin Zhang
Publikationsdatum
01.09.2015
Verlag
Springer Berlin Heidelberg
Erschienen in
Memetic Computing / Ausgabe 3/2015
Print ISSN: 1865-9284
Elektronische ISSN: 1865-9292
DOI
https://doi.org/10.1007/s12293-015-0159-9

Weitere Artikel der Ausgabe 3/2015

Memetic Computing 3/2015 Zur Ausgabe

Editorial

Editorial