Evolutionary algorithms are inspired by Darwinian evolution by mimicking the mechanisms of natural selection. The most well-known type, namely genetic algorithms (GAs), uses populations of potential solutions represented as chromosomes, subjecting them to selection, crossover, and mutation operations. Tailored for specific problems and characteristics, they tend to be today's much murmured research. This chapter proposes the different EAs and their systematic workflow. EA, the process, begins with the initialization of a population of potential solutions. These solutions undergo evaluation based on a predefined fitness function. Crossover and mutation operations then generate new candidate solutions. This iterative process continues until convergence or a predefined stopping criterion is met. The performance of EA depends on parameter settings. Tuning parameters with crossover and mutation rates, and population size. EA's have been rooted in the elegance of nature's optimization strategies. They have evolved into indispensable tools for solving complex problems across domains. It has been changed as a valuable asset for many researchers. The overall perspective of EA in various ways is discussed in the chapter.