Low-discrepancy sequences provide a way to generate quasi-random numbers of high dimensionality with a very high level of uniformity. The nearly orthogonal Latin hypercube and the generalized Halton sequence are two pop- ular methods when it comes to generate low-discrepancy sequences. In this article, we propose to use evolutionary algorithms in order to nd optimized solutions to the combinatorial problem of con guring generators of these se- quences. Experimental results show that the optimized sequence generators behave at least as well as generators from the literature for the Halton sequence and signi cantly better for the nearly orthogonal Latin hypercube.