To improve protein folding simulations, we investigated a new search strategy in combination with the simple genetic algorithm on a two-dimensional lattice model. This search strategy, we called systematic crossover, couples the best individuals, tests every possible crossover point, and takes the two best individuals for the next generation. We compared the standard genetic algorithm with and without this new implementation for various chain lengths and showed that this strategy finds local minima with better energy values and is significantly faster in identifying the global minimum than the standard genetic algorithm.