A hybrid method of evolutionary algorithms is introduced in this study. The hybrid method includes two additional operations, acceleration and migrating operations. These two operations are used for the improvement of the convergence speed without decreasing diversity among the individuals. The hybrid method incorporated with multiplier updating is introduced to solve a dynamic optimization problem with constraints. This method can use the population size of five to obtain a more satisfactory solution, as compared to the original algorithm of differential evolution and BCPOL solver in IMSL library.