The clustering problem is often mapped to one of searching for an optimum partition from all possible and valid partitions such that some goodness of fit criterion is optimized. It can therefore be formally considered a particular class of NP-hard problem (Falkenauer, 1998) which has led to the development of efficient metaheuristics to provide near-optimal solutions in reasonable time. Evolutionary algorithms are a class of population-based optimization techniques that mimic the biological evolution process and include among others genetic algorithms (GA), genetic programming (GP), evolutionary strategies (ES), evolutionary programming (EP) and newer techniques such as differential evolution (DE) and memetic algorithms (MA). These methods solve the optimization problem by evolving a population of possible solutions by using a set of evolutionary operators that act on solutions based on their relative fitness. The methods differ in the way they represent potential solutions and the way the evolutionary operators are handled, which dictates their applicability to certain types of optimization problems. Selection, crossover and mutation are the most widely used evolutionary operators. The population evolves when the selection operator chooses a subset of the fittest solutions in the present generation to reproduce using recombination operators such as crossover and mutation. The evolved population on the average is fitter than the population it replaces.