In order to improve the distribution and convergence of constrained optimization algorithms, this paper proposes a constrained optimization algorithm based on double populations. Firstly the feasible solutions and infeasible solutions are stored separately through two populations, which can avoid direct comparison between them. The usage of efficient information carried by the infeasible solutions will enlarge exploitation scope and strength diversity of populations. At the same time, adopting the presented concept of constraints domination to update the infeasible set may keep good variety of population and give consideration to convergence. Also the improved mutation operation is employed to further raise the diversity and convergence. The suggested algorithm is compared with 3 state-of-the-art constrained optimization algorithms on standard test problems g01-g13 . Simulation results show that the presented algorithm has certain advantages than other algorithms because it can ensure good convergence accuracy while it has good robustness.