In this paper we define a new approach to solve the location routing problem (LRP). LRP is a relatively new research direction within location analysis that takes into account vehicle routing aspects. In this research it is proposed a new heuristic method base on simulated annealing to solve a capacitated location routing problem. At first an initial solution is produced by a greedy approach and then encoding this initial solution to use in optimization language and finally apply neighborhood search method to improve the initial solution. Finally, to verify the quality of our new approach in term of solution quality, one well-known data problem set is selected. The numerical examples show the efficiency of our approach.