Skip to main content

2016 | OriginalPaper | Buchkapitel

Parallel Algorithm Portfolio with Market Trading-Based Time Allocation

verfasst von : Dimitris Souravlias, Konstantinos E. Parsopoulos, Enrique Alba

Erschienen in: Operations Research Proceedings 2014

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

We propose a parallel portfolio of metaheuristic algorithms that adopts a market trading-based time allocation mechanism. This mechanism dynamically allocates the total available execution time of the portfolio by favoring better-performing algorithms. The proposed approach is assessed on a significant Operations Research problem, namely the single-item lot sizing problem with returns and remanufacturing. Experimental evidence suggests that our approach is highly competitive with standard metaheuristics and specialized state-of-the-art algorithms.

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 "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!

Literatur
1.
Zurück zum Zitat Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In Proceedings Sixth Symposium on Micro Machine and Human Science, pp. 39–43, Piscataway, NJ (1995) Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In Proceedings Sixth Symposium on Micro Machine and Human Science, pp. 39–43, Piscataway, NJ (1995)
2.
Zurück zum Zitat Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533–549 (1986)CrossRef Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533–549 (1986)CrossRef
3.
Zurück zum Zitat Gomes, C.P., Selman, B.: Algorithm portfolio design: theory vs. practice. In: Proceedings Thirteenth conference on Uncertainty in artificial intelligence, pp. 190–197 (1997) Gomes, C.P., Selman, B.: Algorithm portfolio design: theory vs. practice. In: Proceedings Thirteenth conference on Uncertainty in artificial intelligence, pp. 190–197 (1997)
4.
Zurück zum Zitat Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Science 27, 51–53 (1997)CrossRef Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Science 27, 51–53 (1997)CrossRef
5.
Zurück zum Zitat Lourenco, H.R.: Job-shop scheduling: computational study of local search and large-step optimization methods. Eur. J. Oper. Res. 83(2), 347–364 (1995)CrossRef Lourenco, H.R.: Job-shop scheduling: computational study of local search and large-step optimization methods. Eur. J. Oper. Res. 83(2), 347–364 (1995)CrossRef
6.
Zurück zum Zitat Moustaki, E., Parsopoulos, K.E., Konstantaras, I., Skouri, K., Ganas, I.: A first study of particle swarm optimization on the dynamic lot sizing problem with product returns. In: Proceedings BALCOR 2013, pp. 348–356 (2013) Moustaki, E., Parsopoulos, K.E., Konstantaras, I., Skouri, K., Ganas, I.: A first study of particle swarm optimization on the dynamic lot sizing problem with product returns. In: Proceedings BALCOR 2013, pp. 348–356 (2013)
7.
Zurück zum Zitat Peng, F., Tang, K., Chen, G., Yao, X.: Population-based algorithm portfolios for numerical optimization. IEEE Trans. Evol. Comput. 14(5), 782–800 (2010)CrossRef Peng, F., Tang, K., Chen, G., Yao, X.: Population-based algorithm portfolios for numerical optimization. IEEE Trans. Evol. Comput. 14(5), 782–800 (2010)CrossRef
8.
Zurück zum Zitat Price, K.: Differential evolution: a fast and simple numerical optimizer. In: Proceedings NAFIPS’96, pp. 524–525 (1996) Price, K.: Differential evolution: a fast and simple numerical optimizer. In: Proceedings NAFIPS’96, pp. 524–525 (1996)
9.
Zurück zum Zitat Schulz, T.: A new silver-meal based heuristic for the single-item dynamic lot sizing problem with returns and remanufacturing. Int. J. Prod. Res. 49(9), 2519–2533 (2011)CrossRef Schulz, T.: A new silver-meal based heuristic for the single-item dynamic lot sizing problem with returns and remanufacturing. Int. J. Prod. Res. 49(9), 2519–2533 (2011)CrossRef
10.
Zurück zum Zitat Shukla, N., Dashora, Y., Tiwari, M., Chan, F., Wong, T.: Introducing algorithm portfolios to a class of vehicle routing and scheduling problem. In: Proceedings OSCM 2007, pp. 1015–1026 (2007) Shukla, N., Dashora, Y., Tiwari, M., Chan, F., Wong, T.: Introducing algorithm portfolios to a class of vehicle routing and scheduling problem. In: Proceedings OSCM 2007, pp. 1015–1026 (2007)
11.
Zurück zum Zitat Tang, K., Peng, F., Chen, G., Yao, X.: Population-based algorithm portfolios with automated constituent algorithms selection. Inf. Sci. 279, 94–104 (2014)CrossRef Tang, K., Peng, F., Chen, G., Yao, X.: Population-based algorithm portfolios with automated constituent algorithms selection. Inf. Sci. 279, 94–104 (2014)CrossRef
12.
Zurück zum Zitat Teunter, R.H., Bayindir, Z.P., Van den Heuvel, W.: Dynamic lot sizing with product returns and remanufacturing. Int. J. Prod. Res. 44(20), 4377–4400 (2006)CrossRef Teunter, R.H., Bayindir, Z.P., Van den Heuvel, W.: Dynamic lot sizing with product returns and remanufacturing. Int. J. Prod. Res. 44(20), 4377–4400 (2006)CrossRef
13.
Zurück zum Zitat 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)CrossRef 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)CrossRef
14.
Zurück zum Zitat Wagner, H.M., Whitin, T.M.: Dynamic version of the economic lot size model. Manag. Sci. 5(1), 88–96 (1958)CrossRef Wagner, H.M., Whitin, T.M.: Dynamic version of the economic lot size model. Manag. Sci. 5(1), 88–96 (1958)CrossRef
Metadaten
Titel
Parallel Algorithm Portfolio with Market Trading-Based Time Allocation
verfasst von
Dimitris Souravlias
Konstantinos E. Parsopoulos
Enrique Alba
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-28697-6_79