Summary: A genetic algorithm with local search strategy (LSGA) is proposed, which uses genetic algorithm to find the best individual each generation, and whose local search is executed nearby the best individual. Experimental results on six multi-modal benchmark functions show that the ability of finding optimal solution and convergence speed by LSGA are better than using the real-coded genetic algorithm with elite strategy.