In this paper, a personification algorithm for solving the Traveling Salesman Problem (TSP) is proposed, which is based on original greedy algorithm. The algorithm adopts neighborhood definition, the main idea is that to give a full array of all cities, and so full array of command to generate a loop with a greedy algorithm. Through the city exchange and Sub-sequence migration, it generates a better solution in the current neighborhood search. If the solution is found, it becomes the new current solution. Then, repeat the process. In the search process, Off-trap strategies are used to jump from local optimal solution and guide the search in promising directions. The results of the algorithm are compared to the Full Sub-path Ejection Algorithm (F-SEC) proposed by Rego .