By having different points in a specific space, the need arises to go through them taking as a reference the problem of the traveling agent, so also arises another problem in the journey in space, which is the risk that the paths intersect in space, therefore the research presents to solve it applies a strategy to the genetic algorithm to avoid these cuts, where the advantage of not competing all against all was taken advantage of, but from a small population the universe of cases is traversed, finding the best possible route in space avoiding these cuts. Taking into account the functions of the genetic algorithm these problems were solved using the strategy of bringing from the previous generation a pair of better individuals to the current generation. Considering if you have 50 nodes in space we managed to solve in 15.1 sec, generating a sequence of duration and depending on the x nodes in the linear equation of y = 0.3134x + 0.733, with R2 = 0.978, thus also for the variance method reflects the equation y = 0,0009x3 - 0,1256x2 + 6,1963x - 36,563, con R2 = 0,9349. Managing to find the best optimal route in finite space solving the problems found.