Economic Dispatch by Water Cycle Algorithm

2. TITLE:
WATER CYCLE ALGORITHM

3. PRESENTATION FLOW
• Introduction to WCA
• Schematic Diagram of hydrologic Cycle
• Mathematical Formulation of WCA
• Schematic View of WCA
• Strength Comparison
University of Engineering & Technology 20/6/2018

4. Introduction to Water Cycle Algorithm
 Metaheuristic
 Nature Inspired based on water
Cycle

5. Schematic Diagram

6. Mathematical Formulation of WCA
Step 1: Choose the initial parameters of the WCA: Npop, Nsr, dmax, max_iteration.
Step 2: Generate random initial population and form the initial streams
(raindrops), rivers, and sea using the Equation
• Raindrop=[x1; x2; x3; . . . ; xN]
• Nsr:
• Nraindrop=Npop- Nsr
Step 3: Calculate the value (cost) of each raindrops using Equation
Step 4: Determine the intensity of flow for rivers and sea using

7. Step 5: The streams flow to the rivers by Equation
Step 6: The rivers flow to the sea which is the most downhill
place using Equation
Step 7: Exchange positions of river with a stream which gives
the best solution as shown in figure
Step 8: Similar to Step 7, if a river finds better solution than the
sea, the position of river is exchanged with the sea
Schematic view of stream’s flow to a
specific river

8. EVAPORATION:
Step 9: Check the evaporation condition using the Psuocode
Evaporation and raining process end
Step 10: If the evaporation condition is satisfied, the raining
process will occur using Eqs. (11) and (12).
Step 11: Reduce the value of dmax which is user defined parameter
using Equation
Step 12: Check the convergence criteria. If the stopping criterion is satisfied, the algorithm will be stopped,
otherwise return to Step 5

9. Schematic view of WCA

10. Strength of WCA in Contrast to Other Metaheuristic
• Rivers as “Guidance point”
• Resemblance to Mutation as in GA
Comparison of statistical results for various algorithms for constrained problem
Comparison of the best solution given by previous studies for constrained problem

11. Constrained problem