The Cuckoo Search algorithm for Demand Side Management (DSM) proceeds in the following steps: (1) Initialization: Generate initial nests, each representing a DSM schedule. (2) Fitness Evaluation: Calculate the fitness of each nest based on the peak load (Dpeak) for its DSM schedule. (3) Loop Until Convergence: For each generation, generate a new solution (Xi) using Lévy flights for a randomly chosen cuckoo, choose a nest randomly and compare its fitness with (Xi), apply a discovery rate (Pa) to determine if eggs are discovered (if discovered, the nest is abandoned and a new one is built), retain the best nests and perform local searches, abandon a fraction (Pa) of worse nests and build new ones via Lévy flights, rank the nests to find the best, and terminate if maximum generations or convergence criteria are met.

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 (2)

• peak load concept
• Cuckoo Search concept