In this paper, the TSP(traveling salesman problem) which its costs(distance) between nodes are defined with Max($ar{x}$, $ar{y}$) has been dealt. In order to find a satisfactory solution for this kind of problem, we generate weighted matrix, and then develope a new heuristic problem solving method using the weighted matrix. Also we analyze the effectiveness of the newly developed heuristic method comparing it with other heuristic algorithm already exists for Euclidean TSP. Finally, we apply a new developed algorithm to real Max($ar{x}$,$ar{y}$) TSP such as PCB inserting.