List all the possible tours, except exclude those that are simply the reverse of previously listed tours

Calculate the distance of each of these tours and thereby identify the optimal tour.

C$.$

Starting with $1-2-3-4-5-6-7-1$ as the initial trial solution, apply the sub$-$tour reversal algorithm to this problem.

trial solution.

Apply the sub$-$tour reversal algorithm to this problem when starting with $1-2-4-5-6-7-3-1$ as the initial