In this paper we present a genetic algorithm (GA)-based approach for the stereo matching problem. More precisely, the approach presented is a combination of a simple dynamic programming algorithm, commonly used for stereo matching, with a practical GA-based optimization scheme. The performance of our scheme was evaluated on standard test data of the Middlebury benchmark [1]. Specifically, the number of incorrect disparities on these data decreases by approximately 20% in comparison to the original approach (without the use of a GA).