Skip to main content

Posts

Showing posts from November, 2023

How to find the flood hydrograph from Unit Hydrograph?

The problem is : The ordinates of the unit hydrograph are given, the duration and rainfall depth of storm/precipitation are given, phi index and baseflow are provided. Find the ordinates of the Flood Hydrograph. Solution ?? Visit my page for the answer at 9pm today by clicking the link below : https://open.substack.com/pub/hydrogeek/p/solved-problem-on-derivation-of-flood?r=c8bxy&utm_campaign=post&utm_medium=web You may also like : HydroGeek: The newsletter for researchers of water resources https://hydrogeek.substack.com/ Baipatra VSC: Enroll for online courses for Free http://baipatra.ws Energy in Style: Participate in Online Internships for Free http://energyinstyle.website Innovate S: Online Shop for Water Researchers https://baipatra.stores.instamojo.com/ Call for Paper: International Journal of HydroClimatic Engineering http://energyinstyle.website/journals/ Hydro Geek Newsletter Edition 2023.1 https://notionpress.com/read/hydro-geek-newsletter-edition-2023-1 Introducti

How to work with Cuckoo Search Algorithm?

Definition of the Cuckoo Search Algorithm  The Cuckoo Search Algorithm is a metaheuristic optimization algorithm inspired by the behavior of cuckoo birds. It was first introduced by Xin-She Yang and Suash Deb in 2009. This algorithm is based on the concept of brood parasitism, where cuckoo birds lay their eggs in the nests of other bird species, forcing them to raise their offspring. Similarly, in the Cuckoo Search Algorithm, a population of candidate solutions (cuckoos) is generated and each solution represents a potential solution to the optimization problem. These solutions are then evaluated based on their fitness, which represents how well they perform in solving the problem. The algorithm follows a process of random search and local search, where each cuckoo's solution is modified and improved iteratively.  The best solutions are selected and used to generate new solutions for the next iteration. This process continues until a stopping criterion is met, such as reaching a max