Skip to main content

A Novel Trigonometric Mutation-Based Backtracking Search Algorithm for Solving Optimal Power Flow Problem Considering Renewable Energy Sources

  • Conference paper
  • First Online:
Computational Intelligence in Communications and Business Analytics (CICBA 2023)

Abstract

Renewable energy sources (RESs)−based optimal power flow (OPF) problem that imposes a higher degree of uncertainty and nonlinearities into the solution process is a great concern for the power system researchers. In the present work, to improve the convergence rate of the orthodox backtracking search algorithm (BSA), a highly intelligent trigonometric mutation−based BSA (TMBSA) is proposed. The proposed technique is used to minimize highly non-linear, non-convex, and uncertainty-induced power generation costs for thermal power units along with highly intermittent wind energy (WE) and tidal energy (TDE). Further, the power generation cost objective is considered with the valve-point loading effect and prohibited operating zones (POZs) to make the research work more pragmatic. To confirm the superiority of the proposed technique, simulation work is performed on a RESs-based modified IEEE 30−bus test system, and the results are compared with the BSA. The result analysis clearly shows that the proposed TMBSA outperforms the BSA in terms of delivering more high−quality, accurate results with a faster convergence speed while solving the uncertainty−based OPF problem.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Trivedi, I.N., Jangir, P., Parmar, S.A., Jangir, N.: Optimal power flow with voltage stability improvement and loss reduction in power system using moth-flame optimizer. Neural Comput. Appl. 30(6), 1889–1904 (2018)

    Article  Google Scholar 

  2. Abbasi, M., Abbasi, E., Mohammadi-Ivatloo, B.: Single and multi-objective optimal power flow using a new differential-based harmony search algorithm. J. Ambient Intell. Humaniz. Comput. 12(1), 851–871 (2021)

    Article  Google Scholar 

  3. Duman, S., Wu, L., Li, J.: Moth swarm algorithm based approach for the ACOPF considering wind and tidal energy. In: Hemanth, D.J., Kose, U. (eds.) ICAIAME 2019. LNDECT, vol. 43, pp. 830–843. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-36178-5_72

    Chapter  Google Scholar 

  4. Kaymaz, E., Duman, S., Guvenc, U.: Optimal power flow solution with stochastic wind power using the Lévy coyote optimization algorithm. Neural Comput. Appl. 33(12), 6775–6804 (2021)

    Article  Google Scholar 

  5. Fernandes, I.G., Pereira, F.B., Gomes, T.L., Sá, B.F.: An optimal power flow approach including wind and tidal generation. In: IEEE PES Innovative Smart Grid Technologies Conference-Latin America (ISGT Latin America), pp. 1–6. IEEE (2019)

    Google Scholar 

  6. Warid, W.: Optimal power flow using the AMTPG-Jaya algorithm. Appl. Soft Comput. 91, 106252 (2020)

    Article  Google Scholar 

  7. Kaur, M., Narang, N.: An integrated optimization technique for optimal power flow solution. Soft Comput. 24, 10865–10882 (2020)

    Article  Google Scholar 

  8. Abusorrah, A.M.: The application of the linear adaptive genetic algorithm to optimal power flow problem. Arab. J. Sci. Eng. 39(6), 4901–4909 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  9. Akbari, E., Ghasemi, M., Gil, M., Rahimnejad, A., Andrew Gadsden, S.: Optimal power flow via teaching-learning-studying-based optimization algorithm. Electric Power Compon. Syst. 49(6–7), 584–601 (2022)

    Google Scholar 

  10. Civicioglu, P.: Backtracking search optimization algorithm for numerical optimization problems. Appl. Math. Comput. 219(15), 8121–8144 (2013)

    MathSciNet  MATH  Google Scholar 

  11. Zhao, W., Wang, L., Wang, B., Yin, Y.: Best guided backtracking search algorithm for numerical optimization problems. In: Lehner, F., Fteimi, N. (eds.) KSEM 2016. LNCS (LNAI), vol. 9983, pp. 414–425. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-47650-6_33

    Chapter  Google Scholar 

  12. Fan, H.Y., Lampinen, J.: A trigonometric mutation operation to differential evolution. J. Glob. Optim. 27(1), 105–129 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  13. Agwa, A.: Interior search optimization algorithm for modeling power curve of wind turbine. Int. J. Renew. Energy Res. (IJRER) 10(3), 1349–1358 (2020)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sriparna Banerjee .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Banerjee, S., Roy, P.K., Saha, P.K. (2024). A Novel Trigonometric Mutation-Based Backtracking Search Algorithm for Solving Optimal Power Flow Problem Considering Renewable Energy Sources. In: Dasgupta, K., Mukhopadhyay, S., Mandal, J.K., Dutta, P. (eds) Computational Intelligence in Communications and Business Analytics. CICBA 2023. Communications in Computer and Information Science, vol 1956. Springer, Cham. https://doi.org/10.1007/978-3-031-48879-5_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-48879-5_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-48878-8

  • Online ISBN: 978-3-031-48879-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics