Skip to main content
Erschienen in: International Journal of Energy and Environmental Engineering 4/2023

12.12.2022 | Original Research

Economic energy scheduling through chaotic gorilla troops optimizer

verfasst von: Ashutosh Bhadoria, Sanjay Marwaha

Erschienen in: International Journal of Energy and Environmental Engineering | Ausgabe 4/2023

Einloggen

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

search-config
loading …

Abstract

This research proposes a novel solution to the power generation scheduling problem based on the chaotic gorilla troop's optimizer algorithm (CGTO). Power system operational planning is a large-scale, highly constrained combinatorial optimization problem known as the Energy Generation Scheduling Problem. The Gorilla Troops optimizer is a bio-inspired heuristic optimizer that uses gorilla hierarchy and hunting notions to resolve challenging scheduling issues. The gorilla update method is initially obtain binary string of generators in order to determine the global best solution (s), which is followed by a chaotic operation. Chaotic search avoids local minima while GTO seeks out global optima, resulting in a better balance of exploitation and exploration. A simple and effective strategy for wind power integration placement and sizing is presented in this research. The messy behavior of the wind is predicted to follow the Weibull PDF. Examining the viability and effectiveness of units between 10 and 100, the results are compared to those attained using various techniques mentioned in the literature. The results unequivocally demonstrate that the recommended technique provides superior solutions than competing alternatives. The solution was improved further in the wind power sharing scenario. Convergence curve amply demonstrates the optimizer's robustness.

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!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
3.
Zurück zum Zitat Snyder, W.L., Powell, H.D., Rayburn, J.C.: Dynamic programming approach to unit commitment. IEEE Trans. Power Syst. 2, 339–347 (1987)CrossRef Snyder, W.L., Powell, H.D., Rayburn, J.C.: Dynamic programming approach to unit commitment. IEEE Trans. Power Syst. 2, 339–347 (1987)CrossRef
5.
Zurück zum Zitat Borghetti, A. et al.: Lagrangian relaxation and tabu search approaches for the unit commitment problem. IEEE Porto. Power Tech. Conf., (2001) Borghetti, A. et al.: Lagrangian relaxation and tabu search approaches for the unit commitment problem. IEEE Porto. Power Tech. Conf., (2001)
6.
Zurück zum Zitat Cohen, A.I., Yoshimura, M.: A branch-and-bound algorithm for unit commitment. IEEE Trans. Power Appar. Syst. 2, 444–451 (1983)CrossRef Cohen, A.I., Yoshimura, M.: A branch-and-bound algorithm for unit commitment. IEEE Trans. Power Appar. Syst. 2, 444–451 (1983)CrossRef
9.
Zurück zum Zitat Tseng, C.L., Li, C.A., Oren, S.S.: Solving the unit commitment problem by a unit decommitment method. J. Optimization Theory Appl. 105(3), 707–730 (2000)MathSciNetCrossRefMATH Tseng, C.L., Li, C.A., Oren, S.S.: Solving the unit commitment problem by a unit decommitment method. J. Optimization Theory Appl. 105(3), 707–730 (2000)MathSciNetCrossRefMATH
12.
Zurück zum Zitat Senjyu, T., Yamashiro, H., Shimabukuro, K., and Uezato, K., Unit commitment problem using genetic algorithm, pp. 1611–1616, (2002) Senjyu, T., Yamashiro, H., Shimabukuro, K., and Uezato, K., Unit commitment problem using genetic algorithm, pp. 1611–1616, (2002)
14.
Zurück zum Zitat Rajan, C.C.A. and Mohan, M.R., An evolutionary programming-based tabu search method for solving the unit commitment problem, vol. 19, no. 1, pp. 577–585, (2004) Rajan, C.C.A. and Mohan, M.R., An evolutionary programming-based tabu search method for solving the unit commitment problem, vol. 19, no. 1, pp. 577–585, (2004)
22.
Zurück zum Zitat Bhadoria, A., Marwaha, S., and Kamboj, V. K., BMFO-SIG: A novel binary moth flame optimizer algorithm with sigmoidal transformation for combinatorial unit commitment and numerical optimization problems, vol. 5, no. 4. Springer Singapore, (2020) Bhadoria, A., Marwaha, S., and Kamboj, V. K., BMFO-SIG: A novel binary moth flame optimizer algorithm with sigmoidal transformation for combinatorial unit commitment and numerical optimization problems, vol. 5, no. 4. Springer Singapore, (2020)
29.
35.
Zurück zum Zitat Simopoulos, D.N., Kavatza, S.D., Vournas, C.D.: Unit commitment by an enhanced simulated annealing algorithm. IEEE Trans. Power Syst. 21(1), 68–76 (2006)CrossRef Simopoulos, D.N., Kavatza, S.D., Vournas, C.D.: Unit commitment by an enhanced simulated annealing algorithm. IEEE Trans. Power Syst. 21(1), 68–76 (2006)CrossRef
Metadaten
Titel
Economic energy scheduling through chaotic gorilla troops optimizer
verfasst von
Ashutosh Bhadoria
Sanjay Marwaha
Publikationsdatum
12.12.2022
Verlag
Springer Berlin Heidelberg
Erschienen in
International Journal of Energy and Environmental Engineering / Ausgabe 4/2023
Print ISSN: 2008-9163
Elektronische ISSN: 2251-6832
DOI
https://doi.org/10.1007/s40095-022-00550-0

Weitere Artikel der Ausgabe 4/2023

International Journal of Energy and Environmental Engineering 4/2023 Zur Ausgabe