In the Travelling Salesman Problem TSP$,$ to finding the shortest route Jerusalem, Ramallah, Nablus$),$ such that each city is visited only once through $5$ cities $($Bethfethem$,$ Hebron, we use a genetic algorithm to solve this problem if the fitness once and in the end return to the starting city. distance, write the child that produced from these parents wunction is used according to the shortest one child only

BHRJNB

HBJNRH

Answer