Dynamic Programming in Genetic algorithm for solving Traveling Salesman Problem

Question

pleas help me !.

I need Dynamic programming in genetic algorithm for solving TSP.

Initially I have taken two parents and substitute in one formula of Partial candidate solutin (D) formula by getting the D values. After getting (D) values put it in Dynamic programming to generate a offspring (crossover) for obtaining the best solution. I need implementaion part help