Please explain step by step without any coding just simply by hand also please keep in mind one location can not be used twice other than the first one.

Consider the following mileage distance matrix pertaining to 10 locations (A to J). Construct a route of the shortest possible length. Your route must satisfy the following constraints. (a) It must begin, and end at the same location. That is, your route must be closed. (b) You must visit all locations. (c) With the exception of your chosen initial location, you cannot visit any location more than once. For instance, an example of a feasible route is BIFDECAGJHB, and the total distance associated with that route is 171+140+143+20+171+71+10+10+20+50= 806 miles