The Bat Algorithm for Demand Side Management follows this procedure: 1: Initialize the bat population Xi and velocities vi for i = 1 to N. 2: Define Pulse frequency fi at xi. 3: Initialize pulse rates ri and the loudness Ai. 4: While (t < Itermax) or (convergence criteria is not met) do. 5: for each bat i = 1 to N do. 6: Generate new solutions by adjusting frequency, and updating velocities and positions. 7: if (rand > ri) then. 8: Select a solution among the best solutions. 9: Generate a local solution around the selected best solution. 10: end if. 11: Generate a new solution by flying randomly. 12: if (rand < Ai && f(Xi) < f(X*)) then. 13: Accept the new solution. 14: Increase ri and reduce Ai. 15: end if. 16: Rank the bats and find the current best X*. 17: end for. 18: t = t + 1. 19: end while.

Authors

• Person: Not available Organization: PLOS ONE
  Demand side management using optimization strategies for efficient ...

Sources

• Demand side management using optimization strategies for efficient ... journals.plos.org PLOS ONE via serper

Referenced by nodes (1)

• bat algorithm concept