This paper deals with the problem of finding the optimal sequence in which the success rate of a Korean spelling corrector is maximized. The Korean spelling corrector consists of 18 modules, and each module performs unique corrective operations. The issue of optimization of the Korean spelling corrector has similar characteristics as those of Traveling Salesman Problem, coming under NP hard issue. In our Korean spelling corrector, corrective operation of each module has an effect on corrective operations of other modules. In the experiment, we used the Genetic Algorithm to find the optimal module sequence of Korean spelling corrector.