Skip to main content
SpringerLink
Log in

On the Design of Metaheuristics-Based Algorithm Portfolios

  • Chapter
  • First Online:
Open Problems in Optimization and Data Analysis

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 141))

Abstract

Metaheuristic optimization has been long established as a promising alternative to classical optimization approaches. However, the selection of a specific metaheuristic algorithm for solving a given problem constitutes an impactful decision. This can be attributed to possible performance fluctuations of the metaheuristic during its application either on a single problem or on different instances of a specific problem type. Algorithm portfolios offer an alternative where, instead of using a single solver, a number of different solvers or variants of one solver are concurrently or interchangeably used to tackle the problem at hand by sharing the available computational resources. The design of algorithm portfolios requires a number of decisions from the practitioner’s side. The present chapter exposes the essential open problems related to the design of algorithm portfolios, namely the selection of constituent algorithms, resource allocation schemes, interaction among the algorithms, and parallelism issues. Recent research trends relevant to these issues are presented, offering motivation for further elaboration.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 159.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Akay, R., Basturk, A., Kalinli, A., Yao, X.: Parallel population-based algorithm portfolios. Neurocomputing 247, 115–125 (2017)

    Article  Google Scholar 

  2. Almakhlafi, A., Knowles, J.: Systematic construction of algorithm portfolios for a maintenance scheduling problem. In: IEEE Congress on Evolutionary Computation, Cancun, Mexico, pp. 245–252 (2013)

    Google Scholar 

  3. Boussaïd, I., Lepagnot, J., Siarry, P.: A survey on optimization metaheuristics. Inf. Sci. 237, 82–117 (2013)

    Article  MathSciNet  Google Scholar 

  4. Calderín, J.F., Masegosa, A.D., Pelta, D.A.: An algorithm portfolio for the dynamic maximal covering location problem. Memetic Comput. 9(2), 141–151 (2017)

    Article  Google Scholar 

  5. Gomes, C.P., Selman, B.: Algorithm portfolios. Artif. Intell. 126(1), 43–62 (2001)

    Article  MathSciNet  Google Scholar 

  6. Hart, E., Sim, K.: On constructing ensembles for combinatorial optimisation. Evol. Comput. 26(1), 67–87 (2018)

    Article  Google Scholar 

  7. Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Science 275(5296), 51–54 (1997)

    Article  Google Scholar 

  8. Mun̈oz, M.A., Kirley, M.: Icarus: identification of complementary algorithms by uncovered sets. In: IEEE Congress on Evolutionary Computation (CEC), Vancouver, BC, Canada, pp. 2427–2432 (2016)

    Google Scholar 

  9. Peng, F., Tang, K., Chen, G., Yao, X.: Population-based algorithm portfolios for numerical optimization. IEEE Trans. Evol. Comput. 14(5), 782–800 (2010)

    Article  Google Scholar 

  10. Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65–118 (1976)

    Article  Google Scholar 

  11. Shukla, N., Dashora, Y., Tiwari, M., Chan, F., Wong, T.: Introducing algorithm portfolios to a class of vehicle routing and scheduling problem. In: 2nd International Conference on Operations and Supply Chain Management (OSCM), Bangkok, Thailand, pp. 1015–1026 (2007) In: Proceedings OSCM 2007, pp. 1015–1026 (2007)

    Google Scholar 

  12. Souravlias, D., Parsopoulos, K.E., Alba, E.: Parallel algorithm portfolio with market trading-based time allocation. In: Lübbecke, M., Koster, A., Letmathe, P., Madlener, R., Peis, B., Walther, G. (eds.) Operations Research Proceedings 2014, pp. 567–574. Springer, Berlin (2016)

    Chapter  Google Scholar 

  13. Souravlias, D., Parsopoulos, K.E., Kotsireas, I.S.: Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics. Optim. Lett. 10(6), 1303–1314 (2016)

    Article  MathSciNet  Google Scholar 

  14. Souravlias, D., Parsopoulos, K.E., Meletiou, G.C.: Designing Bijective S-boxes using algorithm portfolios with limited time budgets. Appl. Soft Comput. 59, 475–486 (2017)

    Article  Google Scholar 

  15. Tang, K., Peng, F., Chen, G., Yao, X.: Population-based algorithm portfolios with automated constituent algorithms selection. Inf. Sci. 279, 94–104 (2014)

    Article  Google Scholar 

  16. Vrugt, J.A., Robinson, B.A., Hyman, J.M.: Self-adaptive multimethod search for global optimization in real-parameter spaces. IEEE Trans. Evol. Comput. 13(2), 243–259 (2009)

    Article  Google Scholar 

  17. Wolpert, D.H., Macready, W.G.: No free lunch theorem for optimization. IEEE Trans. Evol. Comput. 1, 67–82 (1997)

    Article  Google Scholar 

  18. Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla-07: the design and analysis of an algorithm portfolio for SAT. In: International Conference on Principles and Practice of Constraint Programming, Providence, RI, USA, pp. 712–727 (2007)

    Google Scholar 

  19. Yuen, S.Y., Chow, C.K., Zhang, X., Lou, Y.: Which algorithm should I choose: An evolutionary algorithm portfolio approach. Appl. Soft Comput. 40, 654 – 673 (2016)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Logistics Management Department, Helmut-Schmidt University, Hamburg, Germany

    Dimitris Souravlias

  2. Department of Computer Science & Engineering, University of Ioannina, Ioannina, Greece

    Konstantinos E. Parsopoulos

Authors
  1. Dimitris Souravlias
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Konstantinos E. Parsopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dimitris Souravlias .

Editor information

Editors and Affiliations

  1. Industrial and Systems, Engineering Department, University of Florida, Center For Applied Optimization, Gainesville, FL, USA

    Panos M. Pardalos

  2. Industrial Logistics, ETS Institute, Lulea University of Technology, Norrbotten, Sweden

    Athanasios Migdalas

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Souravlias, D., Parsopoulos, K.E. (2018). On the Design of Metaheuristics-Based Algorithm Portfolios. In: Pardalos, P., Migdalas, A. (eds) Open Problems in Optimization and Data Analysis. Springer Optimization and Its Applications, vol 141. Springer, Cham. https://doi.org/10.1007/978-3-319-99142-9_14

Download citation

Publish with us

Policies and ethics

Search

Navigation