Grammar Evolution (GE) can be considered a form of Genetic Programming (GP) that has become very popular in the field of Automatic Programming (AP) over the last few years. There has been a lot of research on different aspects of GE, including its parts; the Search Engine, Mapping Process, and Grammar. However, it has been shown that it is possible to select the codons randomly to improve the GE, using a random permutation. This paper introduces a new approach to intensify a solution using permutation heuristics to guide the codon selection order. A non -parametric test was applied to discern between the results obtained by the proposal and those obtained by the canonical GE version and the GE with random permutations.