In travelling salesman problem is it possible to find optimal path(rather than cost of the optimal path) for cities<=16

I am taking that you are talking about THE travelling salesman problem.

The problem itself is to find the optimal path (not the cost of the optimal path.) Only, there is no polynomial-time deterministic solution found till now.

If you are talking about some specific contest problem, please also share the problem link.

for example this problem Travelling Salesman Problem using Dynamic Programming - GeeksforGeeks

here they are calculating only cost of the path,but they are not printing the path in which salesman should travel.

any link for printing the optimal path would be very helpful.

There is an example in there, to make everything clear.