Skip to main content

2021 | OriginalPaper | Buchkapitel

23. A Two-Phase Heuristic Coupled DIRECT Method for Bound Constrained Global Optimization

verfasst von : M. Fernanda P. Costa, Edite M. G. P. Fernandes, Ana Maria A. C. Rocha

Erschienen in: Advances in Evolutionary and Deterministic Methods for Design, Optimization and Control in Engineering and Sciences

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

In this paper, we investigate the use of a simple heuristic in the DIRECT method context, aiming to select a set of the hyperrectangles that have the lowest function values in each size group. For solving bound constrained global optimization problems, the proposed heuristic divides the region where the hyperrectangles with the lowest function values in each size group lie into three subregions. From each subregion, different numbers of hyperrectangles are selected depending on the subregion they lie. Subsequently, from those selected hyperrectangles, the potentially optimal ones are identified for further division. Furthermore, the two-phase strategy aims to firstly encourage the global search and secondly enhance the local search. Global and local phases differ on the number of selected hyperrectangles from each subregion. The process is repeated until convergence. Numerical experiments carried out until now show that the proposed two-phase heuristic coupled DIRECT method is effective in converging to the optimal solution.

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!

Literatur
1.
Zurück zum Zitat Jones DR, Perttunen CD, Stuckman BE (1993) Lipschitzian optimization without the Lipschitz constant. J Optim Theory Appl 79(1):157–181MathSciNetCrossRef Jones DR, Perttunen CD, Stuckman BE (1993) Lipschitzian optimization without the Lipschitz constant. J Optim Theory Appl 79(1):157–181MathSciNetCrossRef
2.
Zurück zum Zitat Jones DR (2008) Direct global optimization algorithm. In: Floudas C, Pardalos P (eds) Encyclopedia of optimization. Springer, Boston MA, pp 431–440 Jones DR (2008) Direct global optimization algorithm. In: Floudas C, Pardalos P (eds) Encyclopedia of optimization. Springer, Boston MA, pp 431–440
3.
Zurück zum Zitat Liuzzi G, Lucidi S, Piccialli V (2010) A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems. Comput Optim Appl 45(1):353–375MathSciNetCrossRef Liuzzi G, Lucidi S, Piccialli V (2010) A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems. Comput Optim Appl 45(1):353–375MathSciNetCrossRef
4.
6.
Zurück zum Zitat Sergeyev YD, Kvasov DE (2006) Global search based on efficient diagonal partitions and a set of Lipschitz constants. SIAM J Optim 16(3):910–937MathSciNetCrossRef Sergeyev YD, Kvasov DE (2006) Global search based on efficient diagonal partitions and a set of Lipschitz constants. SIAM J Optim 16(3):910–937MathSciNetCrossRef
7.
Zurück zum Zitat Paulavičius R, Sergeyev YD, Kvasov DE et al (2014) Globally-biased DISIMPL algorithm for expensive global optimization. J Global Optim 59(2–3):545–567MathSciNetCrossRef Paulavičius R, Sergeyev YD, Kvasov DE et al (2014) Globally-biased DISIMPL algorithm for expensive global optimization. J Global Optim 59(2–3):545–567MathSciNetCrossRef
8.
Zurück zum Zitat Stripinis L, Paulavičius R, Žilinskas J (2018) Improved scheme for selection of potentially optimal hyper-rectangles in DIRECT. Optim Lett 12(7):1699–1712MathSciNetCrossRef Stripinis L, Paulavičius R, Žilinskas J (2018) Improved scheme for selection of potentially optimal hyper-rectangles in DIRECT. Optim Lett 12(7):1699–1712MathSciNetCrossRef
9.
10.
Zurück zum Zitat Paulavičius R, Žilinskas J (2014) Simplicial Lipschitz optimization without the Lipschitz constant. J Global Optim 59(1):23–40MathSciNetCrossRef Paulavičius R, Žilinskas J (2014) Simplicial Lipschitz optimization without the Lipschitz constant. J Global Optim 59(1):23–40MathSciNetCrossRef
12.
Zurück zum Zitat Liu Q, Zeng J, Yang G (2015) MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems. J Global Optim 62(2):205–227MathSciNetCrossRef Liu Q, Zeng J, Yang G (2015) MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems. J Global Optim 62(2):205–227MathSciNetCrossRef
13.
Zurück zum Zitat Liu H, Xu S, Chen X et al (2017) Constrained global optimization via a DIRECT-type constraint-handling technique and an adaptive metamodeling strategy. Struct Multi Optim 55(1):155–177MathSciNetCrossRef Liu H, Xu S, Chen X et al (2017) Constrained global optimization via a DIRECT-type constraint-handling technique and an adaptive metamodeling strategy. Struct Multi Optim 55(1):155–177MathSciNetCrossRef
14.
15.
Zurück zum Zitat Hedar A-R, Fukushima M (2006) Tabu search directed by direct search methods for nonlinear global optimization. Eur J Oper Res 170(2):329–349MathSciNetCrossRef Hedar A-R, Fukushima M (2006) Tabu search directed by direct search methods for nonlinear global optimization. Eur J Oper Res 170(2):329–349MathSciNetCrossRef
16.
Zurück zum Zitat Rocha AMAC, Costa MFP, Fernandes EMGP (2011) Mutation-based artificial fish swarm algorithm for bound constrained global optimization. AIP Conf Proc 1389:751–754CrossRef Rocha AMAC, Costa MFP, Fernandes EMGP (2011) Mutation-based artificial fish swarm algorithm for bound constrained global optimization. AIP Conf Proc 1389:751–754CrossRef
17.
Zurück zum Zitat Rocha AMAC, Costa MFP, Fernandes EMGP (2020) A population-based stochastic coordinate descent method. In: Le Thi H, Le H, Pham Dinh T (eds) Advances in intelligent systems and computing vol 991, Optimization of complex systems: theory, models, algorithms and applications. Springer, Berlin, pp 16–25 Rocha AMAC, Costa MFP, Fernandes EMGP (2020) A population-based stochastic coordinate descent method. In: Le Thi H, Le H, Pham Dinh T (eds) Advances in intelligent systems and computing vol 991, Optimization of complex systems: theory, models, algorithms and applications. Springer, Berlin, pp 16–25
19.
Zurück zum Zitat Ali MM, Khompatraporn C, Zabinsky ZB (2005) A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. J Global Optim 31(4):635–672MathSciNetCrossRef Ali MM, Khompatraporn C, Zabinsky ZB (2005) A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. J Global Optim 31(4):635–672MathSciNetCrossRef
Metadaten
Titel
A Two-Phase Heuristic Coupled DIRECT Method for Bound Constrained Global Optimization
verfasst von
M. Fernanda P. Costa
Edite M. G. P. Fernandes
Ana Maria A. C. Rocha
Copyright-Jahr
2021
DOI
https://doi.org/10.1007/978-3-030-57422-2_23