Evolutionary Algorithms (EAs) are found to be effective for solving a large variety of optimization problems. In this Paper Dual Population Genetic Algorithm (DPGA) is used for solving the test functions of Congress on Evolutionary Computation 2013 (CEC’2013), by using two different crossovers. Dual Population Genetic Algorithm is found to be better in performance than traditional Genetic Algorithm. It is also able to solve the problem of premature convergence and diversity of the population in genetic algorithm. This paper proposes Dual Population Genetic Algorithm for solving the problem regarding unconstrained optimization. Dual Population Genetic Algorithm is used as meta-heuristic which is verified against 28 functions from Problem Definitions and Evaluation Criteria for the Congress on Evolutionary Computation 2013 on unconstrained set of benchmark functions using two different crossovers. The results of both the crossovers are compared with each other. The results of both the crossovers are also compared with the existing results of Standard Particle Swarm Optimization algorithm. The Experimental results showed that the algorithm found to be better for finding the solution of multimodal functions of the problem set.

Dual Population Genetic Algorithm is an effective optimization algorithm that provides additional diversity to the main population. It deals with the premature convergence problem as well as the diversity problem associated with Genetic Algorithm. But dual population introduces additional search space that increases time required to find an optimal solution. This large scale search space problem can be easily solved using all available cores of current age multi-core processors. Experiments are conducted on the problem set of CEC 2006 constrained optimization problems. Results of Sequential DPGA and OpenMP DPGA are compared on the basis of accuracy and run time. OpenMP DPGA gives speed up in execution.

Dual Population Genetic Algorithm is an effective optimization algorithm that provides additional diversity to the main population. It addresses the premature convergence problem as well as the diversity problem associated with Genetic Algorithm. Thus it restricts their individuals to be trapped in the local optima. This paper proposes Dual Population Genetic Algorithm for solving Constrained Optimization Problems. A novel method based on maximum constrains satisfaction is applied as constrains handling technique and Dual Population Genetic Algorithm is used as meta-heuristic. This method is verified against 9 problems from Problem Definitions and Evaluation Criteria for the Congress on Evolutionary Computation 2006 Special Session on Constrained Real-Parameter Optimization problem set. The results are compared with existing algorithms such as Ant Bee Colony Algorithm, Differential Evolution Algorithm and Genetic Algorithm that have been used for solving same problem set. Analysis shows that this technique gives results close to optimum value but fails to obtain exact optimum solution. In future Dual Population Genetic Algorithm can produce more efficient solutions using alternative constrains handling technique.